./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_label09.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_label09.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 d7f66091a22b7f33dbae7f0078b7d76412336b82f61d79dbfed76c4950c4dfdc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:26:52,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:26:52,477 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:26:52,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:26:52,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:26:52,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:26:52,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:26:52,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:26:52,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:26:52,518 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:26:52,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:26:52,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:26:52,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:26:52,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:26:52,522 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:26:52,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:26:52,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:26:52,523 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:26:52,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:26:52,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:26:52,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:26:52,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:26:52,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:26:52,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:26:52,528 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:26:52,528 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:26:52,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:26:52,528 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:26:52,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:26:52,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:26:52,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:26:52,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:26:52,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:26:52,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:26:52,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:26:52,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:26:52,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:26:52,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:26:52,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:26:52,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:26:52,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:26:52,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:26:52,534 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 -> d7f66091a22b7f33dbae7f0078b7d76412336b82f61d79dbfed76c4950c4dfdc [2024-10-10 23:26:52,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:26:52,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:26:52,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:26:52,785 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:26:52,785 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:26:52,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label09.c [2024-10-10 23:26:54,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:26:54,671 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:26:54,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label09.c [2024-10-10 23:26:54,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a9f17e40c/2b0ec273a65c439e810d6761148c00c2/FLAG2ab934ecd [2024-10-10 23:26:54,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a9f17e40c/2b0ec273a65c439e810d6761148c00c2 [2024-10-10 23:26:54,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:26:54,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:26:54,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:26:54,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:26:54,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:26:54,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:26:54" (1/1) ... [2024-10-10 23:26:54,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45aa5c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:54, skipping insertion in model container [2024-10-10 23:26:54,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:26:54" (1/1) ... [2024-10-10 23:26:54,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:26:55,213 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_label09.c[8517,8530] [2024-10-10 23:26:56,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:26:56,076 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:26:56,105 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_label09.c[8517,8530] [2024-10-10 23:26:56,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:26:56,670 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:26:56,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:56 WrapperNode [2024-10-10 23:26:56,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:26:56,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:26:56,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:26:56,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:26:56,679 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:26:56" (1/1) ... [2024-10-10 23:26:56,758 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:26:56" (1/1) ... [2024-10-10 23:26:57,339 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-10 23:26:57,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:26:57,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:26:57,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:26:57,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:26:57,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:56" (1/1) ... [2024-10-10 23:26:57,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:56" (1/1) ... [2024-10-10 23:26:57,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:56" (1/1) ... [2024-10-10 23:26:57,675 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:26:57,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:56" (1/1) ... [2024-10-10 23:26:57,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:56" (1/1) ... [2024-10-10 23:26:57,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:56" (1/1) ... [2024-10-10 23:26:58,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:56" (1/1) ... [2024-10-10 23:26:58,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:56" (1/1) ... [2024-10-10 23:26:58,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:56" (1/1) ... [2024-10-10 23:26:58,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:26:58,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:26:58,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:26:58,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:26:58,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:56" (1/1) ... [2024-10-10 23:26:58,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:26:58,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:26:58,198 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:26:58,204 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:26:58,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:26:58,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:26:58,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:26:58,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:26:58,318 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:26:58,320 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:27:03,989 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-10 23:27:03,989 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:27:04,062 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:27:04,062 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:27:04,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:27:04 BoogieIcfgContainer [2024-10-10 23:27:04,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:27:04,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:27:04,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:27:04,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:27:04,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:26:54" (1/3) ... [2024-10-10 23:27:04,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6511f92d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:27:04, skipping insertion in model container [2024-10-10 23:27:04,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:26:56" (2/3) ... [2024-10-10 23:27:04,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6511f92d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:27:04, skipping insertion in model container [2024-10-10 23:27:04,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:27:04" (3/3) ... [2024-10-10 23:27:04,073 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label09.c [2024-10-10 23:27:04,091 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:27:04,091 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:27:04,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:27:04,190 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;@34504749, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:27:04,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:27:04,198 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:27:04,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-10 23:27:04,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:04,206 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:27:04,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:04,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:04,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1108882586, now seen corresponding path program 1 times [2024-10-10 23:27:04,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:04,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331319899] [2024-10-10 23:27:04,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:04,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:04,423 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:27:04,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:04,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331319899] [2024-10-10 23:27:04,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331319899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:04,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:04,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:04,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358034730] [2024-10-10 23:27:04,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:04,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:27:04,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:04,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:27:04,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:27:04,463 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 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:27:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:04,553 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-10 23:27:04,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:27:04,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-10-10 23:27:04,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:04,589 INFO L225 Difference]: With dead ends: 2071 [2024-10-10 23:27:04,590 INFO L226 Difference]: Without dead ends: 1034 [2024-10-10 23:27:04,598 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:27:04,603 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:27:04,604 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:27:04,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-10 23:27:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-10 23:27:04,699 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:27:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-10 23:27:04,704 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 59 [2024-10-10 23:27:04,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:04,704 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-10 23:27:04,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:27:04,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-10 23:27:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-10 23:27:04,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:04,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:27:04,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:27:04,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:04,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:04,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1611547701, now seen corresponding path program 1 times [2024-10-10 23:27:04,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:04,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930264818] [2024-10-10 23:27:04,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:04,943 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:27:04,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:04,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930264818] [2024-10-10 23:27:04,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930264818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:04,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:04,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:04,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588332231] [2024-10-10 23:27:04,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:04,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:04,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:04,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:04,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:04,947 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:27:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:08,888 INFO L93 Difference]: Finished difference Result 2976 states and 5471 transitions. [2024-10-10 23:27:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:08,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-10-10 23:27:08,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:08,897 INFO L225 Difference]: With dead ends: 2976 [2024-10-10 23:27:08,897 INFO L226 Difference]: Without dead ends: 1943 [2024-10-10 23:27:08,899 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:27:08,900 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 895 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:08,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 538 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-10 23:27:08,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2024-10-10 23:27:08,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1872. [2024-10-10 23:27:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.7397113842864778) internal successors, (3255), 1871 states have internal predecessors, (3255), 0 states have call successors, (0), 0 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:27:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 3255 transitions. [2024-10-10 23:27:08,948 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 3255 transitions. Word has length 59 [2024-10-10 23:27:08,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:08,949 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 3255 transitions. [2024-10-10 23:27:08,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:27:08,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 3255 transitions. [2024-10-10 23:27:08,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-10 23:27:08,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:08,954 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, 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] [2024-10-10 23:27:08,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:27:08,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:08,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash 996175873, now seen corresponding path program 1 times [2024-10-10 23:27:08,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:08,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564614935] [2024-10-10 23:27:08,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:08,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:27:09,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:09,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564614935] [2024-10-10 23:27:09,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564614935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:09,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:09,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:09,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274400669] [2024-10-10 23:27:09,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:09,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:09,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:09,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:09,264 INFO L87 Difference]: Start difference. First operand 1872 states and 3255 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:27:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:13,133 INFO L93 Difference]: Finished difference Result 5350 states and 9368 transitions. [2024-10-10 23:27:13,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:13,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-10-10 23:27:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:13,147 INFO L225 Difference]: With dead ends: 5350 [2024-10-10 23:27:13,148 INFO L226 Difference]: Without dead ends: 3479 [2024-10-10 23:27:13,151 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:27:13,152 INFO L432 NwaCegarLoop]: 924 mSDtfsCounter, 884 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:13,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1077 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-10 23:27:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2024-10-10 23:27:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3478. [2024-10-10 23:27:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3477 states have (on average 1.5188380788035662) internal successors, (5281), 3477 states have internal predecessors, (5281), 0 states have call successors, (0), 0 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:27:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 5281 transitions. [2024-10-10 23:27:13,213 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 5281 transitions. Word has length 124 [2024-10-10 23:27:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:13,214 INFO L471 AbstractCegarLoop]: Abstraction has 3478 states and 5281 transitions. [2024-10-10 23:27:13,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:27:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 5281 transitions. [2024-10-10 23:27:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-10 23:27:13,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:13,217 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, 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] [2024-10-10 23:27:13,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:27:13,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:13,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:13,218 INFO L85 PathProgramCache]: Analyzing trace with hash 302651964, now seen corresponding path program 1 times [2024-10-10 23:27:13,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:13,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80145957] [2024-10-10 23:27:13,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:13,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:27:13,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:13,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80145957] [2024-10-10 23:27:13,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80145957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:13,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:13,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:13,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429129967] [2024-10-10 23:27:13,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:13,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:13,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:13,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:13,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:13,420 INFO L87 Difference]: Start difference. First operand 3478 states and 5281 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:27:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:16,623 INFO L93 Difference]: Finished difference Result 10141 states and 15437 transitions. [2024-10-10 23:27:16,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:16,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-10 23:27:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:16,647 INFO L225 Difference]: With dead ends: 10141 [2024-10-10 23:27:16,647 INFO L226 Difference]: Without dead ends: 6664 [2024-10-10 23:27:16,656 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:27:16,657 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 976 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 3326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:16,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 875 Invalid, 3326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:27:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6664 states. [2024-10-10 23:27:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6664 to 6656. [2024-10-10 23:27:16,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6656 states, 6655 states have (on average 1.3729526671675432) internal successors, (9137), 6655 states have internal predecessors, (9137), 0 states have call successors, (0), 0 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:27:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 9137 transitions. [2024-10-10 23:27:16,817 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 9137 transitions. Word has length 126 [2024-10-10 23:27:16,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:16,818 INFO L471 AbstractCegarLoop]: Abstraction has 6656 states and 9137 transitions. [2024-10-10 23:27:16,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:27:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 9137 transitions. [2024-10-10 23:27:16,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-10 23:27:16,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:16,824 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, 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:27:16,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:27:16,825 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:16,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:16,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1137848109, now seen corresponding path program 1 times [2024-10-10 23:27:16,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:16,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914295250] [2024-10-10 23:27:16,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:16,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:27:16,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:16,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914295250] [2024-10-10 23:27:16,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914295250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:16,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:16,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:16,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660758017] [2024-10-10 23:27:16,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:16,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:16,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:16,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:16,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:16,994 INFO L87 Difference]: Start difference. First operand 6656 states and 9137 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:19,962 INFO L93 Difference]: Finished difference Result 19636 states and 26968 transitions. [2024-10-10 23:27:19,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:19,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2024-10-10 23:27:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:20,005 INFO L225 Difference]: With dead ends: 19636 [2024-10-10 23:27:20,005 INFO L226 Difference]: Without dead ends: 12981 [2024-10-10 23:27:20,031 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:27:20,035 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 791 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:20,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1161 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:27:20,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2024-10-10 23:27:20,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 12174. [2024-10-10 23:27:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12174 states, 12173 states have (on average 1.2529368274049124) internal successors, (15252), 12173 states have internal predecessors, (15252), 0 states have call successors, (0), 0 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:27:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12174 states to 12174 states and 15252 transitions. [2024-10-10 23:27:20,288 INFO L78 Accepts]: Start accepts. Automaton has 12174 states and 15252 transitions. Word has length 132 [2024-10-10 23:27:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:20,288 INFO L471 AbstractCegarLoop]: Abstraction has 12174 states and 15252 transitions. [2024-10-10 23:27:20,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:27:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 12174 states and 15252 transitions. [2024-10-10 23:27:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-10 23:27:20,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:20,290 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, 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] [2024-10-10 23:27:20,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:27:20,290 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:20,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:20,291 INFO L85 PathProgramCache]: Analyzing trace with hash 872556869, now seen corresponding path program 1 times [2024-10-10 23:27:20,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:20,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676538753] [2024-10-10 23:27:20,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:20,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:27:20,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:20,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676538753] [2024-10-10 23:27:20,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676538753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:20,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:20,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:20,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049699899] [2024-10-10 23:27:20,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:20,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:20,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:20,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:20,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:20,593 INFO L87 Difference]: Start difference. First operand 12174 states and 15252 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:27:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:23,115 INFO L93 Difference]: Finished difference Result 25134 states and 31305 transitions. [2024-10-10 23:27:23,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:23,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2024-10-10 23:27:23,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:23,142 INFO L225 Difference]: With dead ends: 25134 [2024-10-10 23:27:23,143 INFO L226 Difference]: Without dead ends: 12961 [2024-10-10 23:27:23,157 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:27:23,160 INFO L432 NwaCegarLoop]: 1081 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:23,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1210 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:27:23,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12961 states. [2024-10-10 23:27:23,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12961 to 12961. [2024-10-10 23:27:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12961 states, 12960 states have (on average 1.237962962962963) internal successors, (16044), 12960 states have internal predecessors, (16044), 0 states have call successors, (0), 0 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:27:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12961 states to 12961 states and 16044 transitions. [2024-10-10 23:27:23,370 INFO L78 Accepts]: Start accepts. Automaton has 12961 states and 16044 transitions. Word has length 148 [2024-10-10 23:27:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:23,371 INFO L471 AbstractCegarLoop]: Abstraction has 12961 states and 16044 transitions. [2024-10-10 23:27:23,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 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:27:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 12961 states and 16044 transitions. [2024-10-10 23:27:23,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-10 23:27:23,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:23,375 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, 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] [2024-10-10 23:27:23,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:27:23,376 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:23,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:23,376 INFO L85 PathProgramCache]: Analyzing trace with hash -233924468, now seen corresponding path program 1 times [2024-10-10 23:27:23,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:23,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849588415] [2024-10-10 23:27:23,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:23,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-10 23:27:23,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:23,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849588415] [2024-10-10 23:27:23,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849588415] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:27:23,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333361976] [2024-10-10 23:27:23,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:23,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:27:23,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:27:23,732 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:27:23,733 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:27:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:23,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:27:23,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:27:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:27:23,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:27:23,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333361976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:23,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:27:23,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 23:27:23,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504609422] [2024-10-10 23:27:23,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:23,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:23,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:23,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:23,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:27:23,956 INFO L87 Difference]: Start difference. First operand 12961 states and 16044 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:27:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:27,527 INFO L93 Difference]: Finished difference Result 36955 states and 46071 transitions. [2024-10-10 23:27:27,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:27,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-10-10 23:27:27,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:27,579 INFO L225 Difference]: With dead ends: 36955 [2024-10-10 23:27:27,579 INFO L226 Difference]: Without dead ends: 24782 [2024-10-10 23:27:27,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:27:27,599 INFO L432 NwaCegarLoop]: 518 mSDtfsCounter, 949 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2700 mSolverCounterSat, 810 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 3510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 810 IncrementalHoareTripleChecker+Valid, 2700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:27,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 643 Invalid, 3510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [810 Valid, 2700 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-10 23:27:27,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24782 states. [2024-10-10 23:27:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24782 to 20844. [2024-10-10 23:27:27,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20844 states, 20843 states have (on average 1.2339874298325577) internal successors, (25720), 20843 states have internal predecessors, (25720), 0 states have call successors, (0), 0 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:27:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20844 states to 20844 states and 25720 transitions. [2024-10-10 23:27:27,995 INFO L78 Accepts]: Start accepts. Automaton has 20844 states and 25720 transitions. Word has length 155 [2024-10-10 23:27:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:27,995 INFO L471 AbstractCegarLoop]: Abstraction has 20844 states and 25720 transitions. [2024-10-10 23:27:27,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:27:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 20844 states and 25720 transitions. [2024-10-10 23:27:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-10-10 23:27:28,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:28,002 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, 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, 1, 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:27:28,021 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:27:28,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:27:28,204 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:28,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:28,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1884625840, now seen corresponding path program 1 times [2024-10-10 23:27:28,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:28,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578851935] [2024-10-10 23:27:28,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:28,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:27:28,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:28,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578851935] [2024-10-10 23:27:28,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578851935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:28,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:28,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:27:28,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743774970] [2024-10-10 23:27:28,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:28,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:28,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:28,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:28,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:28,663 INFO L87 Difference]: Start difference. First operand 20844 states and 25720 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 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:27:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:31,446 INFO L93 Difference]: Finished difference Result 45641 states and 55812 transitions. [2024-10-10 23:27:31,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:31,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 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 271 [2024-10-10 23:27:31,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:31,497 INFO L225 Difference]: With dead ends: 45641 [2024-10-10 23:27:31,498 INFO L226 Difference]: Without dead ends: 25585 [2024-10-10 23:27:31,525 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:27:31,526 INFO L432 NwaCegarLoop]: 1023 mSDtfsCounter, 728 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:31,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1207 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:27:31,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25585 states. [2024-10-10 23:27:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25585 to 25576. [2024-10-10 23:27:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25576 states, 25575 states have (on average 1.205904203323558) internal successors, (30841), 25575 states have internal predecessors, (30841), 0 states have call successors, (0), 0 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:27:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25576 states to 25576 states and 30841 transitions. [2024-10-10 23:27:31,863 INFO L78 Accepts]: Start accepts. Automaton has 25576 states and 30841 transitions. Word has length 271 [2024-10-10 23:27:31,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:31,864 INFO L471 AbstractCegarLoop]: Abstraction has 25576 states and 30841 transitions. [2024-10-10 23:27:31,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 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:27:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 25576 states and 30841 transitions. [2024-10-10 23:27:31,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-10-10 23:27:31,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:31,871 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, 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, 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:27:31,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:27:31,871 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:31,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:31,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1016523045, now seen corresponding path program 1 times [2024-10-10 23:27:31,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:31,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623333417] [2024-10-10 23:27:31,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:31,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-10 23:27:32,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:32,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623333417] [2024-10-10 23:27:32,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623333417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:32,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:32,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:27:32,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18581559] [2024-10-10 23:27:32,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:32,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:32,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:32,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:32,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:32,278 INFO L87 Difference]: Start difference. First operand 25576 states and 30841 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:27:35,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:35,633 INFO L93 Difference]: Finished difference Result 63757 states and 78443 transitions. [2024-10-10 23:27:35,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:35,634 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 295 [2024-10-10 23:27:35,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:35,691 INFO L225 Difference]: With dead ends: 63757 [2024-10-10 23:27:35,692 INFO L226 Difference]: Without dead ends: 38969 [2024-10-10 23:27:35,721 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:27:35,722 INFO L432 NwaCegarLoop]: 834 mSDtfsCounter, 887 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 908 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 908 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:35,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 954 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [908 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:27:35,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38969 states. [2024-10-10 23:27:36,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38969 to 36597. [2024-10-10 23:27:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36597 states, 36596 states have (on average 1.1913050606623674) internal successors, (43597), 36596 states have internal predecessors, (43597), 0 states have call successors, (0), 0 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:27:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36597 states to 36597 states and 43597 transitions. [2024-10-10 23:27:36,444 INFO L78 Accepts]: Start accepts. Automaton has 36597 states and 43597 transitions. Word has length 295 [2024-10-10 23:27:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:36,445 INFO L471 AbstractCegarLoop]: Abstraction has 36597 states and 43597 transitions. [2024-10-10 23:27:36,445 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:27:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand 36597 states and 43597 transitions. [2024-10-10 23:27:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-10-10 23:27:36,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:36,452 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:27:36,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:27:36,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:36,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:36,453 INFO L85 PathProgramCache]: Analyzing trace with hash 235284741, now seen corresponding path program 1 times [2024-10-10 23:27:36,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:36,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641202438] [2024-10-10 23:27:36,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:36,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-10 23:27:36,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:36,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641202438] [2024-10-10 23:27:36,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641202438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:36,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:36,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:27:36,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107796227] [2024-10-10 23:27:36,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:37,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:27:37,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:37,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:27:37,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:27:37,002 INFO L87 Difference]: Start difference. First operand 36597 states and 43597 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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:27:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:43,336 INFO L93 Difference]: Finished difference Result 106465 states and 128047 transitions. [2024-10-10 23:27:43,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:27:43,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 347 [2024-10-10 23:27:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:43,440 INFO L225 Difference]: With dead ends: 106465 [2024-10-10 23:27:43,440 INFO L226 Difference]: Without dead ends: 70656 [2024-10-10 23:27:43,469 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:27:43,470 INFO L432 NwaCegarLoop]: 876 mSDtfsCounter, 1717 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 6391 mSolverCounterSat, 1036 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 7427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1036 IncrementalHoareTripleChecker+Valid, 6391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:43,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 1081 Invalid, 7427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1036 Valid, 6391 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-10 23:27:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70656 states. [2024-10-10 23:27:44,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70656 to 68961. [2024-10-10 23:27:44,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68961 states, 68960 states have (on average 1.1797853828306264) internal successors, (81358), 68960 states have internal predecessors, (81358), 0 states have call successors, (0), 0 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:27:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68961 states to 68961 states and 81358 transitions. [2024-10-10 23:27:44,419 INFO L78 Accepts]: Start accepts. Automaton has 68961 states and 81358 transitions. Word has length 347 [2024-10-10 23:27:44,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:44,420 INFO L471 AbstractCegarLoop]: Abstraction has 68961 states and 81358 transitions. [2024-10-10 23:27:44,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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:27:44,420 INFO L276 IsEmpty]: Start isEmpty. Operand 68961 states and 81358 transitions. [2024-10-10 23:27:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-10-10 23:27:44,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:44,431 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, 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, 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:27:44,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:27:44,432 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:44,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:44,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1548304964, now seen corresponding path program 1 times [2024-10-10 23:27:44,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:44,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826536004] [2024-10-10 23:27:44,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:44,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 247 proven. 110 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-10 23:27:45,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:45,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826536004] [2024-10-10 23:27:45,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826536004] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:27:45,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514902924] [2024-10-10 23:27:45,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:45,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:27:45,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:27:45,939 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:27:45,940 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:27:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:46,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:27:46,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:27:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-10 23:27:46,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:27:46,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514902924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:46,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:27:46,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:27:46,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975572912] [2024-10-10 23:27:46,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:46,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:46,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:46,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:46,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:27:46,194 INFO L87 Difference]: Start difference. First operand 68961 states and 81358 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 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:27:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:49,633 INFO L93 Difference]: Finished difference Result 192416 states and 228152 transitions. [2024-10-10 23:27:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:49,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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 365 [2024-10-10 23:27:49,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:49,836 INFO L225 Difference]: With dead ends: 192416 [2024-10-10 23:27:49,837 INFO L226 Difference]: Without dead ends: 124243 [2024-10-10 23:27:49,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:27:49,904 INFO L432 NwaCegarLoop]: 714 mSDtfsCounter, 1075 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 538 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 538 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:49,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 926 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [538 Valid, 2635 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:27:50,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124243 states. [2024-10-10 23:27:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124243 to 121066. [2024-10-10 23:27:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121066 states, 121065 states have (on average 1.1542394581423203) internal successors, (139738), 121065 states have internal predecessors, (139738), 0 states have call successors, (0), 0 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:27:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121066 states to 121066 states and 139738 transitions. [2024-10-10 23:27:51,612 INFO L78 Accepts]: Start accepts. Automaton has 121066 states and 139738 transitions. Word has length 365 [2024-10-10 23:27:51,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:51,613 INFO L471 AbstractCegarLoop]: Abstraction has 121066 states and 139738 transitions. [2024-10-10 23:27:51,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 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:27:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 121066 states and 139738 transitions. [2024-10-10 23:27:51,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2024-10-10 23:27:51,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:51,625 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, 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, 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, 1, 1, 1, 1, 1, 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:27:51,642 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:27:51,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:27:51,826 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:51,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:51,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1804629883, now seen corresponding path program 1 times [2024-10-10 23:27:51,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:51,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141603237] [2024-10-10 23:27:51,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:51,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-10-10 23:27:52,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:52,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141603237] [2024-10-10 23:27:52,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141603237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:52,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:27:52,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:27:52,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117862480] [2024-10-10 23:27:52,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:52,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:52,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:52,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:52,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:27:52,359 INFO L87 Difference]: Start difference. First operand 121066 states and 139738 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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:27:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:27:55,877 INFO L93 Difference]: Finished difference Result 230129 states and 266187 transitions. [2024-10-10 23:27:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:27:55,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 413 [2024-10-10 23:27:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:27:56,004 INFO L225 Difference]: With dead ends: 230129 [2024-10-10 23:27:56,004 INFO L226 Difference]: Without dead ends: 109064 [2024-10-10 23:27:56,063 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:27:56,064 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 1036 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 2944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:27:56,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1636 Invalid, 2944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:27:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109064 states. [2024-10-10 23:27:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109064 to 102760. [2024-10-10 23:27:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102760 states, 102759 states have (on average 1.1134499167956091) internal successors, (114417), 102759 states have internal predecessors, (114417), 0 states have call successors, (0), 0 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:27:57,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102760 states to 102760 states and 114417 transitions. [2024-10-10 23:27:57,490 INFO L78 Accepts]: Start accepts. Automaton has 102760 states and 114417 transitions. Word has length 413 [2024-10-10 23:27:57,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:27:57,491 INFO L471 AbstractCegarLoop]: Abstraction has 102760 states and 114417 transitions. [2024-10-10 23:27:57,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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:27:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand 102760 states and 114417 transitions. [2024-10-10 23:27:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2024-10-10 23:27:57,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:27:57,499 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:27:57,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:27:57,500 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:27:57,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:27:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash 696183704, now seen corresponding path program 1 times [2024-10-10 23:27:57,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:27:57,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62695489] [2024-10-10 23:27:57,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:57,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:27:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 341 proven. 110 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-10 23:27:59,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:27:59,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62695489] [2024-10-10 23:27:59,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62695489] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:27:59,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714175758] [2024-10-10 23:27:59,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:27:59,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:27:59,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:27:59,197 INFO L229 MonitoredProcess]: Starting monitored process 4 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:27:59,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:27:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:27:59,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:27:59,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:27:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-10-10 23:27:59,783 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:27:59,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714175758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:27:59,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:27:59,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:27:59,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245129919] [2024-10-10 23:27:59,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:27:59,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:27:59,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:27:59,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:27:59,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:27:59,785 INFO L87 Difference]: Start difference. First operand 102760 states and 114417 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:28:02,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:02,875 INFO L93 Difference]: Finished difference Result 204730 states and 228040 transitions. [2024-10-10 23:28:02,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:02,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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 414 [2024-10-10 23:28:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:03,001 INFO L225 Difference]: With dead ends: 204730 [2024-10-10 23:28:03,001 INFO L226 Difference]: Without dead ends: 102758 [2024-10-10 23:28:03,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:28:03,033 INFO L432 NwaCegarLoop]: 1339 mSDtfsCounter, 1083 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:03,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 1417 Invalid, 2906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:28:03,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102758 states. [2024-10-10 23:28:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102758 to 102757. [2024-10-10 23:28:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102757 states, 102756 states have (on average 1.0837518003814863) internal successors, (111362), 102756 states have internal predecessors, (111362), 0 states have call successors, (0), 0 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:28:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102757 states to 102757 states and 111362 transitions. [2024-10-10 23:28:04,125 INFO L78 Accepts]: Start accepts. Automaton has 102757 states and 111362 transitions. Word has length 414 [2024-10-10 23:28:04,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:04,125 INFO L471 AbstractCegarLoop]: Abstraction has 102757 states and 111362 transitions. [2024-10-10 23:28:04,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 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:28:04,126 INFO L276 IsEmpty]: Start isEmpty. Operand 102757 states and 111362 transitions. [2024-10-10 23:28:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2024-10-10 23:28:04,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:04,145 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:04,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 23:28:04,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:28:04,349 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:04,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash 194141454, now seen corresponding path program 1 times [2024-10-10 23:28:04,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:04,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150282997] [2024-10-10 23:28:04,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:04,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 522 proven. 113 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-10-10 23:28:06,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:06,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150282997] [2024-10-10 23:28:06,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150282997] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:28:06,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396832041] [2024-10-10 23:28:06,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:06,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:28:06,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:28:06,593 INFO L229 MonitoredProcess]: Starting monitored process 5 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:28:06,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:28:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:06,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:28:06,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:28:06,871 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2024-10-10 23:28:06,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:28:06,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396832041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:06,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:28:06,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-10 23:28:06,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377179765] [2024-10-10 23:28:06,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:06,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:06,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:06,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:06,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:28:06,874 INFO L87 Difference]: Start difference. First operand 102757 states and 111362 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)