./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 55ec916898aa0c4eb40269e81429fc0273ca07ec4caf7be0cd441cce0028ad79 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:38:01,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:38:01,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:38:01,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:38:01,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:38:01,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:38:01,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:38:01,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:38:01,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:38:01,333 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:38:01,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:38:01,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:38:01,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:38:01,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:38:01,335 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:38:01,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:38:01,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:38:01,336 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:38:01,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:38:01,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:38:01,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:38:01,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:38:01,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:38:01,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:38:01,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:38:01,342 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:38:01,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:38:01,342 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:38:01,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:38:01,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:38:01,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:38:01,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:38:01,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:38:01,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:38:01,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:38:01,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:38:01,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:38:01,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:38:01,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:38:01,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:38:01,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:38:01,350 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:38:01,350 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 -> 55ec916898aa0c4eb40269e81429fc0273ca07ec4caf7be0cd441cce0028ad79 [2024-11-09 23:38:01,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:38:01,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:38:01,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:38:01,617 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:38:01,617 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:38:01,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2024-11-09 23:38:03,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:38:03,236 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:38:03,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2024-11-09 23:38:03,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37e447f36/e06642648d2441e3a0321fe80a1e39cd/FLAG2311eb770 [2024-11-09 23:38:03,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37e447f36/e06642648d2441e3a0321fe80a1e39cd [2024-11-09 23:38:03,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:38:03,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:38:03,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:38:03,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:38:03,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:38:03,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:38:03" (1/1) ... [2024-11-09 23:38:03,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123a818b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:03, skipping insertion in model container [2024-11-09 23:38:03,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:38:03" (1/1) ... [2024-11-09 23:38:03,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:38:03,927 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/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c[26555,26568] [2024-11-09 23:38:03,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:38:03,943 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:38:04,018 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/pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c[26555,26568] [2024-11-09 23:38:04,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:38:04,042 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:38:04,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:04 WrapperNode [2024-11-09 23:38:04,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:38:04,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:38:04,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:38:04,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:38:04,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:04" (1/1) ... [2024-11-09 23:38:04,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:04" (1/1) ... [2024-11-09 23:38:04,094 INFO L138 Inliner]: procedures = 28, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 527 [2024-11-09 23:38:04,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:38:04,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:38:04,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:38:04,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:38:04,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:04" (1/1) ... [2024-11-09 23:38:04,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:04" (1/1) ... [2024-11-09 23:38:04,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:04" (1/1) ... [2024-11-09 23:38:04,143 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-09 23:38:04,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:04" (1/1) ... [2024-11-09 23:38:04,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:04" (1/1) ... [2024-11-09 23:38:04,160 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:04" (1/1) ... [2024-11-09 23:38:04,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:04" (1/1) ... [2024-11-09 23:38:04,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:04" (1/1) ... [2024-11-09 23:38:04,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:04" (1/1) ... [2024-11-09 23:38:04,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:38:04,169 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:38:04,169 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:38:04,170 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:38:04,170 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:04" (1/1) ... [2024-11-09 23:38:04,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:38:04,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:38:04,215 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-09 23:38:04,222 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-09 23:38:04,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:38:04,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:38:04,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:38:04,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:38:04,403 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:38:04,405 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:38:04,891 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-09 23:38:04,892 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:38:04,914 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:38:04,915 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:38:04,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:38:04 BoogieIcfgContainer [2024-11-09 23:38:04,915 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:38:04,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:38:04,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:38:04,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:38:04,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:38:03" (1/3) ... [2024-11-09 23:38:04,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6295c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:38:04, skipping insertion in model container [2024-11-09 23:38:04,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:04" (2/3) ... [2024-11-09 23:38:04,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6295c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:38:04, skipping insertion in model container [2024-11-09 23:38:04,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:38:04" (3/3) ... [2024-11-09 23:38:04,924 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals.c [2024-11-09 23:38:04,961 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:38:04,961 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:38:05,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:38:05,047 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;@35588426, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:38:05,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:38:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 134 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:05,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 23:38:05,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:05,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:05,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:05,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:05,071 INFO L85 PathProgramCache]: Analyzing trace with hash -407824333, now seen corresponding path program 1 times [2024-11-09 23:38:05,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:05,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328728183] [2024-11-09 23:38:05,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:05,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:05,461 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-09 23:38:05,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:05,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328728183] [2024-11-09 23:38:05,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328728183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:05,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:05,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:38:05,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714533666] [2024-11-09 23:38:05,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:05,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:38:05,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:05,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:38:05,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:38:05,503 INFO L87 Difference]: Start difference. First operand has 135 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 134 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-09 23:38:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:05,538 INFO L93 Difference]: Finished difference Result 199 states and 340 transitions. [2024-11-09 23:38:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:38:05,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-09 23:38:05,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:05,551 INFO L225 Difference]: With dead ends: 199 [2024-11-09 23:38:05,551 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 23:38:05,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:38:05,560 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:05,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 23:38:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-09 23:38:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.7674418604651163) internal successors, (228), 129 states have internal predecessors, (228), 0 states have call successors, (0), 0 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-09 23:38:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 228 transitions. [2024-11-09 23:38:05,601 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 228 transitions. Word has length 31 [2024-11-09 23:38:05,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:05,601 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 228 transitions. [2024-11-09 23:38:05,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-09 23:38:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 228 transitions. [2024-11-09 23:38:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 23:38:05,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:05,603 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:05,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:38:05,604 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:05,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:05,605 INFO L85 PathProgramCache]: Analyzing trace with hash -376804526, now seen corresponding path program 1 times [2024-11-09 23:38:05,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:05,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259796123] [2024-11-09 23:38:05,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:05,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:05,910 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-09 23:38:05,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:05,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259796123] [2024-11-09 23:38:05,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259796123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:05,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:05,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:38:05,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779347633] [2024-11-09 23:38:05,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:05,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:38:05,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:05,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:38:05,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:05,915 INFO L87 Difference]: Start difference. First operand 130 states and 228 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-09 23:38:06,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:06,026 INFO L93 Difference]: Finished difference Result 197 states and 332 transitions. [2024-11-09 23:38:06,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:38:06,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-09 23:38:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:06,031 INFO L225 Difference]: With dead ends: 197 [2024-11-09 23:38:06,031 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 23:38:06,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:06,032 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:06,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 838 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 23:38:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-09 23:38:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.2945736434108528) internal successors, (167), 129 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-09 23:38:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 167 transitions. [2024-11-09 23:38:06,053 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 167 transitions. Word has length 31 [2024-11-09 23:38:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:06,053 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 167 transitions. [2024-11-09 23:38:06,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 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-09 23:38:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 167 transitions. [2024-11-09 23:38:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 23:38:06,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:06,056 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:06,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:38:06,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:06,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:06,057 INFO L85 PathProgramCache]: Analyzing trace with hash 552981270, now seen corresponding path program 1 times [2024-11-09 23:38:06,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:06,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102499278] [2024-11-09 23:38:06,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:06,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:06,579 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-09 23:38:06,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:06,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102499278] [2024-11-09 23:38:06,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102499278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:06,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:06,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 23:38:06,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875128790] [2024-11-09 23:38:06,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:06,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:38:06,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:06,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:38:06,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:38:06,585 INFO L87 Difference]: Start difference. First operand 130 states and 167 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 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-09 23:38:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:07,205 INFO L93 Difference]: Finished difference Result 1138 states and 1767 transitions. [2024-11-09 23:38:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 23:38:07,206 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 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-09 23:38:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:07,212 INFO L225 Difference]: With dead ends: 1138 [2024-11-09 23:38:07,212 INFO L226 Difference]: Without dead ends: 1075 [2024-11-09 23:38:07,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:38:07,216 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1894 mSDsluCounter, 4619 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1894 SdHoareTripleChecker+Valid, 4780 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:07,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1894 Valid, 4780 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:38:07,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2024-11-09 23:38:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 190. [2024-11-09 23:38:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.3915343915343916) internal successors, (263), 189 states have internal predecessors, (263), 0 states have call successors, (0), 0 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-09 23:38:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 263 transitions. [2024-11-09 23:38:07,255 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 263 transitions. Word has length 91 [2024-11-09 23:38:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:07,256 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 263 transitions. [2024-11-09 23:38:07,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 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-09 23:38:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 263 transitions. [2024-11-09 23:38:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 23:38:07,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:07,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:07,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:38:07,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:07,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:07,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1128416280, now seen corresponding path program 1 times [2024-11-09 23:38:07,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:07,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664590366] [2024-11-09 23:38:07,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:07,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:07,940 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-09 23:38:07,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:07,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664590366] [2024-11-09 23:38:07,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664590366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:07,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:07,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 23:38:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514806797] [2024-11-09 23:38:07,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:07,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:38:07,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:07,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:38:07,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:38:07,943 INFO L87 Difference]: Start difference. First operand 190 states and 263 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-09 23:38:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:08,409 INFO L93 Difference]: Finished difference Result 316 states and 461 transitions. [2024-11-09 23:38:08,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 23:38:08,410 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-09 23:38:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:08,411 INFO L225 Difference]: With dead ends: 316 [2024-11-09 23:38:08,411 INFO L226 Difference]: Without dead ends: 193 [2024-11-09 23:38:08,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-09 23:38:08,413 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 636 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:08,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 839 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-09 23:38:08,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2024-11-09 23:38:08,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.3862433862433863) internal successors, (262), 189 states have internal predecessors, (262), 0 states have call successors, (0), 0 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-09 23:38:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 262 transitions. [2024-11-09 23:38:08,420 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 262 transitions. Word has length 93 [2024-11-09 23:38:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:08,421 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 262 transitions. [2024-11-09 23:38:08,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 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-09 23:38:08,421 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 262 transitions. [2024-11-09 23:38:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 23:38:08,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:08,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:08,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:38:08,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:08,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:08,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1949981780, now seen corresponding path program 1 times [2024-11-09 23:38:08,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:08,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088942678] [2024-11-09 23:38:08,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:08,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:08,554 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-09 23:38:08,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:08,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088942678] [2024-11-09 23:38:08,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088942678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:08,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:08,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:08,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131270516] [2024-11-09 23:38:08,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:08,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:08,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:08,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:08,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:08,556 INFO L87 Difference]: Start difference. First operand 190 states and 262 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-09 23:38:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:08,581 INFO L93 Difference]: Finished difference Result 424 states and 632 transitions. [2024-11-09 23:38:08,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:08,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-09 23:38:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:08,584 INFO L225 Difference]: With dead ends: 424 [2024-11-09 23:38:08,584 INFO L226 Difference]: Without dead ends: 301 [2024-11-09 23:38:08,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:08,588 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 69 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:08,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 259 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-09 23:38:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 298. [2024-11-09 23:38:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4545454545454546) internal successors, (432), 297 states have internal predecessors, (432), 0 states have call successors, (0), 0 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-09 23:38:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 432 transitions. [2024-11-09 23:38:08,607 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 432 transitions. Word has length 94 [2024-11-09 23:38:08,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:08,608 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 432 transitions. [2024-11-09 23:38:08,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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-09 23:38:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 432 transitions. [2024-11-09 23:38:08,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:38:08,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:08,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:08,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:38:08,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:08,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:08,612 INFO L85 PathProgramCache]: Analyzing trace with hash -214538694, now seen corresponding path program 1 times [2024-11-09 23:38:08,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:08,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105216109] [2024-11-09 23:38:08,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:08,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:08,730 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-09 23:38:08,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:08,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105216109] [2024-11-09 23:38:08,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105216109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:08,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:08,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:08,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442021655] [2024-11-09 23:38:08,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:08,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:08,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:08,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:08,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:08,733 INFO L87 Difference]: Start difference. First operand 298 states and 432 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:08,759 INFO L93 Difference]: Finished difference Result 744 states and 1134 transitions. [2024-11-09 23:38:08,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:08,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-09 23:38:08,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:08,762 INFO L225 Difference]: With dead ends: 744 [2024-11-09 23:38:08,763 INFO L226 Difference]: Without dead ends: 513 [2024-11-09 23:38:08,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:08,764 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 87 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:08,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 350 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-09 23:38:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 510. [2024-11-09 23:38:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 1.49901768172888) internal successors, (763), 509 states have internal predecessors, (763), 0 states have call successors, (0), 0 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-09 23:38:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 763 transitions. [2024-11-09 23:38:08,779 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 763 transitions. Word has length 95 [2024-11-09 23:38:08,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:08,780 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 763 transitions. [2024-11-09 23:38:08,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:08,780 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 763 transitions. [2024-11-09 23:38:08,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:38:08,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:08,781 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:08,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:38:08,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:08,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:08,782 INFO L85 PathProgramCache]: Analyzing trace with hash 893561210, now seen corresponding path program 1 times [2024-11-09 23:38:08,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:08,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248195698] [2024-11-09 23:38:08,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:08,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:08,872 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-09 23:38:08,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:08,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248195698] [2024-11-09 23:38:08,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248195698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:08,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:08,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:08,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334474096] [2024-11-09 23:38:08,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:08,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:08,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:08,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:08,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:08,875 INFO L87 Difference]: Start difference. First operand 510 states and 763 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:08,903 INFO L93 Difference]: Finished difference Result 1364 states and 2099 transitions. [2024-11-09 23:38:08,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:08,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-09 23:38:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:08,908 INFO L225 Difference]: With dead ends: 1364 [2024-11-09 23:38:08,908 INFO L226 Difference]: Without dead ends: 921 [2024-11-09 23:38:08,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:08,910 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 85 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:08,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 352 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2024-11-09 23:38:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 918. [2024-11-09 23:38:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 917 states have (on average 1.5190839694656488) internal successors, (1393), 917 states have internal predecessors, (1393), 0 states have call successors, (0), 0 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-09 23:38:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1393 transitions. [2024-11-09 23:38:08,935 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1393 transitions. Word has length 95 [2024-11-09 23:38:08,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:08,936 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1393 transitions. [2024-11-09 23:38:08,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1393 transitions. [2024-11-09 23:38:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:38:08,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:08,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:08,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:38:08,938 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:08,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:08,938 INFO L85 PathProgramCache]: Analyzing trace with hash 403094714, now seen corresponding path program 1 times [2024-11-09 23:38:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:08,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234177094] [2024-11-09 23:38:08,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:08,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:09,024 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-09 23:38:09,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:09,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234177094] [2024-11-09 23:38:09,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234177094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:09,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:09,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:09,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979998680] [2024-11-09 23:38:09,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:09,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:09,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:09,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:09,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:09,026 INFO L87 Difference]: Start difference. First operand 918 states and 1393 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:09,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:09,065 INFO L93 Difference]: Finished difference Result 2556 states and 3933 transitions. [2024-11-09 23:38:09,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:09,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-09 23:38:09,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:09,073 INFO L225 Difference]: With dead ends: 2556 [2024-11-09 23:38:09,073 INFO L226 Difference]: Without dead ends: 1705 [2024-11-09 23:38:09,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:09,076 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 83 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:09,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 354 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2024-11-09 23:38:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1702. [2024-11-09 23:38:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1701 states have (on average 1.5220458553791887) internal successors, (2589), 1701 states have internal predecessors, (2589), 0 states have call successors, (0), 0 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-09 23:38:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2589 transitions. [2024-11-09 23:38:09,156 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2589 transitions. Word has length 95 [2024-11-09 23:38:09,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:09,157 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2589 transitions. [2024-11-09 23:38:09,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2589 transitions. [2024-11-09 23:38:09,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:38:09,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:09,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:09,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:38:09,159 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:09,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:09,159 INFO L85 PathProgramCache]: Analyzing trace with hash 121020410, now seen corresponding path program 1 times [2024-11-09 23:38:09,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:09,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016360591] [2024-11-09 23:38:09,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:09,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:09,269 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-09 23:38:09,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:09,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016360591] [2024-11-09 23:38:09,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016360591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:09,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:09,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:09,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933088921] [2024-11-09 23:38:09,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:09,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:09,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:09,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:09,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:09,271 INFO L87 Difference]: Start difference. First operand 1702 states and 2589 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:09,334 INFO L93 Difference]: Finished difference Result 4844 states and 7409 transitions. [2024-11-09 23:38:09,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:09,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-09 23:38:09,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:09,346 INFO L225 Difference]: With dead ends: 4844 [2024-11-09 23:38:09,346 INFO L226 Difference]: Without dead ends: 3209 [2024-11-09 23:38:09,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:09,351 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 81 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:09,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 356 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2024-11-09 23:38:09,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 3206. [2024-11-09 23:38:09,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3206 states, 3205 states have (on average 1.5141965678627145) internal successors, (4853), 3205 states have internal predecessors, (4853), 0 states have call successors, (0), 0 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-09 23:38:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 3206 states and 4853 transitions. [2024-11-09 23:38:09,438 INFO L78 Accepts]: Start accepts. Automaton has 3206 states and 4853 transitions. Word has length 95 [2024-11-09 23:38:09,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:09,438 INFO L471 AbstractCegarLoop]: Abstraction has 3206 states and 4853 transitions. [2024-11-09 23:38:09,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 4853 transitions. [2024-11-09 23:38:09,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:38:09,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:09,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:09,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:38:09,440 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:09,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:09,441 INFO L85 PathProgramCache]: Analyzing trace with hash -880389318, now seen corresponding path program 1 times [2024-11-09 23:38:09,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:09,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898489965] [2024-11-09 23:38:09,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:09,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:09,526 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-09 23:38:09,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:09,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898489965] [2024-11-09 23:38:09,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898489965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:09,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:09,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:09,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658882875] [2024-11-09 23:38:09,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:09,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:09,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:09,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:09,529 INFO L87 Difference]: Start difference. First operand 3206 states and 4853 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:09,662 INFO L93 Difference]: Finished difference Result 9228 states and 13977 transitions. [2024-11-09 23:38:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:09,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-09 23:38:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:09,683 INFO L225 Difference]: With dead ends: 9228 [2024-11-09 23:38:09,683 INFO L226 Difference]: Without dead ends: 6089 [2024-11-09 23:38:09,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:09,688 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 79 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:09,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 358 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6089 states. [2024-11-09 23:38:09,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6089 to 6086. [2024-11-09 23:38:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6086 states, 6085 states have (on average 1.4995891536565324) internal successors, (9125), 6085 states have internal predecessors, (9125), 0 states have call successors, (0), 0 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-09 23:38:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 9125 transitions. [2024-11-09 23:38:09,850 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 9125 transitions. Word has length 95 [2024-11-09 23:38:09,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:09,850 INFO L471 AbstractCegarLoop]: Abstraction has 6086 states and 9125 transitions. [2024-11-09 23:38:09,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 9125 transitions. [2024-11-09 23:38:09,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:38:09,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:09,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:09,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:38:09,852 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:09,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:09,853 INFO L85 PathProgramCache]: Analyzing trace with hash -894839174, now seen corresponding path program 1 times [2024-11-09 23:38:09,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:09,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158723314] [2024-11-09 23:38:09,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:09,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:09,949 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-09 23:38:09,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:09,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158723314] [2024-11-09 23:38:09,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158723314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:09,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:09,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:09,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605296476] [2024-11-09 23:38:09,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:09,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:09,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:09,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:09,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:09,951 INFO L87 Difference]: Start difference. First operand 6086 states and 9125 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:10,192 INFO L93 Difference]: Finished difference Result 17612 states and 26345 transitions. [2024-11-09 23:38:10,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:10,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-09 23:38:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:10,241 INFO L225 Difference]: With dead ends: 17612 [2024-11-09 23:38:10,242 INFO L226 Difference]: Without dead ends: 11593 [2024-11-09 23:38:10,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:10,258 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 77 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:10,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 360 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:10,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11593 states. [2024-11-09 23:38:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11593 to 11590. [2024-11-09 23:38:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11590 states, 11589 states have (on average 1.4804556044524981) internal successors, (17157), 11589 states have internal predecessors, (17157), 0 states have call successors, (0), 0 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-09 23:38:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11590 states to 11590 states and 17157 transitions. [2024-11-09 23:38:10,652 INFO L78 Accepts]: Start accepts. Automaton has 11590 states and 17157 transitions. Word has length 95 [2024-11-09 23:38:10,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:10,652 INFO L471 AbstractCegarLoop]: Abstraction has 11590 states and 17157 transitions. [2024-11-09 23:38:10,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 11590 states and 17157 transitions. [2024-11-09 23:38:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:38:10,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:10,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:10,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:38:10,654 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:10,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1196763578, now seen corresponding path program 1 times [2024-11-09 23:38:10,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:10,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217789012] [2024-11-09 23:38:10,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:10,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:10,731 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-09 23:38:10,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:10,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217789012] [2024-11-09 23:38:10,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217789012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:10,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:10,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:10,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151427368] [2024-11-09 23:38:10,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:10,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:10,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:10,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:10,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:10,733 INFO L87 Difference]: Start difference. First operand 11590 states and 17157 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:11,191 INFO L93 Difference]: Finished difference Result 33612 states and 49545 transitions. [2024-11-09 23:38:11,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:11,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-09 23:38:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:11,243 INFO L225 Difference]: With dead ends: 33612 [2024-11-09 23:38:11,243 INFO L226 Difference]: Without dead ends: 22089 [2024-11-09 23:38:11,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:11,266 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 75 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:11,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 362 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22089 states. [2024-11-09 23:38:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22089 to 22086. [2024-11-09 23:38:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22086 states, 22085 states have (on average 1.4578673307674892) internal successors, (32197), 22085 states have internal predecessors, (32197), 0 states have call successors, (0), 0 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-09 23:38:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22086 states to 22086 states and 32197 transitions. [2024-11-09 23:38:11,966 INFO L78 Accepts]: Start accepts. Automaton has 22086 states and 32197 transitions. Word has length 95 [2024-11-09 23:38:11,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:11,967 INFO L471 AbstractCegarLoop]: Abstraction has 22086 states and 32197 transitions. [2024-11-09 23:38:11,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 22086 states and 32197 transitions. [2024-11-09 23:38:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:38:11,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:11,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:11,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:38:11,969 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:11,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash 672486523, now seen corresponding path program 1 times [2024-11-09 23:38:11,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:11,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383313358] [2024-11-09 23:38:11,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:11,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:12,385 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-09 23:38:12,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:12,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383313358] [2024-11-09 23:38:12,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383313358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:12,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:12,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:38:12,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453603824] [2024-11-09 23:38:12,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:12,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:38:12,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:12,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:38:12,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:38:12,388 INFO L87 Difference]: Start difference. First operand 22086 states and 32197 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:12,768 INFO L93 Difference]: Finished difference Result 22857 states and 33223 transitions. [2024-11-09 23:38:12,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:38:12,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-09 23:38:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:12,813 INFO L225 Difference]: With dead ends: 22857 [2024-11-09 23:38:12,813 INFO L226 Difference]: Without dead ends: 22854 [2024-11-09 23:38:12,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:38:12,821 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:12,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1114 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22854 states. [2024-11-09 23:38:13,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22854 to 22854. [2024-11-09 23:38:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22854 states, 22853 states have (on average 1.4368791843521638) internal successors, (32837), 22853 states have internal predecessors, (32837), 0 states have call successors, (0), 0 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-09 23:38:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22854 states to 22854 states and 32837 transitions. [2024-11-09 23:38:13,531 INFO L78 Accepts]: Start accepts. Automaton has 22854 states and 32837 transitions. Word has length 95 [2024-11-09 23:38:13,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:13,531 INFO L471 AbstractCegarLoop]: Abstraction has 22854 states and 32837 transitions. [2024-11-09 23:38:13,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:13,532 INFO L276 IsEmpty]: Start isEmpty. Operand 22854 states and 32837 transitions. [2024-11-09 23:38:13,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:38:13,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:13,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:13,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:38:13,533 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:13,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:13,534 INFO L85 PathProgramCache]: Analyzing trace with hash 53342970, now seen corresponding path program 1 times [2024-11-09 23:38:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:13,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903808467] [2024-11-09 23:38:13,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:13,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:13,641 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-09 23:38:13,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:13,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903808467] [2024-11-09 23:38:13,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903808467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:13,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:13,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:13,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087864293] [2024-11-09 23:38:13,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:13,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:13,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:13,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:13,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:13,644 INFO L87 Difference]: Start difference. First operand 22854 states and 32837 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:14,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:14,467 INFO L93 Difference]: Finished difference Result 46927 states and 67661 transitions. [2024-11-09 23:38:14,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:14,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-09 23:38:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:14,542 INFO L225 Difference]: With dead ends: 46927 [2024-11-09 23:38:14,543 INFO L226 Difference]: Without dead ends: 34380 [2024-11-09 23:38:14,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:14,568 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 89 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:14,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 352 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:14,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34380 states. [2024-11-09 23:38:15,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34380 to 34377. [2024-11-09 23:38:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34377 states, 34376 states have (on average 1.4282057249243658) internal successors, (49096), 34376 states have internal predecessors, (49096), 0 states have call successors, (0), 0 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-09 23:38:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34377 states to 34377 states and 49096 transitions. [2024-11-09 23:38:15,697 INFO L78 Accepts]: Start accepts. Automaton has 34377 states and 49096 transitions. Word has length 95 [2024-11-09 23:38:15,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:15,698 INFO L471 AbstractCegarLoop]: Abstraction has 34377 states and 49096 transitions. [2024-11-09 23:38:15,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-09 23:38:15,698 INFO L276 IsEmpty]: Start isEmpty. Operand 34377 states and 49096 transitions. [2024-11-09 23:38:15,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 23:38:15,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:15,709 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:15,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:38:15,709 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:15,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:15,710 INFO L85 PathProgramCache]: Analyzing trace with hash 869485867, now seen corresponding path program 1 times [2024-11-09 23:38:15,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:15,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909680581] [2024-11-09 23:38:15,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:15,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 23:38:16,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:16,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909680581] [2024-11-09 23:38:16,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909680581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:16,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:16,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 23:38:16,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969149965] [2024-11-09 23:38:16,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:16,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:38:16,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:16,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:38:16,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:38:16,129 INFO L87 Difference]: Start difference. First operand 34377 states and 49096 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-09 23:38:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:19,989 INFO L93 Difference]: Finished difference Result 315876 states and 450906 transitions. [2024-11-09 23:38:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 23:38:19,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 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 122 [2024-11-09 23:38:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:20,684 INFO L225 Difference]: With dead ends: 315876 [2024-11-09 23:38:20,684 INFO L226 Difference]: Without dead ends: 281569 [2024-11-09 23:38:20,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:38:20,831 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 1590 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:20,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 2501 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:38:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281569 states. [2024-11-09 23:38:24,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281569 to 68681. [2024-11-09 23:38:24,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68681 states, 68680 states have (on average 1.4230634828188702) internal successors, (97736), 68680 states have internal predecessors, (97736), 0 states have call successors, (0), 0 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-09 23:38:25,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68681 states to 68681 states and 97736 transitions. [2024-11-09 23:38:25,206 INFO L78 Accepts]: Start accepts. Automaton has 68681 states and 97736 transitions. Word has length 122 [2024-11-09 23:38:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:25,207 INFO L471 AbstractCegarLoop]: Abstraction has 68681 states and 97736 transitions. [2024-11-09 23:38:25,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-09 23:38:25,207 INFO L276 IsEmpty]: Start isEmpty. Operand 68681 states and 97736 transitions. [2024-11-09 23:38:25,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 23:38:25,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:25,226 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:25,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:38:25,226 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:25,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:25,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1977585771, now seen corresponding path program 1 times [2024-11-09 23:38:25,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:25,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882979572] [2024-11-09 23:38:25,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:25,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 23:38:25,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:25,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882979572] [2024-11-09 23:38:25,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882979572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:25,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:25,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 23:38:25,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095470725] [2024-11-09 23:38:25,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:25,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:38:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:25,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:38:25,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:38:25,534 INFO L87 Difference]: Start difference. First operand 68681 states and 97736 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:30,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:30,538 INFO L93 Difference]: Finished difference Result 350180 states and 499546 transitions. [2024-11-09 23:38:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 23:38:30,539 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-09 23:38:30,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:31,085 INFO L225 Difference]: With dead ends: 350180 [2024-11-09 23:38:31,085 INFO L226 Difference]: Without dead ends: 315873 [2024-11-09 23:38:31,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:38:31,178 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 1619 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:31,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1619 Valid, 2308 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:38:31,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315873 states. [2024-11-09 23:38:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315873 to 120265. [2024-11-09 23:38:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120265 states, 120264 states have (on average 1.4172154593228232) internal successors, (170440), 120264 states have internal predecessors, (170440), 0 states have call successors, (0), 0 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-09 23:38:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120265 states to 120265 states and 170440 transitions. [2024-11-09 23:38:36,144 INFO L78 Accepts]: Start accepts. Automaton has 120265 states and 170440 transitions. Word has length 122 [2024-11-09 23:38:36,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:36,145 INFO L471 AbstractCegarLoop]: Abstraction has 120265 states and 170440 transitions. [2024-11-09 23:38:36,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:36,145 INFO L276 IsEmpty]: Start isEmpty. Operand 120265 states and 170440 transitions. [2024-11-09 23:38:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 23:38:36,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:36,160 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:36,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:38:36,160 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:36,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:36,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1487119275, now seen corresponding path program 1 times [2024-11-09 23:38:36,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:36,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314436700] [2024-11-09 23:38:36,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:36,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 23:38:36,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:36,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314436700] [2024-11-09 23:38:36,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314436700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:36,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:36,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 23:38:36,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984595446] [2024-11-09 23:38:36,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:36,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:38:36,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:36,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:38:36,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:38:36,456 INFO L87 Difference]: Start difference. First operand 120265 states and 170440 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:43,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:43,204 INFO L93 Difference]: Finished difference Result 384484 states and 548186 transitions. [2024-11-09 23:38:43,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 23:38:43,204 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-09 23:38:43,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:43,832 INFO L225 Difference]: With dead ends: 384484 [2024-11-09 23:38:43,832 INFO L226 Difference]: Without dead ends: 350177 [2024-11-09 23:38:43,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:38:43,934 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 1654 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:43,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 2253 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:38:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350177 states. [2024-11-09 23:38:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350177 to 154569. [2024-11-09 23:38:49,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154569 states, 154568 states have (on average 1.4173697013612132) internal successors, (219080), 154568 states have internal predecessors, (219080), 0 states have call successors, (0), 0 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-09 23:38:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154569 states to 154569 states and 219080 transitions. [2024-11-09 23:38:49,884 INFO L78 Accepts]: Start accepts. Automaton has 154569 states and 219080 transitions. Word has length 122 [2024-11-09 23:38:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:49,885 INFO L471 AbstractCegarLoop]: Abstraction has 154569 states and 219080 transitions. [2024-11-09 23:38:49,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 154569 states and 219080 transitions. [2024-11-09 23:38:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 23:38:49,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:49,899 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:38:49,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:38:49,900 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:49,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:49,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1205044971, now seen corresponding path program 1 times [2024-11-09 23:38:49,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:49,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440092302] [2024-11-09 23:38:49,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:49,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 23:38:50,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:50,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440092302] [2024-11-09 23:38:50,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440092302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:50,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:50,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 23:38:50,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324992869] [2024-11-09 23:38:50,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:50,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:38:50,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:50,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:38:50,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:38:50,527 INFO L87 Difference]: Start difference. First operand 154569 states and 219080 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:57,529 INFO L93 Difference]: Finished difference Result 418788 states and 596826 transitions. [2024-11-09 23:38:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 23:38:57,530 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-09 23:38:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:58,312 INFO L225 Difference]: With dead ends: 418788 [2024-11-09 23:38:58,312 INFO L226 Difference]: Without dead ends: 384481 [2024-11-09 23:38:58,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:38:58,443 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 1708 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:58,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1708 Valid, 2157 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:38:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384481 states.