./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label33.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 aaccf385f935203878b819a92144fc9de308865fc678d0507ba69ad2b46a0a7a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:29:04,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:29:04,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:29:04,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:29:04,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:29:04,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:29:04,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:29:04,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:29:04,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:29:04,140 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:29:04,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:29:04,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:29:04,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:29:04,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:29:04,144 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:29:04,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:29:04,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:29:04,145 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:29:04,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:29:04,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:29:04,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:29:04,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:29:04,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:29:04,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:29:04,150 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:29:04,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:29:04,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:29:04,151 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:29:04,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:29:04,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:29:04,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:29:04,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:29:04,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:29:04,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:29:04,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:29:04,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:29:04,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:29:04,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:29:04,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:29:04,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:29:04,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:29:04,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:29:04,155 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-clean/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-clean/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 -> aaccf385f935203878b819a92144fc9de308865fc678d0507ba69ad2b46a0a7a [2024-10-10 23:29:04,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:29:04,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:29:04,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:29:04,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:29:04,464 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:29:04,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label33.c [2024-10-10 23:29:06,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:29:06,493 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:29:06,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label33.c [2024-10-10 23:29:06,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2efeb945e/e59c92010a844c65b9a131f3b65a4e3a/FLAGe82bc6c27 [2024-10-10 23:29:06,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2efeb945e/e59c92010a844c65b9a131f3b65a4e3a [2024-10-10 23:29:06,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:29:06,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:29:06,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:29:06,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:29:06,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:29:06,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:29:06" (1/1) ... [2024-10-10 23:29:06,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e289be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:06, skipping insertion in model container [2024-10-10 23:29:06,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:29:06" (1/1) ... [2024-10-10 23:29:06,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:29:07,091 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/eca-rers2012/Problem13_label33.c[5177,5190] [2024-10-10 23:29:07,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:29:07,977 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:29:07,997 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/eca-rers2012/Problem13_label33.c[5177,5190] [2024-10-10 23:29:08,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:29:08,513 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:29:08,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:08 WrapperNode [2024-10-10 23:29:08,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:29:08,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:29:08,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:29:08,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:29:08,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:08" (1/1) ... [2024-10-10 23:29:08,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:08" (1/1) ... [2024-10-10 23:29:09,070 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-10 23:29:09,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:29:09,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:29:09,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:29:09,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:29:09,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:08" (1/1) ... [2024-10-10 23:29:09,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:08" (1/1) ... [2024-10-10 23:29:09,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:08" (1/1) ... [2024-10-10 23:29:09,507 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-10 23:29:09,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:08" (1/1) ... [2024-10-10 23:29:09,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:08" (1/1) ... [2024-10-10 23:29:09,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:08" (1/1) ... [2024-10-10 23:29:09,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:08" (1/1) ... [2024-10-10 23:29:09,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:08" (1/1) ... [2024-10-10 23:29:09,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:08" (1/1) ... [2024-10-10 23:29:09,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:29:09,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:29:09,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:29:09,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:29:09,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:08" (1/1) ... [2024-10-10 23:29:09,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:29:09,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:29:09,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:29:09,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:29:10,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:29:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:29:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:29:10,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:29:10,089 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:29:10,091 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:29:16,397 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-10 23:29:16,397 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:29:16,476 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:29:16,477 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:29:16,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:29:16 BoogieIcfgContainer [2024-10-10 23:29:16,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:29:16,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:29:16,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:29:16,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:29:16,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:29:06" (1/3) ... [2024-10-10 23:29:16,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8e3b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:29:16, skipping insertion in model container [2024-10-10 23:29:16,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:29:08" (2/3) ... [2024-10-10 23:29:16,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8e3b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:29:16, skipping insertion in model container [2024-10-10 23:29:16,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:29:16" (3/3) ... [2024-10-10 23:29:16,486 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label33.c [2024-10-10 23:29:16,501 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:29:16,502 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:29:16,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:29:16,599 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;@12c69fac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:29:16,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:29:16,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 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-10 23:29:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-10 23:29:16,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:16,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:16,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:16,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:16,619 INFO L85 PathProgramCache]: Analyzing trace with hash -880756798, now seen corresponding path program 1 times [2024-10-10 23:29:16,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:16,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161777402] [2024-10-10 23:29:16,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:16,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:16,813 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-10 23:29:16,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:16,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161777402] [2024-10-10 23:29:16,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161777402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:16,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:16,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:16,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666383516] [2024-10-10 23:29:16,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:16,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:29:16,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:16,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:29:16,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:29:16,849 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:16,963 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-10 23:29:16,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:29:16,965 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-10 23:29:16,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:16,983 INFO L225 Difference]: With dead ends: 2071 [2024-10-10 23:29:16,983 INFO L226 Difference]: Without dead ends: 1034 [2024-10-10 23:29:16,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:29:16,996 INFO L432 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:16,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:29:17,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-10 23:29:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-10 23:29:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 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-10 23:29:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-10 23:29:17,136 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 34 [2024-10-10 23:29:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:17,137 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-10 23:29:17,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-10 23:29:17,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-10 23:29:17,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:17,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:17,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:29:17,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:17,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:17,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1226981416, now seen corresponding path program 1 times [2024-10-10 23:29:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:17,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211605615] [2024-10-10 23:29:17,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:17,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:17,329 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-10 23:29:17,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:17,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211605615] [2024-10-10 23:29:17,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211605615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:17,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:17,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:17,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227801603] [2024-10-10 23:29:17,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:17,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:17,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:17,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:17,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:17,336 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:21,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:21,245 INFO L93 Difference]: Finished difference Result 2931 states and 5350 transitions. [2024-10-10 23:29:21,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:21,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-10 23:29:21,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:21,254 INFO L225 Difference]: With dead ends: 2931 [2024-10-10 23:29:21,254 INFO L226 Difference]: Without dead ends: 1898 [2024-10-10 23:29:21,256 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-10 23:29:21,257 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 980 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 2875 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 3435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 2875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:21,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 594 Invalid, 3435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 2875 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-10 23:29:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2024-10-10 23:29:21,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1893. [2024-10-10 23:29:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 1.73784355179704) internal successors, (3288), 1892 states have internal predecessors, (3288), 0 states have call successors, (0), 0 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-10 23:29:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 3288 transitions. [2024-10-10 23:29:21,295 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 3288 transitions. Word has length 34 [2024-10-10 23:29:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:21,296 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 3288 transitions. [2024-10-10 23:29:21,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 3288 transitions. [2024-10-10 23:29:21,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-10 23:29:21,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:21,299 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-10 23:29:21,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:29:21,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:21,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:21,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1169344477, now seen corresponding path program 1 times [2024-10-10 23:29:21,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:21,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371190453] [2024-10-10 23:29:21,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:21,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:21,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:21,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371190453] [2024-10-10 23:29:21,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371190453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:21,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:21,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:21,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507594849] [2024-10-10 23:29:21,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:21,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:21,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:21,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:21,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:21,564 INFO L87 Difference]: Start difference. First operand 1893 states and 3288 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:24,932 INFO L93 Difference]: Finished difference Result 5383 states and 9440 transitions. [2024-10-10 23:29:24,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:24,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-10 23:29:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:24,947 INFO L225 Difference]: With dead ends: 5383 [2024-10-10 23:29:24,948 INFO L226 Difference]: Without dead ends: 3491 [2024-10-10 23:29:24,953 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-10 23:29:24,955 INFO L432 NwaCegarLoop]: 858 mSDtfsCounter, 922 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:24,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1011 Invalid, 3190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-10 23:29:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3491 states. [2024-10-10 23:29:25,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3491 to 3490. [2024-10-10 23:29:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3490 states, 3489 states have (on average 1.5385497277156779) internal successors, (5368), 3489 states have internal predecessors, (5368), 0 states have call successors, (0), 0 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-10 23:29:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 5368 transitions. [2024-10-10 23:29:25,031 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 5368 transitions. Word has length 99 [2024-10-10 23:29:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:25,032 INFO L471 AbstractCegarLoop]: Abstraction has 3490 states and 5368 transitions. [2024-10-10 23:29:25,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:25,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 5368 transitions. [2024-10-10 23:29:25,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-10 23:29:25,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:25,035 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-10 23:29:25,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:29:25,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:25,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1326568120, now seen corresponding path program 1 times [2024-10-10 23:29:25,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:25,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189914758] [2024-10-10 23:29:25,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:25,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:25,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:25,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189914758] [2024-10-10 23:29:25,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189914758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:25,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:25,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:25,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043007457] [2024-10-10 23:29:25,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:25,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:25,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:25,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:25,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:25,250 INFO L87 Difference]: Start difference. First operand 3490 states and 5368 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-10 23:29:28,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:28,756 INFO L93 Difference]: Finished difference Result 10168 states and 15699 transitions. [2024-10-10 23:29:28,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:28,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-10-10 23:29:28,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:28,780 INFO L225 Difference]: With dead ends: 10168 [2024-10-10 23:29:28,780 INFO L226 Difference]: Without dead ends: 6679 [2024-10-10 23:29:28,788 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-10 23:29:28,789 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 977 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:28,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 845 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-10 23:29:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2024-10-10 23:29:28,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 6668. [2024-10-10 23:29:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6668 states, 6667 states have (on average 1.3752812359382032) internal successors, (9169), 6667 states have internal predecessors, (9169), 0 states have call successors, (0), 0 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-10 23:29:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6668 states to 6668 states and 9169 transitions. [2024-10-10 23:29:28,929 INFO L78 Accepts]: Start accepts. Automaton has 6668 states and 9169 transitions. Word has length 101 [2024-10-10 23:29:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:28,930 INFO L471 AbstractCegarLoop]: Abstraction has 6668 states and 9169 transitions. [2024-10-10 23:29:28,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-10 23:29:28,932 INFO L276 IsEmpty]: Start isEmpty. Operand 6668 states and 9169 transitions. [2024-10-10 23:29:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-10 23:29:28,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:28,938 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:28,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:29:28,939 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:28,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:28,939 INFO L85 PathProgramCache]: Analyzing trace with hash 248144982, now seen corresponding path program 1 times [2024-10-10 23:29:28,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:28,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221402726] [2024-10-10 23:29:28,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:28,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:29,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:29,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221402726] [2024-10-10 23:29:29,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221402726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:29,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:29,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:29,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228878370] [2024-10-10 23:29:29,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:29,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:29,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:29,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:29,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:29,429 INFO L87 Difference]: Start difference. First operand 6668 states and 9169 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-10 23:29:32,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:32,236 INFO L93 Difference]: Finished difference Result 14122 states and 19184 transitions. [2024-10-10 23:29:32,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:32,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-10-10 23:29:32,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:32,263 INFO L225 Difference]: With dead ends: 14122 [2024-10-10 23:29:32,264 INFO L226 Difference]: Without dead ends: 7455 [2024-10-10 23:29:32,274 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-10 23:29:32,275 INFO L432 NwaCegarLoop]: 1084 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:32,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1213 Invalid, 2578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:29:32,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7455 states. [2024-10-10 23:29:32,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7455 to 7455. [2024-10-10 23:29:32,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7455 states, 7454 states have (on average 1.3363294875234772) internal successors, (9961), 7454 states have internal predecessors, (9961), 0 states have call successors, (0), 0 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-10 23:29:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 9961 transitions. [2024-10-10 23:29:32,458 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 9961 transitions. Word has length 145 [2024-10-10 23:29:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:32,460 INFO L471 AbstractCegarLoop]: Abstraction has 7455 states and 9961 transitions. [2024-10-10 23:29:32,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 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-10 23:29:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 9961 transitions. [2024-10-10 23:29:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-10 23:29:32,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:32,465 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:32,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:29:32,465 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:32,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:32,466 INFO L85 PathProgramCache]: Analyzing trace with hash -653632192, now seen corresponding path program 1 times [2024-10-10 23:29:32,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:32,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640093228] [2024-10-10 23:29:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:32,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-10 23:29:32,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:32,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640093228] [2024-10-10 23:29:32,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640093228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:32,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:32,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:32,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259958091] [2024-10-10 23:29:32,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:32,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:32,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:32,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:32,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:32,695 INFO L87 Difference]: Start difference. First operand 7455 states and 9961 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-10 23:29:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:36,068 INFO L93 Difference]: Finished difference Result 19655 states and 26990 transitions. [2024-10-10 23:29:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:36,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 159 [2024-10-10 23:29:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:36,103 INFO L225 Difference]: With dead ends: 19655 [2024-10-10 23:29:36,104 INFO L226 Difference]: Without dead ends: 12988 [2024-10-10 23:29:36,111 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-10 23:29:36,112 INFO L432 NwaCegarLoop]: 1069 mSDtfsCounter, 737 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2527 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 2527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:36,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 1220 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 2527 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:29:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12988 states. [2024-10-10 23:29:36,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12988 to 12971. [2024-10-10 23:29:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12970 states have (on average 1.235929067077872) internal successors, (16030), 12970 states have internal predecessors, (16030), 0 states have call successors, (0), 0 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-10 23:29:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 16030 transitions. [2024-10-10 23:29:36,316 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 16030 transitions. Word has length 159 [2024-10-10 23:29:36,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:36,316 INFO L471 AbstractCegarLoop]: Abstraction has 12971 states and 16030 transitions. [2024-10-10 23:29:36,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-10 23:29:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 16030 transitions. [2024-10-10 23:29:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-10 23:29:36,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:36,321 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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] [2024-10-10 23:29:36,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:29:36,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:36,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:36,322 INFO L85 PathProgramCache]: Analyzing trace with hash -564025711, now seen corresponding path program 1 times [2024-10-10 23:29:36,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:36,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294752306] [2024-10-10 23:29:36,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:36,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:29:36,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:36,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294752306] [2024-10-10 23:29:36,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294752306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:36,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:36,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:36,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247446703] [2024-10-10 23:29:36,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:36,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:36,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:36,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:36,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:36,669 INFO L87 Difference]: Start difference. First operand 12971 states and 16030 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-10 23:29:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:39,357 INFO L93 Difference]: Finished difference Result 22791 states and 28650 transitions. [2024-10-10 23:29:39,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:39,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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 246 [2024-10-10 23:29:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:39,383 INFO L225 Difference]: With dead ends: 22791 [2024-10-10 23:29:39,384 INFO L226 Difference]: Without dead ends: 12979 [2024-10-10 23:29:39,396 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-10 23:29:39,397 INFO L432 NwaCegarLoop]: 1025 mSDtfsCounter, 728 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2715 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 2719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:39,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1209 Invalid, 2719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2715 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:29:39,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12979 states. [2024-10-10 23:29:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12979 to 12971. [2024-10-10 23:29:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12971 states, 12970 states have (on average 1.2347725520431765) internal successors, (16015), 12970 states have internal predecessors, (16015), 0 states have call successors, (0), 0 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-10 23:29:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12971 states to 12971 states and 16015 transitions. [2024-10-10 23:29:39,576 INFO L78 Accepts]: Start accepts. Automaton has 12971 states and 16015 transitions. Word has length 246 [2024-10-10 23:29:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:39,576 INFO L471 AbstractCegarLoop]: Abstraction has 12971 states and 16015 transitions. [2024-10-10 23:29:39,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-10 23:29:39,577 INFO L276 IsEmpty]: Start isEmpty. Operand 12971 states and 16015 transitions. [2024-10-10 23:29:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-10-10 23:29:39,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:39,580 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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-10 23:29:39,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:29:39,581 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:39,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:39,581 INFO L85 PathProgramCache]: Analyzing trace with hash 972869367, now seen corresponding path program 1 times [2024-10-10 23:29:39,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:39,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992988350] [2024-10-10 23:29:39,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:39,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:39,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:39,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992988350] [2024-10-10 23:29:39,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992988350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:39,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:39,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:29:39,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956852613] [2024-10-10 23:29:39,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:39,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:39,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:39,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:39,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:39,757 INFO L87 Difference]: Start difference. First operand 12971 states and 16015 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:43,524 INFO L93 Difference]: Finished difference Result 36165 states and 45133 transitions. [2024-10-10 23:29:43,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:43,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2024-10-10 23:29:43,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:43,569 INFO L225 Difference]: With dead ends: 36165 [2024-10-10 23:29:43,570 INFO L226 Difference]: Without dead ends: 23195 [2024-10-10 23:29:43,585 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-10 23:29:43,587 INFO L432 NwaCegarLoop]: 1849 mSDtfsCounter, 841 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:43,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1986 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-10 23:29:43,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23195 states. [2024-10-10 23:29:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23195 to 22403. [2024-10-10 23:29:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22403 states, 22402 states have (on average 1.1931970359789303) internal successors, (26730), 22402 states have internal predecessors, (26730), 0 states have call successors, (0), 0 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-10 23:29:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22403 states to 22403 states and 26730 transitions. [2024-10-10 23:29:43,879 INFO L78 Accepts]: Start accepts. Automaton has 22403 states and 26730 transitions. Word has length 248 [2024-10-10 23:29:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:43,879 INFO L471 AbstractCegarLoop]: Abstraction has 22403 states and 26730 transitions. [2024-10-10 23:29:43,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 22403 states and 26730 transitions. [2024-10-10 23:29:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-10 23:29:43,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:43,885 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:29:43,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:29:43,885 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:43,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:43,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2120470535, now seen corresponding path program 1 times [2024-10-10 23:29:43,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:43,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866829938] [2024-10-10 23:29:43,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:43,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-10 23:29:44,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:44,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866829938] [2024-10-10 23:29:44,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866829938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:44,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:44,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:29:44,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827522088] [2024-10-10 23:29:44,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:44,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:44,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:44,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:44,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:44,076 INFO L87 Difference]: Start difference. First operand 22403 states and 26730 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 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-10 23:29:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:47,424 INFO L93 Difference]: Finished difference Result 55045 states and 66947 transitions. [2024-10-10 23:29:47,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:47,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 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 270 [2024-10-10 23:29:47,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:47,479 INFO L225 Difference]: With dead ends: 55045 [2024-10-10 23:29:47,479 INFO L226 Difference]: Without dead ends: 33430 [2024-10-10 23:29:47,507 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-10 23:29:47,508 INFO L432 NwaCegarLoop]: 808 mSDtfsCounter, 881 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 903 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 903 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:47,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 926 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [903 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:29:47,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33430 states. [2024-10-10 23:29:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33430 to 32634. [2024-10-10 23:29:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32634 states, 32633 states have (on average 1.1761407164526707) internal successors, (38381), 32633 states have internal predecessors, (38381), 0 states have call successors, (0), 0 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-10 23:29:48,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32634 states to 32634 states and 38381 transitions. [2024-10-10 23:29:48,050 INFO L78 Accepts]: Start accepts. Automaton has 32634 states and 38381 transitions. Word has length 270 [2024-10-10 23:29:48,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:48,051 INFO L471 AbstractCegarLoop]: Abstraction has 32634 states and 38381 transitions. [2024-10-10 23:29:48,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 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-10 23:29:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 32634 states and 38381 transitions. [2024-10-10 23:29:48,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-10-10 23:29:48,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:48,058 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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-10 23:29:48,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:29:48,059 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:48,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:48,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1939742946, now seen corresponding path program 1 times [2024-10-10 23:29:48,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:48,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629153410] [2024-10-10 23:29:48,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:48,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:29:48,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:48,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629153410] [2024-10-10 23:29:48,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629153410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:48,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:48,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:29:48,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652714149] [2024-10-10 23:29:48,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:48,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:48,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:48,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:48,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:48,294 INFO L87 Difference]: Start difference. First operand 32634 states and 38381 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:51,536 INFO L93 Difference]: Finished difference Result 76293 states and 91192 transitions. [2024-10-10 23:29:51,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:51,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 325 [2024-10-10 23:29:51,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:51,599 INFO L225 Difference]: With dead ends: 76293 [2024-10-10 23:29:51,599 INFO L226 Difference]: Without dead ends: 44447 [2024-10-10 23:29:51,632 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-10 23:29:51,633 INFO L432 NwaCegarLoop]: 1804 mSDtfsCounter, 829 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 3274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:51,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1947 Invalid, 3274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:29:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44447 states. [2024-10-10 23:29:52,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44447 to 43656. [2024-10-10 23:29:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43656 states, 43655 states have (on average 1.1516664757759707) internal successors, (50276), 43655 states have internal predecessors, (50276), 0 states have call successors, (0), 0 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-10 23:29:52,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43656 states to 43656 states and 50276 transitions. [2024-10-10 23:29:52,431 INFO L78 Accepts]: Start accepts. Automaton has 43656 states and 50276 transitions. Word has length 325 [2024-10-10 23:29:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:52,432 INFO L471 AbstractCegarLoop]: Abstraction has 43656 states and 50276 transitions. [2024-10-10 23:29:52,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 43656 states and 50276 transitions. [2024-10-10 23:29:52,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-10 23:29:52,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:52,448 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-10-10 23:29:52,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:29:52,449 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:52,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:52,449 INFO L85 PathProgramCache]: Analyzing trace with hash 919013408, now seen corresponding path program 1 times [2024-10-10 23:29:52,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:52,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138547818] [2024-10-10 23:29:52,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:52,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 194 proven. 113 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-10 23:29:54,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:54,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138547818] [2024-10-10 23:29:54,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138547818] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:29:54,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451457670] [2024-10-10 23:29:54,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:54,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:29:54,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:29:54,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:29:54,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:29:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:54,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:29:54,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:29:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-10 23:29:54,333 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:29:54,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451457670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:54,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:29:54,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-10 23:29:54,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795506182] [2024-10-10 23:29:54,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:54,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:54,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:54,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:54,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:29:54,339 INFO L87 Difference]: Start difference. First operand 43656 states and 50276 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:57,224 INFO L93 Difference]: Finished difference Result 86515 states and 99751 transitions. [2024-10-10 23:29:57,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:57,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2024-10-10 23:29:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:57,278 INFO L225 Difference]: With dead ends: 86515 [2024-10-10 23:29:57,278 INFO L226 Difference]: Without dead ends: 43647 [2024-10-10 23:29:57,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:29:57,311 INFO L432 NwaCegarLoop]: 687 mSDtfsCounter, 1075 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:57,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 816 Invalid, 2923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:29:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43647 states. [2024-10-10 23:29:57,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43647 to 43646. [2024-10-10 23:29:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43646 states, 43645 states have (on average 1.1132775804788635) internal successors, (48589), 43645 states have internal predecessors, (48589), 0 states have call successors, (0), 0 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-10 23:29:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43646 states to 43646 states and 48589 transitions. [2024-10-10 23:29:58,114 INFO L78 Accepts]: Start accepts. Automaton has 43646 states and 48589 transitions. Word has length 340 [2024-10-10 23:29:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:58,114 INFO L471 AbstractCegarLoop]: Abstraction has 43646 states and 48589 transitions. [2024-10-10 23:29:58,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 43646 states and 48589 transitions. [2024-10-10 23:29:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-10-10 23:29:58,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:58,127 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:29:58,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:29:58,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 23:29:58,329 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:58,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:58,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1613804370, now seen corresponding path program 1 times [2024-10-10 23:29:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:58,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932333527] [2024-10-10 23:29:58,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2024-10-10 23:29:59,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:59,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932333527] [2024-10-10 23:29:59,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932333527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:59,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:59,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:29:59,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703896355] [2024-10-10 23:29:59,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:59,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:59,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:59,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:59,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:59,274 INFO L87 Difference]: Start difference. First operand 43646 states and 48589 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-10 23:30:02,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:02,240 INFO L93 Difference]: Finished difference Result 86502 states and 96384 transitions. [2024-10-10 23:30:02,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:02,241 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 359 [2024-10-10 23:30:02,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:02,287 INFO L225 Difference]: With dead ends: 86502 [2024-10-10 23:30:02,288 INFO L226 Difference]: Without dead ends: 43644 [2024-10-10 23:30:02,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10 23:30:02,309 INFO L432 NwaCegarLoop]: 1340 mSDtfsCounter, 1167 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2464 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:02,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 1418 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2464 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:30:02,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43644 states. [2024-10-10 23:30:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43644 to 43643. [2024-10-10 23:30:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43643 states, 43642 states have (on average 1.0865908986755877) internal successors, (47421), 43642 states have internal predecessors, (47421), 0 states have call successors, (0), 0 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-10 23:30:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43643 states to 43643 states and 47421 transitions. [2024-10-10 23:30:02,789 INFO L78 Accepts]: Start accepts. Automaton has 43643 states and 47421 transitions. Word has length 359 [2024-10-10 23:30:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:02,790 INFO L471 AbstractCegarLoop]: Abstraction has 43643 states and 47421 transitions. [2024-10-10 23:30:02,790 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-10 23:30:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 43643 states and 47421 transitions. [2024-10-10 23:30:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-10-10 23:30:02,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:02,797 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:30:02,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:30:02,797 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:02,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:02,798 INFO L85 PathProgramCache]: Analyzing trace with hash -725162207, now seen corresponding path program 1 times [2024-10-10 23:30:02,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:02,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191672767] [2024-10-10 23:30:02,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:02,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-10-10 23:30:03,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:03,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191672767] [2024-10-10 23:30:03,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191672767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:03,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:03,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:03,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076275921] [2024-10-10 23:30:03,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:03,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:30:03,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:03,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:30:03,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:30:03,251 INFO L87 Difference]: Start difference. First operand 43643 states and 47421 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 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-10 23:30:09,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:09,390 INFO L93 Difference]: Finished difference Result 150457 states and 163808 transitions. [2024-10-10 23:30:09,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:30:09,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 382 [2024-10-10 23:30:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:09,533 INFO L225 Difference]: With dead ends: 150457 [2024-10-10 23:30:09,533 INFO L226 Difference]: Without dead ends: 107602 [2024-10-10 23:30:09,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:30:09,562 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 1712 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 6005 mSolverCounterSat, 1095 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 7100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1095 IncrementalHoareTripleChecker+Valid, 6005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:09,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 750 Invalid, 7100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1095 Valid, 6005 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-10 23:30:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107602 states. [2024-10-10 23:30:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107602 to 104325. [2024-10-10 23:30:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104325 states, 104324 states have (on average 1.0794352210421378) internal successors, (112611), 104324 states have internal predecessors, (112611), 0 states have call successors, (0), 0 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-10 23:30:11,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104325 states to 104325 states and 112611 transitions. [2024-10-10 23:30:11,192 INFO L78 Accepts]: Start accepts. Automaton has 104325 states and 112611 transitions. Word has length 382 [2024-10-10 23:30:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:11,193 INFO L471 AbstractCegarLoop]: Abstraction has 104325 states and 112611 transitions. [2024-10-10 23:30:11,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 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-10 23:30:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 104325 states and 112611 transitions. [2024-10-10 23:30:11,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2024-10-10 23:30:11,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:11,202 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:30:11,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:30:11,203 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:11,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:11,203 INFO L85 PathProgramCache]: Analyzing trace with hash -69303319, now seen corresponding path program 1 times [2024-10-10 23:30:11,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:11,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519058950] [2024-10-10 23:30:11,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:11,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 366 proven. 110 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-10-10 23:30:12,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:12,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519058950] [2024-10-10 23:30:12,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519058950] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:30:12,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081394878] [2024-10-10 23:30:12,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:12,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:30:12,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:30:12,768 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:30:12,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:30:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:12,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:30:12,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:30:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2024-10-10 23:30:13,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:30:13,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081394878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:13,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:30:13,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:30:13,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802701614] [2024-10-10 23:30:13,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:13,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:13,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:13,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:13,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:30:13,009 INFO L87 Difference]: Start difference. First operand 104325 states and 112611 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-10 23:30:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:17,041 INFO L93 Difference]: Finished difference Result 233051 states and 253447 transitions. [2024-10-10 23:30:17,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:17,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 425 [2024-10-10 23:30:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:17,206 INFO L225 Difference]: With dead ends: 233051 [2024-10-10 23:30:17,206 INFO L226 Difference]: Without dead ends: 129514 [2024-10-10 23:30:17,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:30:17,250 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 953 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 939 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 3355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 939 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:17,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 878 Invalid, 3355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [939 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-10 23:30:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129514 states. [2024-10-10 23:30:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129514 to 127921. [2024-10-10 23:30:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127921 states, 127920 states have (on average 1.0841932457786116) internal successors, (138690), 127920 states have internal predecessors, (138690), 0 states have call successors, (0), 0 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-10 23:30:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127921 states to 127921 states and 138690 transitions. [2024-10-10 23:30:19,038 INFO L78 Accepts]: Start accepts. Automaton has 127921 states and 138690 transitions. Word has length 425 [2024-10-10 23:30:19,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:19,039 INFO L471 AbstractCegarLoop]: Abstraction has 127921 states and 138690 transitions. [2024-10-10 23:30:19,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-10 23:30:19,039 INFO L276 IsEmpty]: Start isEmpty. Operand 127921 states and 138690 transitions. [2024-10-10 23:30:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-10-10 23:30:19,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:19,062 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:30:19,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:30:19,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:30:19,267 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:19,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:19,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2095718643, now seen corresponding path program 1 times [2024-10-10 23:30:19,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:19,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264002668] [2024-10-10 23:30:19,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:19,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-10 23:30:20,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:20,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264002668] [2024-10-10 23:30:20,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264002668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:20,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:20,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:20,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384246591] [2024-10-10 23:30:20,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:20,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:20,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:20,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:20,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:20,201 INFO L87 Difference]: Start difference. First operand 127921 states and 138690 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)