./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:12:52,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:12:53,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:12:53,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:12:53,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:12:53,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:12:53,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:12:53,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:12:53,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:12:53,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:12:53,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:12:53,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:12:53,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:12:53,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:12:53,125 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:12:53,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:12:53,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:12:53,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:12:53,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:12:53,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:12:53,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:12:53,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:12:53,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:12:53,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:12:53,131 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:12:53,131 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:12:53,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:12:53,131 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:12:53,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:12:53,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:12:53,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:12:53,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:12:53,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:12:53,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:12:53,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:12:53,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:12:53,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:12:53,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:12:53,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:12:53,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:12:53,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:12:53,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:12:53,138 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 -> 904bd1313458c4f9af8d5bf1208ba922a2079eb77883d7ecd1ca28ceda09c9f6 [2024-11-11 21:12:53,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:12:53,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:12:53,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:12:53,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:12:53,436 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:12:53,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-11-11 21:12:55,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:12:55,246 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:12:55,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-11-11 21:12:55,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2c25287/f34c495fc8d245b992c88918918444a2/FLAGa688a1049 [2024-11-11 21:12:55,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2c25287/f34c495fc8d245b992c88918918444a2 [2024-11-11 21:12:55,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:12:55,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:12:55,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:12:55,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:12:55,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:12:55,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:12:55" (1/1) ... [2024-11-11 21:12:55,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce1c4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:55, skipping insertion in model container [2024-11-11 21:12:55,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:12:55" (1/1) ... [2024-11-11 21:12:55,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:12:55,617 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_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2024-11-11 21:12:55,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:12:55,646 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:12:55,716 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_floodmax.3.4.ufo.BOUNDED-6.pals.c[12764,12777] [2024-11-11 21:12:55,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:12:55,739 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:12:55,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:55 WrapperNode [2024-11-11 21:12:55,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:12:55,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:12:55,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:12:55,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:12:55,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:55" (1/1) ... [2024-11-11 21:12:55,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:55" (1/1) ... [2024-11-11 21:12:55,816 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 452 [2024-11-11 21:12:55,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:12:55,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:12:55,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:12:55,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:12:55,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:55" (1/1) ... [2024-11-11 21:12:55,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:55" (1/1) ... [2024-11-11 21:12:55,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:55" (1/1) ... [2024-11-11 21:12:55,876 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 21:12:55,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:55" (1/1) ... [2024-11-11 21:12:55,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:55" (1/1) ... [2024-11-11 21:12:55,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:55" (1/1) ... [2024-11-11 21:12:55,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:55" (1/1) ... [2024-11-11 21:12:55,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:55" (1/1) ... [2024-11-11 21:12:55,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:55" (1/1) ... [2024-11-11 21:12:55,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:12:55,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:12:55,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:12:55,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:12:55,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:55" (1/1) ... [2024-11-11 21:12:55,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:12:55,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:55,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:12:55,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:12:56,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:12:56,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:12:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:12:56,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:12:56,135 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:12:56,139 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:12:56,708 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-11 21:12:56,708 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:12:56,729 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:12:56,729 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 21:12:56,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:12:56 BoogieIcfgContainer [2024-11-11 21:12:56,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:12:56,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:12:56,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:12:56,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:12:56,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:12:55" (1/3) ... [2024-11-11 21:12:56,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b94db2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:12:56, skipping insertion in model container [2024-11-11 21:12:56,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:55" (2/3) ... [2024-11-11 21:12:56,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b94db2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:12:56, skipping insertion in model container [2024-11-11 21:12:56,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:12:56" (3/3) ... [2024-11-11 21:12:56,740 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2024-11-11 21:12:56,754 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:12:56,754 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:12:56,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:12:56,829 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;@1f99456b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:12:56,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:12:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 117 states have (on average 1.7863247863247864) internal successors, (209), 118 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 21:12:56,843 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:56,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:56,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:56,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:56,850 INFO L85 PathProgramCache]: Analyzing trace with hash 901132838, now seen corresponding path program 1 times [2024-11-11 21:12:56,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:56,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743976751] [2024-11-11 21:12:56,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:56,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:57,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:57,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743976751] [2024-11-11 21:12:57,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743976751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:57,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:57,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 21:12:57,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151415105] [2024-11-11 21:12:57,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:57,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 21:12:57,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:57,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 21:12:57,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 21:12:57,253 INFO L87 Difference]: Start difference. First operand has 119 states, 117 states have (on average 1.7863247863247864) internal successors, (209), 118 states have internal predecessors, (209), 0 states have call successors, (0), 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 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:57,277 INFO L93 Difference]: Finished difference Result 182 states and 316 transitions. [2024-11-11 21:12:57,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 21:12:57,279 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-11 21:12:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:57,288 INFO L225 Difference]: With dead ends: 182 [2024-11-11 21:12:57,288 INFO L226 Difference]: Without dead ends: 115 [2024-11-11 21:12:57,291 INFO L434 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-11 21:12:57,294 INFO L435 NwaCegarLoop]: 206 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, 206 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-11 21:12:57,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-11 21:12:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-11 21:12:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.7719298245614035) internal successors, (202), 114 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 202 transitions. [2024-11-11 21:12:57,328 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 202 transitions. Word has length 37 [2024-11-11 21:12:57,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:57,328 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 202 transitions. [2024-11-11 21:12:57,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 202 transitions. [2024-11-11 21:12:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-11 21:12:57,330 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:57,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:57,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:12:57,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:57,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:57,331 INFO L85 PathProgramCache]: Analyzing trace with hash 83484388, now seen corresponding path program 1 times [2024-11-11 21:12:57,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:57,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244656670] [2024-11-11 21:12:57,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:57,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:57,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:57,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244656670] [2024-11-11 21:12:57,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244656670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:57,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:57,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:57,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560808472] [2024-11-11 21:12:57,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:57,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:57,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:57,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:57,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:57,672 INFO L87 Difference]: Start difference. First operand 115 states and 202 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:57,792 INFO L93 Difference]: Finished difference Result 235 states and 406 transitions. [2024-11-11 21:12:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:57,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-11 21:12:57,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:57,794 INFO L225 Difference]: With dead ends: 235 [2024-11-11 21:12:57,794 INFO L226 Difference]: Without dead ends: 173 [2024-11-11 21:12:57,795 INFO L434 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-11 21:12:57,796 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 99 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:57,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 759 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:57,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-11 21:12:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 115. [2024-11-11 21:12:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5350877192982457) internal successors, (175), 114 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions. [2024-11-11 21:12:57,813 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 37 [2024-11-11 21:12:57,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:57,813 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 175 transitions. [2024-11-11 21:12:57,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2024-11-11 21:12:57,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 21:12:57,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:57,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:57,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:12:57,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:57,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:57,818 INFO L85 PathProgramCache]: Analyzing trace with hash -105296595, now seen corresponding path program 1 times [2024-11-11 21:12:57,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:57,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714894565] [2024-11-11 21:12:57,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:57,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:57,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:57,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714894565] [2024-11-11 21:12:57,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714894565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:57,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:57,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:57,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764145395] [2024-11-11 21:12:57,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:57,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:57,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:57,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:58,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:58,001 INFO L87 Difference]: Start difference. First operand 115 states and 175 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:58,071 INFO L93 Difference]: Finished difference Result 220 states and 354 transitions. [2024-11-11 21:12:58,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:58,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-11 21:12:58,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:58,073 INFO L225 Difference]: With dead ends: 220 [2024-11-11 21:12:58,073 INFO L226 Difference]: Without dead ends: 162 [2024-11-11 21:12:58,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:58,077 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 75 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:58,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 369 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:58,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-11 21:12:58,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2024-11-11 21:12:58,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.559748427672956) internal successors, (248), 159 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 248 transitions. [2024-11-11 21:12:58,088 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 248 transitions. Word has length 63 [2024-11-11 21:12:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:58,089 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 248 transitions. [2024-11-11 21:12:58,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 248 transitions. [2024-11-11 21:12:58,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 21:12:58,091 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:58,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:58,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:12:58,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:58,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:58,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2025700882, now seen corresponding path program 1 times [2024-11-11 21:12:58,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:58,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104737011] [2024-11-11 21:12:58,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:58,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:58,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:58,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104737011] [2024-11-11 21:12:58,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104737011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:58,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:58,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:58,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107350938] [2024-11-11 21:12:58,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:58,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:58,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:58,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:58,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:58,206 INFO L87 Difference]: Start difference. First operand 160 states and 248 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:58,234 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2024-11-11 21:12:58,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:58,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-11-11 21:12:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:58,238 INFO L225 Difference]: With dead ends: 312 [2024-11-11 21:12:58,240 INFO L226 Difference]: Without dead ends: 209 [2024-11-11 21:12:58,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:58,242 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 84 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:58,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 399 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:58,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-11 21:12:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-11-11 21:12:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.5922330097087378) internal successors, (328), 206 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 328 transitions. [2024-11-11 21:12:58,268 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 328 transitions. Word has length 65 [2024-11-11 21:12:58,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:58,269 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 328 transitions. [2024-11-11 21:12:58,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 328 transitions. [2024-11-11 21:12:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 21:12:58,273 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:58,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:58,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:12:58,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:58,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:58,274 INFO L85 PathProgramCache]: Analyzing trace with hash 34844053, now seen corresponding path program 1 times [2024-11-11 21:12:58,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:58,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254720164] [2024-11-11 21:12:58,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:58,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:58,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:58,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254720164] [2024-11-11 21:12:58,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254720164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:58,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:58,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:58,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511405330] [2024-11-11 21:12:58,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:58,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:58,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:58,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:58,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:58,435 INFO L87 Difference]: Start difference. First operand 207 states and 328 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:58,462 INFO L93 Difference]: Finished difference Result 482 states and 791 transitions. [2024-11-11 21:12:58,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:58,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-11-11 21:12:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:58,465 INFO L225 Difference]: With dead ends: 482 [2024-11-11 21:12:58,465 INFO L226 Difference]: Without dead ends: 334 [2024-11-11 21:12:58,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:58,470 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 77 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:58,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 386 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:58,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-11 21:12:58,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2024-11-11 21:12:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.6193353474320242) internal successors, (536), 331 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 536 transitions. [2024-11-11 21:12:58,498 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 536 transitions. Word has length 65 [2024-11-11 21:12:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:58,498 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 536 transitions. [2024-11-11 21:12:58,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 536 transitions. [2024-11-11 21:12:58,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:12:58,505 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:58,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:58,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:12:58,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:58,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:58,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1167801350, now seen corresponding path program 1 times [2024-11-11 21:12:58,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:58,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338669183] [2024-11-11 21:12:58,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:58,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:58,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:58,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338669183] [2024-11-11 21:12:58,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338669183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:58,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:58,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:58,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156715363] [2024-11-11 21:12:58,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:58,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:58,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:58,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:58,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:58,628 INFO L87 Difference]: Start difference. First operand 332 states and 536 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:58,658 INFO L93 Difference]: Finished difference Result 601 states and 987 transitions. [2024-11-11 21:12:58,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:58,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-11 21:12:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:58,661 INFO L225 Difference]: With dead ends: 601 [2024-11-11 21:12:58,661 INFO L226 Difference]: Without dead ends: 453 [2024-11-11 21:12:58,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:58,667 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 78 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:58,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 391 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:58,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-11 21:12:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 451. [2024-11-11 21:12:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 1.6244444444444444) internal successors, (731), 450 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 731 transitions. [2024-11-11 21:12:58,696 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 731 transitions. Word has length 67 [2024-11-11 21:12:58,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:58,698 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 731 transitions. [2024-11-11 21:12:58,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 731 transitions. [2024-11-11 21:12:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:12:58,700 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:58,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:58,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:12:58,701 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:58,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:58,703 INFO L85 PathProgramCache]: Analyzing trace with hash -171119363, now seen corresponding path program 1 times [2024-11-11 21:12:58,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:58,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107736207] [2024-11-11 21:12:58,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:58,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:58,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:58,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107736207] [2024-11-11 21:12:58,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107736207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:58,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:58,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:58,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568498220] [2024-11-11 21:12:58,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:58,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:58,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:58,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:58,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:58,853 INFO L87 Difference]: Start difference. First operand 451 states and 731 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:58,891 INFO L93 Difference]: Finished difference Result 1160 states and 1906 transitions. [2024-11-11 21:12:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:58,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-11 21:12:58,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:58,897 INFO L225 Difference]: With dead ends: 1160 [2024-11-11 21:12:58,897 INFO L226 Difference]: Without dead ends: 774 [2024-11-11 21:12:58,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:58,899 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 71 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:58,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 379 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2024-11-11 21:12:58,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 772. [2024-11-11 21:12:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 771 states have (on average 1.6212710765239948) internal successors, (1250), 771 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1250 transitions. [2024-11-11 21:12:58,925 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1250 transitions. Word has length 67 [2024-11-11 21:12:58,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:58,926 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1250 transitions. [2024-11-11 21:12:58,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1250 transitions. [2024-11-11 21:12:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 21:12:58,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:58,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:58,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:12:58,927 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:58,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:58,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1554688226, now seen corresponding path program 1 times [2024-11-11 21:12:58,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:58,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53893525] [2024-11-11 21:12:58,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:58,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:59,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:59,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53893525] [2024-11-11 21:12:59,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53893525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:59,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:59,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:59,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115389680] [2024-11-11 21:12:59,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:59,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:59,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:59,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:59,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:59,023 INFO L87 Difference]: Start difference. First operand 772 states and 1250 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:59,060 INFO L93 Difference]: Finished difference Result 1451 states and 2371 transitions. [2024-11-11 21:12:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:59,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-11 21:12:59,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:59,065 INFO L225 Difference]: With dead ends: 1451 [2024-11-11 21:12:59,065 INFO L226 Difference]: Without dead ends: 1065 [2024-11-11 21:12:59,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:59,067 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 72 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:59,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 383 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-11-11 21:12:59,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1063. [2024-11-11 21:12:59,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.6139359698681732) internal successors, (1714), 1062 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1714 transitions. [2024-11-11 21:12:59,115 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1714 transitions. Word has length 69 [2024-11-11 21:12:59,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:59,116 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1714 transitions. [2024-11-11 21:12:59,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:59,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1714 transitions. [2024-11-11 21:12:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 21:12:59,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:59,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:59,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:12:59,118 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:59,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:59,119 INFO L85 PathProgramCache]: Analyzing trace with hash 859687781, now seen corresponding path program 1 times [2024-11-11 21:12:59,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:59,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287501222] [2024-11-11 21:12:59,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:59,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:59,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:59,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287501222] [2024-11-11 21:12:59,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287501222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:59,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:59,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:59,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772062946] [2024-11-11 21:12:59,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:59,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:59,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:59,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:59,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:59,284 INFO L87 Difference]: Start difference. First operand 1063 states and 1714 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:59,514 INFO L93 Difference]: Finished difference Result 5968 states and 9778 transitions. [2024-11-11 21:12:59,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:12:59,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-11 21:12:59,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:59,539 INFO L225 Difference]: With dead ends: 5968 [2024-11-11 21:12:59,539 INFO L226 Difference]: Without dead ends: 4976 [2024-11-11 21:12:59,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:12:59,545 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 584 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:59,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1086 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4976 states. [2024-11-11 21:12:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4976 to 2017. [2024-11-11 21:12:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 2016 states have (on average 1.6091269841269842) internal successors, (3244), 2016 states have internal predecessors, (3244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 3244 transitions. [2024-11-11 21:12:59,656 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 3244 transitions. Word has length 69 [2024-11-11 21:12:59,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:59,657 INFO L471 AbstractCegarLoop]: Abstraction has 2017 states and 3244 transitions. [2024-11-11 21:12:59,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 3244 transitions. [2024-11-11 21:12:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 21:12:59,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:59,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:59,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:12:59,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:59,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:59,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1042315252, now seen corresponding path program 1 times [2024-11-11 21:12:59,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:59,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065709877] [2024-11-11 21:12:59,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:59,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:59,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065709877] [2024-11-11 21:12:59,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065709877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:59,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:59,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:59,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939375129] [2024-11-11 21:12:59,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:59,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:59,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:59,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:59,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:59,785 INFO L87 Difference]: Start difference. First operand 2017 states and 3244 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:59,917 INFO L93 Difference]: Finished difference Result 7655 states and 12375 transitions. [2024-11-11 21:12:59,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:59,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-11-11 21:12:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:59,937 INFO L225 Difference]: With dead ends: 7655 [2024-11-11 21:12:59,938 INFO L226 Difference]: Without dead ends: 5709 [2024-11-11 21:12:59,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:59,943 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 284 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:59,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 554 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5709 states. [2024-11-11 21:13:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5709 to 3844. [2024-11-11 21:13:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3844 states, 3843 states have (on average 1.599791829300026) internal successors, (6148), 3843 states have internal predecessors, (6148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 6148 transitions. [2024-11-11 21:13:00,089 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 6148 transitions. Word has length 70 [2024-11-11 21:13:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:00,090 INFO L471 AbstractCegarLoop]: Abstraction has 3844 states and 6148 transitions. [2024-11-11 21:13:00,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 6148 transitions. [2024-11-11 21:13:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-11 21:13:00,091 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:00,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:13:00,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:13:00,091 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:00,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:00,092 INFO L85 PathProgramCache]: Analyzing trace with hash 294137212, now seen corresponding path program 1 times [2024-11-11 21:13:00,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:00,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115865703] [2024-11-11 21:13:00,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:00,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:13:00,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:00,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115865703] [2024-11-11 21:13:00,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115865703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:13:00,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:13:00,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:13:00,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552888609] [2024-11-11 21:13:00,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:13:00,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:13:00,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:00,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:13:00,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:13:00,207 INFO L87 Difference]: Start difference. First operand 3844 states and 6148 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:00,396 INFO L93 Difference]: Finished difference Result 12439 states and 19987 transitions. [2024-11-11 21:13:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:13:00,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-11 21:13:00,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:00,427 INFO L225 Difference]: With dead ends: 12439 [2024-11-11 21:13:00,428 INFO L226 Difference]: Without dead ends: 8666 [2024-11-11 21:13:00,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:13:00,437 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 282 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:00,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 551 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:13:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8666 states. [2024-11-11 21:13:00,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8666 to 6220. [2024-11-11 21:13:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6220 states, 6219 states have (on average 1.5877150667309856) internal successors, (9874), 6219 states have internal predecessors, (9874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6220 states to 6220 states and 9874 transitions. [2024-11-11 21:13:00,670 INFO L78 Accepts]: Start accepts. Automaton has 6220 states and 9874 transitions. Word has length 71 [2024-11-11 21:13:00,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:00,671 INFO L471 AbstractCegarLoop]: Abstraction has 6220 states and 9874 transitions. [2024-11-11 21:13:00,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:00,671 INFO L276 IsEmpty]: Start isEmpty. Operand 6220 states and 9874 transitions. [2024-11-11 21:13:00,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 21:13:00,672 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:00,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:13:00,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:13:00,673 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:00,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:00,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1056505021, now seen corresponding path program 1 times [2024-11-11 21:13:00,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:00,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082366123] [2024-11-11 21:13:00,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:00,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:13:00,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:00,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082366123] [2024-11-11 21:13:00,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082366123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:13:00,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:13:00,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:13:00,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235414827] [2024-11-11 21:13:00,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:13:00,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:13:00,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:00,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:13:00,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:13:00,766 INFO L87 Difference]: Start difference. First operand 6220 states and 9874 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:01,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:01,089 INFO L93 Difference]: Finished difference Result 19827 states and 31587 transitions. [2024-11-11 21:13:01,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:13:01,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2024-11-11 21:13:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:01,147 INFO L225 Difference]: With dead ends: 19827 [2024-11-11 21:13:01,147 INFO L226 Difference]: Without dead ends: 13678 [2024-11-11 21:13:01,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:13:01,160 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 280 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:01,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 553 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:13:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13678 states. [2024-11-11 21:13:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13678 to 9896. [2024-11-11 21:13:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9896 states, 9895 states have (on average 1.5749368367862557) internal successors, (15584), 9895 states have internal predecessors, (15584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9896 states to 9896 states and 15584 transitions. [2024-11-11 21:13:01,608 INFO L78 Accepts]: Start accepts. Automaton has 9896 states and 15584 transitions. Word has length 72 [2024-11-11 21:13:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:01,609 INFO L471 AbstractCegarLoop]: Abstraction has 9896 states and 15584 transitions. [2024-11-11 21:13:01,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 9896 states and 15584 transitions. [2024-11-11 21:13:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 21:13:01,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:01,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:13:01,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:13:01,610 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:01,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:01,611 INFO L85 PathProgramCache]: Analyzing trace with hash 478401083, now seen corresponding path program 1 times [2024-11-11 21:13:01,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:01,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935108263] [2024-11-11 21:13:01,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:01,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:13:01,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:01,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935108263] [2024-11-11 21:13:01,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935108263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:13:01,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:13:01,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:13:01,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392116673] [2024-11-11 21:13:01,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:13:01,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:13:01,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:01,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:13:01,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:13:01,897 INFO L87 Difference]: Start difference. First operand 9896 states and 15584 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:02,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:02,125 INFO L93 Difference]: Finished difference Result 19723 states and 31076 transitions. [2024-11-11 21:13:02,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:13:02,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-11 21:13:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:02,152 INFO L225 Difference]: With dead ends: 19723 [2024-11-11 21:13:02,153 INFO L226 Difference]: Without dead ends: 9898 [2024-11-11 21:13:02,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:13:02,167 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 71 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:02,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 605 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:13:02,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9898 states. [2024-11-11 21:13:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9898 to 9896. [2024-11-11 21:13:02,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9896 states, 9895 states have (on average 1.55977766548762) internal successors, (15434), 9895 states have internal predecessors, (15434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9896 states to 9896 states and 15434 transitions. [2024-11-11 21:13:02,447 INFO L78 Accepts]: Start accepts. Automaton has 9896 states and 15434 transitions. Word has length 74 [2024-11-11 21:13:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:02,448 INFO L471 AbstractCegarLoop]: Abstraction has 9896 states and 15434 transitions. [2024-11-11 21:13:02,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 9896 states and 15434 transitions. [2024-11-11 21:13:02,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:13:02,449 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:02,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:13:02,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:13:02,449 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:02,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:02,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1246891745, now seen corresponding path program 1 times [2024-11-11 21:13:02,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:02,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001798781] [2024-11-11 21:13:02,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:02,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:13:02,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:02,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001798781] [2024-11-11 21:13:02,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001798781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:13:02,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:13:02,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:13:02,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730004657] [2024-11-11 21:13:02,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:13:02,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:13:02,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:02,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:13:02,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:13:02,679 INFO L87 Difference]: Start difference. First operand 9896 states and 15434 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:03,077 INFO L93 Difference]: Finished difference Result 28542 states and 44662 transitions. [2024-11-11 21:13:03,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:13:03,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-11-11 21:13:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:03,120 INFO L225 Difference]: With dead ends: 28542 [2024-11-11 21:13:03,120 INFO L226 Difference]: Without dead ends: 18717 [2024-11-11 21:13:03,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:13:03,135 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 205 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:03,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 465 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:13:03,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18717 states. [2024-11-11 21:13:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18717 to 18715. [2024-11-11 21:13:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18715 states, 18714 states have (on average 1.5446190018168215) internal successors, (28906), 18714 states have internal predecessors, (28906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18715 states to 18715 states and 28906 transitions. [2024-11-11 21:13:03,814 INFO L78 Accepts]: Start accepts. Automaton has 18715 states and 28906 transitions. Word has length 77 [2024-11-11 21:13:03,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:03,815 INFO L471 AbstractCegarLoop]: Abstraction has 18715 states and 28906 transitions. [2024-11-11 21:13:03,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:03,815 INFO L276 IsEmpty]: Start isEmpty. Operand 18715 states and 28906 transitions. [2024-11-11 21:13:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:13:03,816 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:03,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:13:03,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:13:03,816 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:03,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:03,817 INFO L85 PathProgramCache]: Analyzing trace with hash -427514140, now seen corresponding path program 1 times [2024-11-11 21:13:03,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:03,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159207232] [2024-11-11 21:13:03,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:03,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:13:04,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:04,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159207232] [2024-11-11 21:13:04,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159207232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:13:04,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:13:04,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:13:04,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937219377] [2024-11-11 21:13:04,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:13:04,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:13:04,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:04,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:13:04,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:13:04,207 INFO L87 Difference]: Start difference. First operand 18715 states and 28906 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:04,419 INFO L93 Difference]: Finished difference Result 19878 states and 30455 transitions. [2024-11-11 21:13:04,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:13:04,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-11 21:13:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:04,460 INFO L225 Difference]: With dead ends: 19878 [2024-11-11 21:13:04,461 INFO L226 Difference]: Without dead ends: 19876 [2024-11-11 21:13:04,472 INFO L434 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-11 21:13:04,473 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:04,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 674 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:13:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19876 states. [2024-11-11 21:13:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19876 to 19876. [2024-11-11 21:13:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19876 states, 19875 states have (on average 1.5123522012578616) internal successors, (30058), 19875 states have internal predecessors, (30058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19876 states to 19876 states and 30058 transitions. [2024-11-11 21:13:04,949 INFO L78 Accepts]: Start accepts. Automaton has 19876 states and 30058 transitions. Word has length 78 [2024-11-11 21:13:04,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:04,949 INFO L471 AbstractCegarLoop]: Abstraction has 19876 states and 30058 transitions. [2024-11-11 21:13:04,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:04,950 INFO L276 IsEmpty]: Start isEmpty. Operand 19876 states and 30058 transitions. [2024-11-11 21:13:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 21:13:04,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:04,952 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:13:04,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:13:04,953 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:04,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:04,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1908761919, now seen corresponding path program 1 times [2024-11-11 21:13:04,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:04,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523044527] [2024-11-11 21:13:04,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:04,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:13:05,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:05,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523044527] [2024-11-11 21:13:05,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523044527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:13:05,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:13:05,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:13:05,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239320320] [2024-11-11 21:13:05,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:13:05,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:13:05,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:05,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:13:05,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:13:05,135 INFO L87 Difference]: Start difference. First operand 19876 states and 30058 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:05,829 INFO L93 Difference]: Finished difference Result 59367 states and 89704 transitions. [2024-11-11 21:13:05,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:13:05,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-11-11 21:13:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:05,927 INFO L225 Difference]: With dead ends: 59367 [2024-11-11 21:13:05,927 INFO L226 Difference]: Without dead ends: 39558 [2024-11-11 21:13:05,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:13:05,949 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 111 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:05,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 411 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:13:05,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39558 states. [2024-11-11 21:13:06,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39558 to 39556. [2024-11-11 21:13:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39556 states, 39555 states have (on average 1.4979901403109595) internal successors, (59253), 39555 states have internal predecessors, (59253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39556 states to 39556 states and 59253 transitions. [2024-11-11 21:13:06,827 INFO L78 Accepts]: Start accepts. Automaton has 39556 states and 59253 transitions. Word has length 103 [2024-11-11 21:13:06,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:06,828 INFO L471 AbstractCegarLoop]: Abstraction has 39556 states and 59253 transitions. [2024-11-11 21:13:06,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 39556 states and 59253 transitions. [2024-11-11 21:13:06,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 21:13:06,832 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:06,832 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:13:06,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:13:06,833 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:06,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:06,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1611929700, now seen corresponding path program 1 times [2024-11-11 21:13:06,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:06,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46607519] [2024-11-11 21:13:06,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:06,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:13:07,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:07,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46607519] [2024-11-11 21:13:07,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46607519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:13:07,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:13:07,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:13:07,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476136494] [2024-11-11 21:13:07,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:13:07,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:13:07,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:07,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:13:07,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:13:07,068 INFO L87 Difference]: Start difference. First operand 39556 states and 59253 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:08,144 INFO L93 Difference]: Finished difference Result 118112 states and 176733 transitions. [2024-11-11 21:13:08,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:13:08,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 103 [2024-11-11 21:13:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:08,328 INFO L225 Difference]: With dead ends: 118112 [2024-11-11 21:13:08,328 INFO L226 Difference]: Without dead ends: 78657 [2024-11-11 21:13:08,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:13:08,376 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 96 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:08,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 386 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:13:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78657 states. [2024-11-11 21:13:09,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78657 to 78655. [2024-11-11 21:13:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78655 states, 78654 states have (on average 1.4853535738805401) internal successors, (116829), 78654 states have internal predecessors, (116829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:10,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78655 states to 78655 states and 116829 transitions. [2024-11-11 21:13:10,251 INFO L78 Accepts]: Start accepts. Automaton has 78655 states and 116829 transitions. Word has length 103 [2024-11-11 21:13:10,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:10,252 INFO L471 AbstractCegarLoop]: Abstraction has 78655 states and 116829 transitions. [2024-11-11 21:13:10,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 78655 states and 116829 transitions. [2024-11-11 21:13:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 21:13:10,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:10,266 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:13:10,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:13:10,267 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:10,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:10,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1885516983, now seen corresponding path program 1 times [2024-11-11 21:13:10,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:10,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656262676] [2024-11-11 21:13:10,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:10,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 21:13:10,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:10,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656262676] [2024-11-11 21:13:10,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656262676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:13:10,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:13:10,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:13:10,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93446588] [2024-11-11 21:13:10,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:13:10,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:13:10,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:10,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:13:10,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:13:10,376 INFO L87 Difference]: Start difference. First operand 78655 states and 116829 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-11 21:13:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:12,367 INFO L93 Difference]: Finished difference Result 234919 states and 348550 transitions. [2024-11-11 21:13:12,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:13:12,368 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 103 [2024-11-11 21:13:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:12,723 INFO L225 Difference]: With dead ends: 234919 [2024-11-11 21:13:12,723 INFO L226 Difference]: Without dead ends: 156441 [2024-11-11 21:13:12,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:13:12,818 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 110 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:12,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 401 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:13:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156441 states. [2024-11-11 21:13:15,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156441 to 156439. [2024-11-11 21:13:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156439 states, 156438 states have (on average 1.4726345261381506) internal successors, (230376), 156438 states have internal predecessors, (230376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156439 states to 156439 states and 230376 transitions. [2024-11-11 21:13:16,514 INFO L78 Accepts]: Start accepts. Automaton has 156439 states and 230376 transitions. Word has length 103 [2024-11-11 21:13:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:16,515 INFO L471 AbstractCegarLoop]: Abstraction has 156439 states and 230376 transitions. [2024-11-11 21:13:16,517 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-11 21:13:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 156439 states and 230376 transitions. [2024-11-11 21:13:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 21:13:16,531 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:16,531 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:13:16,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:13:16,532 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:16,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:16,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1709368713, now seen corresponding path program 1 times [2024-11-11 21:13:16,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:16,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730679608] [2024-11-11 21:13:16,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:16,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:13:16,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:16,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730679608] [2024-11-11 21:13:16,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730679608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:13:16,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:13:16,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:13:16,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651661216] [2024-11-11 21:13:16,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:13:16,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:13:16,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:13:16,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:13:16,634 INFO L87 Difference]: Start difference. First operand 156439 states and 230376 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:20,934 INFO L93 Difference]: Finished difference Result 467511 states and 687879 transitions. [2024-11-11 21:13:20,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:13:20,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-11-11 21:13:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:21,626 INFO L225 Difference]: With dead ends: 467511 [2024-11-11 21:13:21,626 INFO L226 Difference]: Without dead ends: 311481 [2024-11-11 21:13:21,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:13:21,755 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 130 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:21,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 417 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:13:21,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311481 states. [2024-11-11 21:13:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311481 to 311479. [2024-11-11 21:13:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311479 states, 311478 states have (on average 1.4579809810002633) internal successors, (454129), 311478 states have internal predecessors, (454129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311479 states to 311479 states and 454129 transitions. [2024-11-11 21:13:28,898 INFO L78 Accepts]: Start accepts. Automaton has 311479 states and 454129 transitions. Word has length 103 [2024-11-11 21:13:28,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:28,899 INFO L471 AbstractCegarLoop]: Abstraction has 311479 states and 454129 transitions. [2024-11-11 21:13:28,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 311479 states and 454129 transitions. [2024-11-11 21:13:28,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 21:13:28,920 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:28,920 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:13:28,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:13:28,920 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:28,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:28,921 INFO L85 PathProgramCache]: Analyzing trace with hash 811975435, now seen corresponding path program 1 times [2024-11-11 21:13:28,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:28,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261155828] [2024-11-11 21:13:28,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:28,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:13:29,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:29,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261155828] [2024-11-11 21:13:29,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261155828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:13:29,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:13:29,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:13:29,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930129171] [2024-11-11 21:13:29,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:13:29,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:13:29,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:29,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:13:29,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:13:29,002 INFO L87 Difference]: Start difference. First operand 311479 states and 454129 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:13:33,474 INFO L93 Difference]: Finished difference Result 467895 states and 680635 transitions. [2024-11-11 21:13:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:13:33,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-11-11 21:13:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:13:34,061 INFO L225 Difference]: With dead ends: 467895 [2024-11-11 21:13:34,061 INFO L226 Difference]: Without dead ends: 311833 [2024-11-11 21:13:34,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:13:34,141 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 101 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:13:34,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 448 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:13:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311833 states. [2024-11-11 21:13:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311833 to 311831. [2024-11-11 21:13:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311831 states, 311830 states have (on average 1.4452393932591476) internal successors, (450669), 311830 states have internal predecessors, (450669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311831 states to 311831 states and 450669 transitions. [2024-11-11 21:13:41,548 INFO L78 Accepts]: Start accepts. Automaton has 311831 states and 450669 transitions. Word has length 103 [2024-11-11 21:13:41,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:13:41,548 INFO L471 AbstractCegarLoop]: Abstraction has 311831 states and 450669 transitions. [2024-11-11 21:13:41,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:13:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 311831 states and 450669 transitions. [2024-11-11 21:13:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 21:13:41,570 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:13:41,570 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:13:41,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:13:41,570 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:13:41,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:13:41,571 INFO L85 PathProgramCache]: Analyzing trace with hash -467888243, now seen corresponding path program 1 times [2024-11-11 21:13:41,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:13:41,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548927205] [2024-11-11 21:13:41,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:13:41,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:13:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:13:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:13:41,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:13:41,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548927205] [2024-11-11 21:13:41,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548927205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:13:41,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:13:41,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:13:41,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075052424] [2024-11-11 21:13:41,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:13:41,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:13:41,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:13:41,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:13:41,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:13:41,658 INFO L87 Difference]: Start difference. First operand 311831 states and 450669 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)