./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.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 a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 22:39:20,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:39:20,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:39:20,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:39:20,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:39:20,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:39:20,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:39:20,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:39:20,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:39:20,092 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:39:20,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:39:20,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:39:20,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:39:20,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:39:20,093 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:39:20,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:39:20,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:39:20,094 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:39:20,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:39:20,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:39:20,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:39:20,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:39:20,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:39:20,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:39:20,096 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:39:20,097 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:39:20,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:39:20,097 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:39:20,097 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:39:20,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:39:20,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:39:20,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:39:20,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:39:20,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:39:20,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:39:20,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:39:20,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:39:20,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:39:20,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:39:20,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:39:20,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:39:20,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:39:20,100 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 -> a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f [2024-10-13 22:39:20,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:39:20,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:39:20,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:39:20,319 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:39:20,319 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:39:20,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2024-10-13 22:39:21,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:39:21,694 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:39:21,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2024-10-13 22:39:21,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6d89065/1bfebf94783f41bf9a6029915f290a5e/FLAGc2917fae0 [2024-10-13 22:39:21,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6d89065/1bfebf94783f41bf9a6029915f290a5e [2024-10-13 22:39:21,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:39:21,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:39:21,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:39:21,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:39:21,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:39:21,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:39:21" (1/1) ... [2024-10-13 22:39:21,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5adad640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:21, skipping insertion in model container [2024-10-13 22:39:21,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:39:21" (1/1) ... [2024-10-13 22:39:21,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:39:21,951 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2024-10-13 22:39:21,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:39:21,973 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:39:22,033 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2024-10-13 22:39:22,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:39:22,052 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:39:22,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:22 WrapperNode [2024-10-13 22:39:22,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:39:22,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:39:22,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:39:22,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:39:22,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:22" (1/1) ... [2024-10-13 22:39:22,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:22" (1/1) ... [2024-10-13 22:39:22,092 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 644 [2024-10-13 22:39:22,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:39:22,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:39:22,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:39:22,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:39:22,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:22" (1/1) ... [2024-10-13 22:39:22,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:22" (1/1) ... [2024-10-13 22:39:22,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:22" (1/1) ... [2024-10-13 22:39:22,130 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 22:39:22,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:22" (1/1) ... [2024-10-13 22:39:22,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:22" (1/1) ... [2024-10-13 22:39:22,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:22" (1/1) ... [2024-10-13 22:39:22,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:22" (1/1) ... [2024-10-13 22:39:22,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:22" (1/1) ... [2024-10-13 22:39:22,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:22" (1/1) ... [2024-10-13 22:39:22,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:39:22,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:39:22,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:39:22,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:39:22,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:22" (1/1) ... [2024-10-13 22:39:22,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:39:22,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:22,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 22:39:22,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 22:39:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:39:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:39:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:39:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:39:22,310 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:39:22,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:39:22,330 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 22:39:22,733 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume !false; [2024-10-13 22:39:22,734 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##102: assume false; [2024-10-13 22:39:22,783 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-13 22:39:22,784 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:39:22,824 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:39:22,825 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 22:39:22,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:22 BoogieIcfgContainer [2024-10-13 22:39:22,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:39:22,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:39:22,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:39:22,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:39:22,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:39:21" (1/3) ... [2024-10-13 22:39:22,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4737bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:39:22, skipping insertion in model container [2024-10-13 22:39:22,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:22" (2/3) ... [2024-10-13 22:39:22,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4737bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:39:22, skipping insertion in model container [2024-10-13 22:39:22,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:22" (3/3) ... [2024-10-13 22:39:22,832 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2024-10-13 22:39:22,843 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:39:22,843 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:39:22,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:39:22,898 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;@16e165ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:39:22,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:39:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 159 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 22:39:22,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:22,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:22,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:22,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1162804964, now seen corresponding path program 1 times [2024-10-13 22:39:22,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:22,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945641032] [2024-10-13 22:39:22,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:22,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:23,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:23,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945641032] [2024-10-13 22:39:23,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945641032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:23,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:23,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:39:23,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212744915] [2024-10-13 22:39:23,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:23,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:23,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:23,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:23,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:23,175 INFO L87 Difference]: Start difference. First operand has 160 states, 158 states have (on average 1.7658227848101267) internal successors, (279), 159 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:23,354 INFO L93 Difference]: Finished difference Result 328 states and 575 transitions. [2024-10-13 22:39:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:23,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-10-13 22:39:23,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:23,364 INFO L225 Difference]: With dead ends: 328 [2024-10-13 22:39:23,364 INFO L226 Difference]: Without dead ends: 168 [2024-10-13 22:39:23,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:23,370 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 32 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:23,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 431 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-13 22:39:23,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-13 22:39:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.5688622754491017) internal successors, (262), 167 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 262 transitions. [2024-10-13 22:39:23,403 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 262 transitions. Word has length 43 [2024-10-13 22:39:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:23,404 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 262 transitions. [2024-10-13 22:39:23,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 262 transitions. [2024-10-13 22:39:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 22:39:23,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:23,406 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:23,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:39:23,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:23,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:23,407 INFO L85 PathProgramCache]: Analyzing trace with hash -51465524, now seen corresponding path program 1 times [2024-10-13 22:39:23,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:23,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219858302] [2024-10-13 22:39:23,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:23,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:39:23,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:23,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219858302] [2024-10-13 22:39:23,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219858302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:23,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:23,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:23,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370815247] [2024-10-13 22:39:23,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:23,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:23,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:23,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:23,512 INFO L87 Difference]: Start difference. First operand 168 states and 262 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:23,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:23,659 INFO L93 Difference]: Finished difference Result 343 states and 540 transitions. [2024-10-13 22:39:23,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:23,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-13 22:39:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:23,661 INFO L225 Difference]: With dead ends: 343 [2024-10-13 22:39:23,661 INFO L226 Difference]: Without dead ends: 188 [2024-10-13 22:39:23,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:23,662 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:23,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 375 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-13 22:39:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-10-13 22:39:23,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.53475935828877) internal successors, (287), 187 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 287 transitions. [2024-10-13 22:39:23,679 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 287 transitions. Word has length 58 [2024-10-13 22:39:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:23,680 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 287 transitions. [2024-10-13 22:39:23,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 287 transitions. [2024-10-13 22:39:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-13 22:39:23,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:23,683 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 22:39:23,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 22:39:23,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:23,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:23,683 INFO L85 PathProgramCache]: Analyzing trace with hash -900899268, now seen corresponding path program 1 times [2024-10-13 22:39:23,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:23,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856785291] [2024-10-13 22:39:23,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:23,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 22:39:23,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:23,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856785291] [2024-10-13 22:39:23,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856785291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:23,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:23,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:23,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953471795] [2024-10-13 22:39:23,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:23,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:23,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:23,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:23,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:23,806 INFO L87 Difference]: Start difference. First operand 188 states and 287 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-10-13 22:39:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:23,945 INFO L93 Difference]: Finished difference Result 404 states and 630 transitions. [2024-10-13 22:39:23,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:23,945 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 78 [2024-10-13 22:39:23,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:23,949 INFO L225 Difference]: With dead ends: 404 [2024-10-13 22:39:23,950 INFO L226 Difference]: Without dead ends: 229 [2024-10-13 22:39:23,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:23,952 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 10 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:23,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 372 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-13 22:39:23,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-10-13 22:39:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.4605263157894737) internal successors, (333), 228 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:23,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 333 transitions. [2024-10-13 22:39:23,968 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 333 transitions. Word has length 78 [2024-10-13 22:39:23,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:23,968 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 333 transitions. [2024-10-13 22:39:23,968 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-10-13 22:39:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 333 transitions. [2024-10-13 22:39:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-13 22:39:23,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:23,970 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 22:39:23,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 22:39:23,971 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:23,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:23,972 INFO L85 PathProgramCache]: Analyzing trace with hash -477252546, now seen corresponding path program 1 times [2024-10-13 22:39:23,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:23,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924457670] [2024-10-13 22:39:23,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:23,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 22:39:24,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:24,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924457670] [2024-10-13 22:39:24,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924457670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:24,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:24,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:24,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607435444] [2024-10-13 22:39:24,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:24,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:24,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:24,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:24,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:24,043 INFO L87 Difference]: Start difference. First operand 229 states and 333 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-10-13 22:39:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:24,147 INFO L93 Difference]: Finished difference Result 467 states and 686 transitions. [2024-10-13 22:39:24,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:24,148 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 78 [2024-10-13 22:39:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:24,149 INFO L225 Difference]: With dead ends: 467 [2024-10-13 22:39:24,149 INFO L226 Difference]: Without dead ends: 251 [2024-10-13 22:39:24,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:24,151 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:24,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 391 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-13 22:39:24,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-10-13 22:39:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.44) internal successors, (360), 250 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 360 transitions. [2024-10-13 22:39:24,162 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 360 transitions. Word has length 78 [2024-10-13 22:39:24,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:24,163 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 360 transitions. [2024-10-13 22:39:24,163 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-10-13 22:39:24,163 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 360 transitions. [2024-10-13 22:39:24,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 22:39:24,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:24,165 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-10-13 22:39:24,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 22:39:24,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:24,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:24,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1974049696, now seen corresponding path program 1 times [2024-10-13 22:39:24,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:24,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327809463] [2024-10-13 22:39:24,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:24,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-13 22:39:24,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:24,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327809463] [2024-10-13 22:39:24,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327809463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:24,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:24,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:24,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539037672] [2024-10-13 22:39:24,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:24,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:24,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:24,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:24,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:24,228 INFO L87 Difference]: Start difference. First operand 251 states and 360 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:24,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:24,330 INFO L93 Difference]: Finished difference Result 513 states and 744 transitions. [2024-10-13 22:39:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:24,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-13 22:39:24,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:24,332 INFO L225 Difference]: With dead ends: 513 [2024-10-13 22:39:24,332 INFO L226 Difference]: Without dead ends: 275 [2024-10-13 22:39:24,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:24,333 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:24,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 390 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:24,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-13 22:39:24,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-10-13 22:39:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 1.4197080291970803) internal successors, (389), 274 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 389 transitions. [2024-10-13 22:39:24,340 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 389 transitions. Word has length 98 [2024-10-13 22:39:24,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:24,340 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 389 transitions. [2024-10-13 22:39:24,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:24,341 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 389 transitions. [2024-10-13 22:39:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 22:39:24,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:24,343 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:24,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 22:39:24,343 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:24,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:24,344 INFO L85 PathProgramCache]: Analyzing trace with hash 340894480, now seen corresponding path program 1 times [2024-10-13 22:39:24,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:24,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400023848] [2024-10-13 22:39:24,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:24,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-13 22:39:24,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:24,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400023848] [2024-10-13 22:39:24,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400023848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:24,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:24,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:24,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216357788] [2024-10-13 22:39:24,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:24,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:24,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:24,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:24,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:24,441 INFO L87 Difference]: Start difference. First operand 275 states and 389 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:24,478 INFO L93 Difference]: Finished difference Result 793 states and 1119 transitions. [2024-10-13 22:39:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:24,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-10-13 22:39:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:24,481 INFO L225 Difference]: With dead ends: 793 [2024-10-13 22:39:24,481 INFO L226 Difference]: Without dead ends: 531 [2024-10-13 22:39:24,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:24,482 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 168 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:24,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 560 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-10-13 22:39:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2024-10-13 22:39:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.4056603773584906) internal successors, (745), 530 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 745 transitions. [2024-10-13 22:39:24,495 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 745 transitions. Word has length 117 [2024-10-13 22:39:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:24,495 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 745 transitions. [2024-10-13 22:39:24,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 745 transitions. [2024-10-13 22:39:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 22:39:24,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:24,497 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:24,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 22:39:24,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:24,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:24,498 INFO L85 PathProgramCache]: Analyzing trace with hash 589040974, now seen corresponding path program 1 times [2024-10-13 22:39:24,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:24,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940364095] [2024-10-13 22:39:24,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:24,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 22:39:24,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:24,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940364095] [2024-10-13 22:39:24,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940364095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:24,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:24,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:24,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261579294] [2024-10-13 22:39:24,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:24,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:24,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:24,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:24,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:24,556 INFO L87 Difference]: Start difference. First operand 531 states and 745 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:24,591 INFO L93 Difference]: Finished difference Result 1307 states and 1834 transitions. [2024-10-13 22:39:24,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:24,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 117 [2024-10-13 22:39:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:24,595 INFO L225 Difference]: With dead ends: 1307 [2024-10-13 22:39:24,595 INFO L226 Difference]: Without dead ends: 789 [2024-10-13 22:39:24,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:24,596 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 170 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:24,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 580 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-10-13 22:39:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2024-10-13 22:39:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.401015228426396) internal successors, (1104), 788 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1104 transitions. [2024-10-13 22:39:24,610 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1104 transitions. Word has length 117 [2024-10-13 22:39:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:24,610 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1104 transitions. [2024-10-13 22:39:24,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1104 transitions. [2024-10-13 22:39:24,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 22:39:24,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:24,612 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:24,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 22:39:24,613 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:24,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:24,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2139168372, now seen corresponding path program 1 times [2024-10-13 22:39:24,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:24,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965415164] [2024-10-13 22:39:24,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:24,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-13 22:39:24,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:24,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965415164] [2024-10-13 22:39:24,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965415164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:24,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:24,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:24,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035222399] [2024-10-13 22:39:24,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:24,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:24,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:24,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:24,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:24,655 INFO L87 Difference]: Start difference. First operand 789 states and 1104 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:24,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:24,681 INFO L93 Difference]: Finished difference Result 1588 states and 2216 transitions. [2024-10-13 22:39:24,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:24,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 117 [2024-10-13 22:39:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:24,684 INFO L225 Difference]: With dead ends: 1588 [2024-10-13 22:39:24,684 INFO L226 Difference]: Without dead ends: 812 [2024-10-13 22:39:24,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:24,686 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 10 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:24,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 465 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:24,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-10-13 22:39:24,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2024-10-13 22:39:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.3958076448828607) internal successors, (1132), 811 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1132 transitions. [2024-10-13 22:39:24,702 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1132 transitions. Word has length 117 [2024-10-13 22:39:24,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:24,703 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1132 transitions. [2024-10-13 22:39:24,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1132 transitions. [2024-10-13 22:39:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 22:39:24,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:24,705 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:24,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 22:39:24,705 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:24,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash -241671606, now seen corresponding path program 1 times [2024-10-13 22:39:24,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:24,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154640000] [2024-10-13 22:39:24,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:24,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-13 22:39:24,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:24,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154640000] [2024-10-13 22:39:24,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154640000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:24,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:24,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:39:24,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593123300] [2024-10-13 22:39:24,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:24,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:24,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:24,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:24,746 INFO L87 Difference]: Start difference. First operand 812 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 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-10-13 22:39:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:24,774 INFO L93 Difference]: Finished difference Result 1623 states and 2256 transitions. [2024-10-13 22:39:24,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:24,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 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 117 [2024-10-13 22:39:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:24,777 INFO L225 Difference]: With dead ends: 1623 [2024-10-13 22:39:24,777 INFO L226 Difference]: Without dead ends: 824 [2024-10-13 22:39:24,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:24,780 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 15 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:24,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 437 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:24,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-10-13 22:39:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2024-10-13 22:39:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 1.3900364520048603) internal successors, (1144), 823 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1144 transitions. [2024-10-13 22:39:24,793 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1144 transitions. Word has length 117 [2024-10-13 22:39:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:24,793 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1144 transitions. [2024-10-13 22:39:24,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 2 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-10-13 22:39:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1144 transitions. [2024-10-13 22:39:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 22:39:24,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:24,796 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 22:39:24,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 22:39:24,796 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:24,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:24,797 INFO L85 PathProgramCache]: Analyzing trace with hash 692580231, now seen corresponding path program 1 times [2024-10-13 22:39:24,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:24,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343624222] [2024-10-13 22:39:24,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:24,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-13 22:39:24,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:24,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343624222] [2024-10-13 22:39:24,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343624222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:24,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:24,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:24,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757924078] [2024-10-13 22:39:24,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:24,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:24,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:24,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:24,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:24,866 INFO L87 Difference]: Start difference. First operand 824 states and 1144 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:24,997 INFO L93 Difference]: Finished difference Result 1731 states and 2448 transitions. [2024-10-13 22:39:24,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:24,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 154 [2024-10-13 22:39:24,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:25,001 INFO L225 Difference]: With dead ends: 1731 [2024-10-13 22:39:25,002 INFO L226 Difference]: Without dead ends: 932 [2024-10-13 22:39:25,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:25,003 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 26 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:25,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 381 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-10-13 22:39:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 904. [2024-10-13 22:39:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 1.3732004429678848) internal successors, (1240), 903 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1240 transitions. [2024-10-13 22:39:25,018 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1240 transitions. Word has length 154 [2024-10-13 22:39:25,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:25,018 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1240 transitions. [2024-10-13 22:39:25,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1240 transitions. [2024-10-13 22:39:25,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 22:39:25,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:25,020 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 22:39:25,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 22:39:25,021 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:25,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1951696596, now seen corresponding path program 1 times [2024-10-13 22:39:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:25,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540211903] [2024-10-13 22:39:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-13 22:39:25,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:25,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540211903] [2024-10-13 22:39:25,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540211903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:25,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:25,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:25,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080510768] [2024-10-13 22:39:25,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:25,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:25,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:25,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:25,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:25,072 INFO L87 Difference]: Start difference. First operand 904 states and 1240 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:25,187 INFO L93 Difference]: Finished difference Result 1933 states and 2720 transitions. [2024-10-13 22:39:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:25,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2024-10-13 22:39:25,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:25,191 INFO L225 Difference]: With dead ends: 1933 [2024-10-13 22:39:25,191 INFO L226 Difference]: Without dead ends: 1051 [2024-10-13 22:39:25,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:25,193 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 78 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:25,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 291 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:25,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-13 22:39:25,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2024-10-13 22:39:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.418095238095238) internal successors, (1489), 1050 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1489 transitions. [2024-10-13 22:39:25,209 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1489 transitions. Word has length 165 [2024-10-13 22:39:25,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:25,209 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1489 transitions. [2024-10-13 22:39:25,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1489 transitions. [2024-10-13 22:39:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-13 22:39:25,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:25,211 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-10-13 22:39:25,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 22:39:25,211 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:25,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash 442861685, now seen corresponding path program 1 times [2024-10-13 22:39:25,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:25,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004868426] [2024-10-13 22:39:25,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:25,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:25,262 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-13 22:39:25,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:25,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004868426] [2024-10-13 22:39:25,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004868426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:25,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:25,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:25,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632101275] [2024-10-13 22:39:25,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:25,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:25,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:25,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:25,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:25,264 INFO L87 Difference]: Start difference. First operand 1051 states and 1489 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:25,395 INFO L93 Difference]: Finished difference Result 2167 states and 3107 transitions. [2024-10-13 22:39:25,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:25,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2024-10-13 22:39:25,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:25,400 INFO L225 Difference]: With dead ends: 2167 [2024-10-13 22:39:25,400 INFO L226 Difference]: Without dead ends: 1141 [2024-10-13 22:39:25,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:25,402 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 10 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:25,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 388 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:25,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2024-10-13 22:39:25,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1141. [2024-10-13 22:39:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1140 states have (on average 1.3982456140350876) internal successors, (1594), 1140 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1594 transitions. [2024-10-13 22:39:25,422 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1594 transitions. Word has length 196 [2024-10-13 22:39:25,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:25,423 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1594 transitions. [2024-10-13 22:39:25,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1594 transitions. [2024-10-13 22:39:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-13 22:39:25,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:25,426 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-10-13 22:39:25,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 22:39:25,426 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:25,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:25,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1409517476, now seen corresponding path program 1 times [2024-10-13 22:39:25,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:25,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191913446] [2024-10-13 22:39:25,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:25,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-10-13 22:39:25,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:25,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191913446] [2024-10-13 22:39:25,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191913446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:25,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:25,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:25,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945413583] [2024-10-13 22:39:25,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:25,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:25,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:25,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:25,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:25,516 INFO L87 Difference]: Start difference. First operand 1141 states and 1594 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:25,639 INFO L93 Difference]: Finished difference Result 2380 states and 3380 transitions. [2024-10-13 22:39:25,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:25,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2024-10-13 22:39:25,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:25,643 INFO L225 Difference]: With dead ends: 2380 [2024-10-13 22:39:25,643 INFO L226 Difference]: Without dead ends: 1139 [2024-10-13 22:39:25,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:25,645 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:25,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 391 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:25,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-13 22:39:25,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2024-10-13 22:39:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.3919156414762741) internal successors, (1584), 1138 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1584 transitions. [2024-10-13 22:39:25,660 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1584 transitions. Word has length 223 [2024-10-13 22:39:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:25,660 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1584 transitions. [2024-10-13 22:39:25,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1584 transitions. [2024-10-13 22:39:25,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-13 22:39:25,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:25,663 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-10-13 22:39:25,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 22:39:25,663 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:25,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:25,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1957206764, now seen corresponding path program 1 times [2024-10-13 22:39:25,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:25,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819735936] [2024-10-13 22:39:25,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:25,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-10-13 22:39:25,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:25,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819735936] [2024-10-13 22:39:25,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819735936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:25,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:25,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:25,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899096639] [2024-10-13 22:39:25,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:25,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:25,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:25,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:25,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:25,726 INFO L87 Difference]: Start difference. First operand 1139 states and 1584 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:25,757 INFO L93 Difference]: Finished difference Result 3254 states and 4553 transitions. [2024-10-13 22:39:25,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:25,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262 [2024-10-13 22:39:25,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:25,762 INFO L225 Difference]: With dead ends: 3254 [2024-10-13 22:39:25,762 INFO L226 Difference]: Without dead ends: 1449 [2024-10-13 22:39:25,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:25,764 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 156 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:25,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 634 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:39:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2024-10-13 22:39:25,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1447. [2024-10-13 22:39:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1446 states have (on average 1.3955739972337482) internal successors, (2018), 1446 states have internal predecessors, (2018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2018 transitions. [2024-10-13 22:39:25,785 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2018 transitions. Word has length 262 [2024-10-13 22:39:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:25,785 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 2018 transitions. [2024-10-13 22:39:25,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2018 transitions. [2024-10-13 22:39:25,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-10-13 22:39:25,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:25,788 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-10-13 22:39:25,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 22:39:25,788 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:25,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:25,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1169172624, now seen corresponding path program 1 times [2024-10-13 22:39:25,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:25,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036431962] [2024-10-13 22:39:25,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:25,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2024-10-13 22:39:25,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:25,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036431962] [2024-10-13 22:39:25,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036431962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:25,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:25,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:25,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178967669] [2024-10-13 22:39:25,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:25,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:25,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:25,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:25,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:25,856 INFO L87 Difference]: Start difference. First operand 1447 states and 2018 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:25,961 INFO L93 Difference]: Finished difference Result 2973 states and 4183 transitions. [2024-10-13 22:39:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:25,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 308 [2024-10-13 22:39:25,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:25,966 INFO L225 Difference]: With dead ends: 2973 [2024-10-13 22:39:25,966 INFO L226 Difference]: Without dead ends: 1551 [2024-10-13 22:39:25,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:25,968 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:25,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 387 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:25,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2024-10-13 22:39:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1551. [2024-10-13 22:39:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1550 states have (on average 1.3819354838709677) internal successors, (2142), 1550 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2142 transitions. [2024-10-13 22:39:25,989 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2142 transitions. Word has length 308 [2024-10-13 22:39:25,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:25,990 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2142 transitions. [2024-10-13 22:39:25,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2142 transitions. [2024-10-13 22:39:25,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-10-13 22:39:25,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:25,993 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-10-13 22:39:25,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 22:39:25,993 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:25,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash 949109441, now seen corresponding path program 1 times [2024-10-13 22:39:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:25,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140776287] [2024-10-13 22:39:25,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:25,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 607 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2024-10-13 22:39:26,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:26,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140776287] [2024-10-13 22:39:26,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140776287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:26,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:26,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:26,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344718310] [2024-10-13 22:39:26,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:26,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:26,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:26,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:26,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:26,062 INFO L87 Difference]: Start difference. First operand 1551 states and 2142 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:26,179 INFO L93 Difference]: Finished difference Result 3189 states and 4447 transitions. [2024-10-13 22:39:26,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:26,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 330 [2024-10-13 22:39:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:26,184 INFO L225 Difference]: With dead ends: 3189 [2024-10-13 22:39:26,184 INFO L226 Difference]: Without dead ends: 1663 [2024-10-13 22:39:26,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:26,186 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:26,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 387 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-10-13 22:39:26,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2024-10-13 22:39:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1662 states have (on average 1.3682310469314078) internal successors, (2274), 1662 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2274 transitions. [2024-10-13 22:39:26,209 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2274 transitions. Word has length 330 [2024-10-13 22:39:26,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:26,210 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2274 transitions. [2024-10-13 22:39:26,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:26,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2274 transitions. [2024-10-13 22:39:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-10-13 22:39:26,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:26,213 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-10-13 22:39:26,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 22:39:26,214 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:26,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:26,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1022881964, now seen corresponding path program 1 times [2024-10-13 22:39:26,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:26,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672299393] [2024-10-13 22:39:26,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:26,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 860 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-10-13 22:39:26,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:26,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672299393] [2024-10-13 22:39:26,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672299393] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:26,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179126707] [2024-10-13 22:39:26,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:26,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:26,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:26,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:26,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 22:39:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:26,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 22:39:26,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:26,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 860 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-10-13 22:39:26,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 860 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-10-13 22:39:26,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179126707] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:26,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:26,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-13 22:39:26,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272253571] [2024-10-13 22:39:26,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:26,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 22:39:26,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:26,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 22:39:26,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:39:26,675 INFO L87 Difference]: Start difference. First operand 1663 states and 2274 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:27,027 INFO L93 Difference]: Finished difference Result 4040 states and 5599 transitions. [2024-10-13 22:39:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 22:39:27,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 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 362 [2024-10-13 22:39:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:27,034 INFO L225 Difference]: With dead ends: 4040 [2024-10-13 22:39:27,034 INFO L226 Difference]: Without dead ends: 2283 [2024-10-13 22:39:27,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 726 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-13 22:39:27,036 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 523 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:27,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1006 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:39:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2024-10-13 22:39:27,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 1675. [2024-10-13 22:39:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1675 states, 1674 states have (on average 1.3536439665471924) internal successors, (2266), 1674 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 2266 transitions. [2024-10-13 22:39:27,063 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 2266 transitions. Word has length 362 [2024-10-13 22:39:27,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:27,063 INFO L471 AbstractCegarLoop]: Abstraction has 1675 states and 2266 transitions. [2024-10-13 22:39:27,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2266 transitions. [2024-10-13 22:39:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-10-13 22:39:27,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:27,080 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:27,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 22:39:27,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 22:39:27,281 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:27,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:27,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1312534653, now seen corresponding path program 1 times [2024-10-13 22:39:27,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:27,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683093518] [2024-10-13 22:39:27,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:27,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:27,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 1260 proven. 0 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2024-10-13 22:39:27,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:27,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683093518] [2024-10-13 22:39:27,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683093518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:27,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:27,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:27,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796799327] [2024-10-13 22:39:27,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:27,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:27,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:27,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:27,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:27,371 INFO L87 Difference]: Start difference. First operand 1675 states and 2266 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:27,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:27,485 INFO L93 Difference]: Finished difference Result 3490 states and 4794 transitions. [2024-10-13 22:39:27,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:27,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 459 [2024-10-13 22:39:27,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:27,490 INFO L225 Difference]: With dead ends: 3490 [2024-10-13 22:39:27,490 INFO L226 Difference]: Without dead ends: 1840 [2024-10-13 22:39:27,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:27,492 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:27,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 381 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2024-10-13 22:39:27,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2024-10-13 22:39:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3355084284937466) internal successors, (2456), 1839 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2456 transitions. [2024-10-13 22:39:27,518 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2456 transitions. Word has length 459 [2024-10-13 22:39:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:27,518 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2456 transitions. [2024-10-13 22:39:27,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2456 transitions. [2024-10-13 22:39:27,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2024-10-13 22:39:27,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:27,524 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:27,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 22:39:27,525 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:27,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:27,525 INFO L85 PathProgramCache]: Analyzing trace with hash 460784419, now seen corresponding path program 1 times [2024-10-13 22:39:27,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:27,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509036676] [2024-10-13 22:39:27,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:27,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2967 backedges. 1680 proven. 0 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2024-10-13 22:39:27,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:27,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509036676] [2024-10-13 22:39:27,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509036676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:39:27,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:39:27,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:39:27,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434779106] [2024-10-13 22:39:27,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:39:27,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:39:27,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:27,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:39:27,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:27,611 INFO L87 Difference]: Start difference. First operand 1840 states and 2456 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:27,751 INFO L93 Difference]: Finished difference Result 3830 states and 5194 transitions. [2024-10-13 22:39:27,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:39:27,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 519 [2024-10-13 22:39:27,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:27,756 INFO L225 Difference]: With dead ends: 3830 [2024-10-13 22:39:27,757 INFO L226 Difference]: Without dead ends: 2015 [2024-10-13 22:39:27,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:39:27,759 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 9 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:27,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 381 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:39:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-10-13 22:39:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 2015. [2024-10-13 22:39:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 2014 states have (on average 1.3187686196623634) internal successors, (2656), 2014 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2656 transitions. [2024-10-13 22:39:27,794 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2656 transitions. Word has length 519 [2024-10-13 22:39:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:27,795 INFO L471 AbstractCegarLoop]: Abstraction has 2015 states and 2656 transitions. [2024-10-13 22:39:27,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:27,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2656 transitions. [2024-10-13 22:39:27,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2024-10-13 22:39:27,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:39:27,804 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:27,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 22:39:27,804 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:39:27,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:39:27,805 INFO L85 PathProgramCache]: Analyzing trace with hash 855549795, now seen corresponding path program 1 times [2024-10-13 22:39:27,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:39:27,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583022237] [2024-10-13 22:39:27,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:27,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:39:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3839 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2024-10-13 22:39:27,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:39:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583022237] [2024-10-13 22:39:27,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583022237] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:39:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333634124] [2024-10-13 22:39:27,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:39:27,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:39:27,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:39:27,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:39:27,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 22:39:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:39:28,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 22:39:28,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:39:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3839 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2024-10-13 22:39:28,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:39:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3839 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2024-10-13 22:39:28,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333634124] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:39:28,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:39:28,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-13 22:39:28,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520734492] [2024-10-13 22:39:28,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:39:28,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 22:39:28,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:39:28,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 22:39:28,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 22:39:28,304 INFO L87 Difference]: Start difference. First operand 2015 states and 2656 transitions. Second operand has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:39:28,669 INFO L93 Difference]: Finished difference Result 2879 states and 3810 transitions. [2024-10-13 22:39:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 22:39:28,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 583 [2024-10-13 22:39:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:39:28,670 INFO L225 Difference]: With dead ends: 2879 [2024-10-13 22:39:28,670 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 22:39:28,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1174 GetRequests, 1165 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-13 22:39:28,673 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 191 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:39:28,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1431 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:39:28,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 22:39:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 22:39:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 22:39:28,674 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 583 [2024-10-13 22:39:28,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:39:28,674 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 22:39:28,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:39:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 22:39:28,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 22:39:28,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 22:39:28,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 22:39:28,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-10-13 22:39:28,883 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:39:28,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 22:39:29,202 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 22:39:29,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:39:29 BoogieIcfgContainer [2024-10-13 22:39:29,214 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 22:39:29,215 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 22:39:29,215 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 22:39:29,215 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 22:39:29,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:22" (3/4) ... [2024-10-13 22:39:29,216 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 22:39:29,226 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-13 22:39:29,226 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 22:39:29,227 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 22:39:29,227 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 22:39:29,333 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 22:39:29,333 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 22:39:29,333 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 22:39:29,334 INFO L158 Benchmark]: Toolchain (without parser) took 7606.94ms. Allocated memory was 165.7MB in the beginning and 308.3MB in the end (delta: 142.6MB). Free memory was 95.4MB in the beginning and 95.2MB in the end (delta: 209.1kB). Peak memory consumption was 142.4MB. Max. memory is 16.1GB. [2024-10-13 22:39:29,334 INFO L158 Benchmark]: CDTParser took 0.07ms. Allocated memory is still 165.7MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:39:29,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.05ms. Allocated memory is still 165.7MB. Free memory was 95.1MB in the beginning and 129.7MB in the end (delta: -34.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-10-13 22:39:29,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.96ms. Allocated memory is still 165.7MB. Free memory was 129.7MB in the beginning and 126.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 22:39:29,335 INFO L158 Benchmark]: Boogie Preprocessor took 51.04ms. Allocated memory is still 165.7MB. Free memory was 126.7MB in the beginning and 122.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 22:39:29,336 INFO L158 Benchmark]: RCFGBuilder took 677.57ms. Allocated memory was 165.7MB in the beginning and 211.8MB in the end (delta: 46.1MB). Free memory was 122.9MB in the beginning and 170.6MB in the end (delta: -47.6MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2024-10-13 22:39:29,338 INFO L158 Benchmark]: TraceAbstraction took 6387.65ms. Allocated memory was 211.8MB in the beginning and 308.3MB in the end (delta: 96.5MB). Free memory was 169.4MB in the beginning and 105.7MB in the end (delta: 63.7MB). Peak memory consumption was 160.0MB. Max. memory is 16.1GB. [2024-10-13 22:39:29,338 INFO L158 Benchmark]: Witness Printer took 118.88ms. Allocated memory is still 308.3MB. Free memory was 105.7MB in the beginning and 95.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 22:39:29,339 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.07ms. Allocated memory is still 165.7MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.05ms. Allocated memory is still 165.7MB. Free memory was 95.1MB in the beginning and 129.7MB in the end (delta: -34.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.96ms. Allocated memory is still 165.7MB. Free memory was 129.7MB in the beginning and 126.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.04ms. Allocated memory is still 165.7MB. Free memory was 126.7MB in the beginning and 122.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 677.57ms. Allocated memory was 165.7MB in the beginning and 211.8MB in the end (delta: 46.1MB). Free memory was 122.9MB in the beginning and 170.6MB in the end (delta: -47.6MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6387.65ms. Allocated memory was 211.8MB in the beginning and 308.3MB in the end (delta: 96.5MB). Free memory was 169.4MB in the beginning and 105.7MB in the end (delta: 63.7MB). Peak memory consumption was 160.0MB. Max. memory is 16.1GB. * Witness Printer took 118.88ms. Allocated memory is still 308.3MB. Free memory was 105.7MB in the beginning and 95.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 681]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 160 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 20, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1461 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1461 mSDsluCounter, 10059 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4828 mSDsCounter, 388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2787 IncrementalHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 388 mSolverCounterUnsat, 5231 mSDtfsCounter, 2787 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1960 GetRequests, 1925 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2015occurred in iteration=19, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 638 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 5329 NumberOfCodeBlocks, 5329 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6250 ConstructedInterpolants, 0 QuantifiedInterpolants, 8217 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1459 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 24854/25004 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((8464 == s__state) && (blastFlag == 0)) || ((2 == blastFlag) && (8560 == s__state))) || ((2 == blastFlag) && (s__state == 8512))) || ((2 == blastFlag) && (0 != s__hit))) || ((2 == blastFlag) && (8544 == s__state))) || (((s__state == 8656) && (2 == blastFlag)) && (s__s3__tmp__next_state___0 <= 8576))) || (((3 == blastFlag) && (s__state == 8672)) && (s__s3__tmp__next_state___0 <= 8576))) || (((3 == blastFlag) && (3 == s__s3__tmp__next_state___0)) && (8448 == s__state))) || ((3 == blastFlag) && (0 != s__hit))) || (s__state == 3)) || (((2 == blastFlag) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8655))) || ((8496 == s__state) && (blastFlag == 1))) || ((s__state == 8528) && (2 == blastFlag))) RESULT: Ultimate proved your program to be correct! [2024-10-13 22:39:29,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE