./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_label27.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_label27.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 e8feab662bc73c18f88b757dfbe2687c764aa0043a35ed648ed6332a38c0448d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:28:37,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:28:37,625 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:28:37,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:28:37,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:28:37,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:28:37,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:28:37,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:28:37,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:28:37,646 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:28:37,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:28:37,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:28:37,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:28:37,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:28:37,647 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:28:37,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:28:37,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:28:37,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:28:37,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:28:37,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:28:37,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:28:37,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:28:37,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:28:37,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:28:37,650 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:28:37,651 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:28:37,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:28:37,651 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:28:37,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:28:37,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:28:37,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:28:37,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:28:37,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:28:37,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:28:37,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:28:37,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:28:37,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:28:37,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:28:37,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:28:37,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:28:37,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:28:37,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:28:37,655 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 -> e8feab662bc73c18f88b757dfbe2687c764aa0043a35ed648ed6332a38c0448d [2024-10-10 23:28:37,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:28:37,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:28:37,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:28:37,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:28:37,887 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:28:37,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label27.c [2024-10-10 23:28:39,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:28:40,122 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:28:40,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label27.c [2024-10-10 23:28:40,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d29ba747f/3c09643130ea4183b1665632516bce0c/FLAGcc91ca4bc [2024-10-10 23:28:40,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d29ba747f/3c09643130ea4183b1665632516bce0c [2024-10-10 23:28:40,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:28:40,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:28:40,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:28:40,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:28:40,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:28:40,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:28:40" (1/1) ... [2024-10-10 23:28:40,178 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5172919b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:40, skipping insertion in model container [2024-10-10 23:28:40,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:28:40" (1/1) ... [2024-10-10 23:28:40,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:28:40,497 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_label27.c[6468,6481] [2024-10-10 23:28:41,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:28:41,167 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:28:41,187 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_label27.c[6468,6481] [2024-10-10 23:28:41,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:28:41,530 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:28:41,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:41 WrapperNode [2024-10-10 23:28:41,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:28:41,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:28:41,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:28:41,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:28:41,537 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:28:41" (1/1) ... [2024-10-10 23:28:41,597 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:28:41" (1/1) ... [2024-10-10 23:28:42,168 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-10 23:28:42,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:28:42,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:28:42,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:28:42,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:28:42,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:41" (1/1) ... [2024-10-10 23:28:42,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:41" (1/1) ... [2024-10-10 23:28:42,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:41" (1/1) ... [2024-10-10 23:28:42,574 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:28:42,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:41" (1/1) ... [2024-10-10 23:28:42,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:41" (1/1) ... [2024-10-10 23:28:42,794 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:41" (1/1) ... [2024-10-10 23:28:42,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:41" (1/1) ... [2024-10-10 23:28:42,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:41" (1/1) ... [2024-10-10 23:28:42,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:41" (1/1) ... [2024-10-10 23:28:42,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:28:42,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:28:42,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:28:42,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:28:42,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:41" (1/1) ... [2024-10-10 23:28:42,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:28:42,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:28:42,999 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:28:43,001 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:28:43,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:28:43,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:28:43,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:28:43,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:28:43,104 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:28:43,105 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:28:47,979 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-10 23:28:47,980 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:28:48,030 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:28:48,030 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:28:48,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:28:48 BoogieIcfgContainer [2024-10-10 23:28:48,031 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:28:48,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:28:48,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:28:48,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:28:48,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:28:40" (1/3) ... [2024-10-10 23:28:48,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318c1005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:28:48, skipping insertion in model container [2024-10-10 23:28:48,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:28:41" (2/3) ... [2024-10-10 23:28:48,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318c1005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:28:48, skipping insertion in model container [2024-10-10 23:28:48,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:28:48" (3/3) ... [2024-10-10 23:28:48,037 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label27.c [2024-10-10 23:28:48,049 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:28:48,050 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:28:48,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:28:48,130 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;@3eee0499, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:28:48,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:28:48,143 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:28:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 23:28:48,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:48,154 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] [2024-10-10 23:28:48,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:48,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1017894885, now seen corresponding path program 1 times [2024-10-10 23:28:48,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:48,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901600590] [2024-10-10 23:28:48,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:48,373 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:28:48,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:48,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901600590] [2024-10-10 23:28:48,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901600590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:48,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:48,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:28:48,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954436538] [2024-10-10 23:28:48,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:48,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:28:48,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:48,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:28:48,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:28:48,422 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 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:48,560 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-10 23:28:48,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:28:48,570 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-10-10 23:28:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:48,601 INFO L225 Difference]: With dead ends: 2071 [2024-10-10 23:28:48,637 INFO L226 Difference]: Without dead ends: 1034 [2024-10-10 23:28:48,648 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:28:48,656 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:28:48,661 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:28:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-10 23:28:48,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-10 23:28:48,782 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:28:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-10 23:28:48,788 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 44 [2024-10-10 23:28:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:48,789 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-10 23:28:48,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-10 23:28:48,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 23:28:48,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:48,790 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] [2024-10-10 23:28:48,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:28:48,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:48,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1786485728, now seen corresponding path program 1 times [2024-10-10 23:28:48,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:48,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767013438] [2024-10-10 23:28:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:48,951 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:28:48,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:48,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767013438] [2024-10-10 23:28:48,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767013438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:48,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:48,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:28:48,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186641364] [2024-10-10 23:28:48,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:48,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:48,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:48,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:48,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:48,955 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:53,301 INFO L93 Difference]: Finished difference Result 3015 states and 5510 transitions. [2024-10-10 23:28:53,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:53,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-10-10 23:28:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:53,307 INFO L225 Difference]: With dead ends: 3015 [2024-10-10 23:28:53,307 INFO L226 Difference]: Without dead ends: 1982 [2024-10-10 23:28:53,310 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:28:53,311 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 1010 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 929 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 3885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 929 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:53,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 317 Invalid, 3885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [929 Valid, 2956 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-10 23:28:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2024-10-10 23:28:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1929. [2024-10-10 23:28:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1928 states have (on average 1.7977178423236515) internal successors, (3466), 1928 states have internal predecessors, (3466), 0 states have call successors, (0), 0 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:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 3466 transitions. [2024-10-10 23:28:53,351 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 3466 transitions. Word has length 44 [2024-10-10 23:28:53,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:53,352 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 3466 transitions. [2024-10-10 23:28:53,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 3466 transitions. [2024-10-10 23:28:53,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-10 23:28:53,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:53,357 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, 1, 1, 1, 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:53,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:28:53,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:53,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:53,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2110678795, now seen corresponding path program 1 times [2024-10-10 23:28:53,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:53,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668779310] [2024-10-10 23:28:53,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:53,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:28:53,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:53,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668779310] [2024-10-10 23:28:53,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668779310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:53,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:53,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:28:53,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598987043] [2024-10-10 23:28:53,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:53,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:53,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:53,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:53,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:53,535 INFO L87 Difference]: Start difference. First operand 1929 states and 3466 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:28:56,890 INFO L93 Difference]: Finished difference Result 5455 states and 9916 transitions. [2024-10-10 23:28:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:28:56,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-10-10 23:28:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:28:56,901 INFO L225 Difference]: With dead ends: 5455 [2024-10-10 23:28:56,902 INFO L226 Difference]: Without dead ends: 3527 [2024-10-10 23:28:56,904 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:28:56,905 INFO L432 NwaCegarLoop]: 853 mSDtfsCounter, 923 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:28:56,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1005 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-10 23:28:56,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3527 states. [2024-10-10 23:28:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3527 to 3525. [2024-10-10 23:28:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3525 states, 3524 states have (on average 1.5672531214528944) internal successors, (5523), 3524 states have internal predecessors, (5523), 0 states have call successors, (0), 0 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:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 5523 transitions. [2024-10-10 23:28:56,969 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 5523 transitions. Word has length 109 [2024-10-10 23:28:56,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:28:56,969 INFO L471 AbstractCegarLoop]: Abstraction has 3525 states and 5523 transitions. [2024-10-10 23:28:56,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 5523 transitions. [2024-10-10 23:28:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-10 23:28:56,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:28:56,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:28:56,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:28:56,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:28:56,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1023593318, now seen corresponding path program 1 times [2024-10-10 23:28:56,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:28:56,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360462491] [2024-10-10 23:28:56,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:28:56,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:28:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:28:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:28:57,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:28:57,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360462491] [2024-10-10 23:28:57,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360462491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:28:57,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:28:57,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:28:57,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108995511] [2024-10-10 23:28:57,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:28:57,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:28:57,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:28:57,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:28:57,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:28:57,153 INFO L87 Difference]: Start difference. First operand 3525 states and 5523 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:00,393 INFO L93 Difference]: Finished difference Result 10231 states and 16096 transitions. [2024-10-10 23:29:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:00,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-10 23:29:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:00,413 INFO L225 Difference]: With dead ends: 10231 [2024-10-10 23:29:00,414 INFO L226 Difference]: Without dead ends: 6707 [2024-10-10 23:29:00,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:00,420 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 972 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:00,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 848 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2535 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:29:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6707 states. [2024-10-10 23:29:00,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6707 to 6699. [2024-10-10 23:29:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6699 states, 6698 states have (on average 1.4131083905643476) internal successors, (9465), 6698 states have internal predecessors, (9465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6699 states to 6699 states and 9465 transitions. [2024-10-10 23:29:00,614 INFO L78 Accepts]: Start accepts. Automaton has 6699 states and 9465 transitions. Word has length 115 [2024-10-10 23:29:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:00,616 INFO L471 AbstractCegarLoop]: Abstraction has 6699 states and 9465 transitions. [2024-10-10 23:29:00,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6699 states and 9465 transitions. [2024-10-10 23:29:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-10 23:29:00,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:00,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:00,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:29:00,619 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:00,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:00,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1522333595, now seen corresponding path program 1 times [2024-10-10 23:29:00,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:00,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425140204] [2024-10-10 23:29:00,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:00,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:00,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:00,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425140204] [2024-10-10 23:29:00,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425140204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:00,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:00,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:00,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200042003] [2024-10-10 23:29:00,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:00,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:00,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:00,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:00,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:00,777 INFO L87 Difference]: Start difference. First operand 6699 states and 9465 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:04,193 INFO L93 Difference]: Finished difference Result 17442 states and 24478 transitions. [2024-10-10 23:29:04,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:04,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2024-10-10 23:29:04,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:04,221 INFO L225 Difference]: With dead ends: 17442 [2024-10-10 23:29:04,221 INFO L226 Difference]: Without dead ends: 10744 [2024-10-10 23:29:04,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:04,235 INFO L432 NwaCegarLoop]: 832 mSDtfsCounter, 844 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 3292 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 3742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 3292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:04,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 963 Invalid, 3742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 3292 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-10 23:29:04,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10744 states. [2024-10-10 23:29:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10744 to 10668. [2024-10-10 23:29:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10668 states, 10667 states have (on average 1.3563326146057935) internal successors, (14468), 10667 states have internal predecessors, (14468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10668 states to 10668 states and 14468 transitions. [2024-10-10 23:29:04,535 INFO L78 Accepts]: Start accepts. Automaton has 10668 states and 14468 transitions. Word has length 145 [2024-10-10 23:29:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:04,536 INFO L471 AbstractCegarLoop]: Abstraction has 10668 states and 14468 transitions. [2024-10-10 23:29:04,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 10668 states and 14468 transitions. [2024-10-10 23:29:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-10 23:29:04,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:04,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:04,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:29:04,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:04,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:04,538 INFO L85 PathProgramCache]: Analyzing trace with hash -249489538, now seen corresponding path program 1 times [2024-10-10 23:29:04,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:04,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354479760] [2024-10-10 23:29:04,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:04,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:04,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:04,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354479760] [2024-10-10 23:29:04,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354479760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:04,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:04,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:04,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818738851] [2024-10-10 23:29:04,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:04,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:04,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:04,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:04,836 INFO L87 Difference]: Start difference. First operand 10668 states and 14468 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 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:29:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:07,617 INFO L93 Difference]: Finished difference Result 20548 states and 28118 transitions. [2024-10-10 23:29:07,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:07,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 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:29:07,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:07,640 INFO L225 Difference]: With dead ends: 20548 [2024-10-10 23:29:07,641 INFO L226 Difference]: Without dead ends: 10668 [2024-10-10 23:29:07,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:07,653 INFO L432 NwaCegarLoop]: 1081 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:07,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1210 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:29:07,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2024-10-10 23:29:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 10668. [2024-10-10 23:29:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10668 states, 10667 states have (on average 1.3539889378456924) internal successors, (14443), 10667 states have internal predecessors, (14443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10668 states to 10668 states and 14443 transitions. [2024-10-10 23:29:07,838 INFO L78 Accepts]: Start accepts. Automaton has 10668 states and 14443 transitions. Word has length 155 [2024-10-10 23:29:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:07,838 INFO L471 AbstractCegarLoop]: Abstraction has 10668 states and 14443 transitions. [2024-10-10 23:29:07,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 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:29:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 10668 states and 14443 transitions. [2024-10-10 23:29:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-10 23:29:07,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:07,843 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:07,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:29:07,844 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:07,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:07,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1836590104, now seen corresponding path program 1 times [2024-10-10 23:29:07,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:07,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233813747] [2024-10-10 23:29:07,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:07,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:08,011 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:08,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:08,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233813747] [2024-10-10 23:29:08,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233813747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:08,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:08,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:29:08,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223738134] [2024-10-10 23:29:08,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:08,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:08,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:08,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:08,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:08,014 INFO L87 Difference]: Start difference. First operand 10668 states and 14443 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:11,081 INFO L93 Difference]: Finished difference Result 29990 states and 41154 transitions. [2024-10-10 23:29:11,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:11,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2024-10-10 23:29:11,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:11,110 INFO L225 Difference]: With dead ends: 29990 [2024-10-10 23:29:11,110 INFO L226 Difference]: Without dead ends: 20110 [2024-10-10 23:29:11,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:11,123 INFO L432 NwaCegarLoop]: 1847 mSDtfsCounter, 892 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:11,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1985 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:29:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20110 states. [2024-10-10 23:29:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20110 to 19313. [2024-10-10 23:29:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19313 states, 19312 states have (on average 1.2808616404308202) internal successors, (24736), 19312 states have internal predecessors, (24736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19313 states to 19313 states and 24736 transitions. [2024-10-10 23:29:11,303 INFO L78 Accepts]: Start accepts. Automaton has 19313 states and 24736 transitions. Word has length 169 [2024-10-10 23:29:11,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:11,303 INFO L471 AbstractCegarLoop]: Abstraction has 19313 states and 24736 transitions. [2024-10-10 23:29:11,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:11,304 INFO L276 IsEmpty]: Start isEmpty. Operand 19313 states and 24736 transitions. [2024-10-10 23:29:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-10 23:29:11,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:11,307 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:11,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:29:11,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:11,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:11,307 INFO L85 PathProgramCache]: Analyzing trace with hash -23937511, now seen corresponding path program 1 times [2024-10-10 23:29:11,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:11,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890159058] [2024-10-10 23:29:11,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:11,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-10 23:29:11,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:11,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890159058] [2024-10-10 23:29:11,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890159058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:11,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:11,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:29:11,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258430941] [2024-10-10 23:29:11,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:11,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:11,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:11,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:11,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:11,620 INFO L87 Difference]: Start difference. First operand 19313 states and 24736 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:14,581 INFO L93 Difference]: Finished difference Result 44941 states and 56954 transitions. [2024-10-10 23:29:14,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:14,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 256 [2024-10-10 23:29:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:14,632 INFO L225 Difference]: With dead ends: 44941 [2024-10-10 23:29:14,632 INFO L226 Difference]: Without dead ends: 25629 [2024-10-10 23:29:14,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:14,653 INFO L432 NwaCegarLoop]: 1010 mSDtfsCounter, 726 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:14,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1189 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2701 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:29:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25629 states. [2024-10-10 23:29:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25629 to 25621. [2024-10-10 23:29:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25621 states, 25620 states have (on average 1.2324746291959408) internal successors, (31576), 25620 states have internal predecessors, (31576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25621 states to 25621 states and 31576 transitions. [2024-10-10 23:29:14,930 INFO L78 Accepts]: Start accepts. Automaton has 25621 states and 31576 transitions. Word has length 256 [2024-10-10 23:29:14,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:14,930 INFO L471 AbstractCegarLoop]: Abstraction has 25621 states and 31576 transitions. [2024-10-10 23:29:14,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 25621 states and 31576 transitions. [2024-10-10 23:29:14,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-10-10 23:29:14,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:14,934 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:29:14,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:29:14,934 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:14,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:14,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1248951905, now seen corresponding path program 1 times [2024-10-10 23:29:14,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:14,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436780262] [2024-10-10 23:29:14,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:14,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:29:15,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:15,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436780262] [2024-10-10 23:29:15,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436780262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:15,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:15,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:29:15,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337493687] [2024-10-10 23:29:15,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:15,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:15,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:15,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:15,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:15,200 INFO L87 Difference]: Start difference. First operand 25621 states and 31576 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:18,849 INFO L93 Difference]: Finished difference Result 72508 states and 89960 transitions. [2024-10-10 23:29:18,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:18,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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:29:18,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:18,901 INFO L225 Difference]: With dead ends: 72508 [2024-10-10 23:29:18,901 INFO L226 Difference]: Without dead ends: 47675 [2024-10-10 23:29:18,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:18,928 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 824 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 916 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 916 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:18,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 898 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [916 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-10 23:29:18,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47675 states. [2024-10-10 23:29:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47675 to 46090. [2024-10-10 23:29:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46090 states, 46089 states have (on average 1.1848597279177244) internal successors, (54609), 46089 states have internal predecessors, (54609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:19,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46090 states to 46090 states and 54609 transitions. [2024-10-10 23:29:19,339 INFO L78 Accepts]: Start accepts. Automaton has 46090 states and 54609 transitions. Word has length 271 [2024-10-10 23:29:19,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:19,340 INFO L471 AbstractCegarLoop]: Abstraction has 46090 states and 54609 transitions. [2024-10-10 23:29:19,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 46090 states and 54609 transitions. [2024-10-10 23:29:19,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-10 23:29:19,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:19,349 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:19,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:29:19,349 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:19,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:19,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1901814472, now seen corresponding path program 1 times [2024-10-10 23:29:19,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:19,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423900780] [2024-10-10 23:29:19,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:19,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 217 proven. 110 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-10 23:29:20,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:20,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423900780] [2024-10-10 23:29:20,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423900780] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:29:20,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358455070] [2024-10-10 23:29:20,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:20,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:29:20,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:29:20,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:29:20,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:29:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:20,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:29:20,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:29:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-10 23:29:20,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:29:20,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358455070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:20,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:29:20,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:29:20,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731458518] [2024-10-10 23:29:20,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:20,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:20,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:20,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:20,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:29:20,575 INFO L87 Difference]: Start difference. First operand 46090 states and 54609 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:23,805 INFO L93 Difference]: Finished difference Result 91381 states and 108415 transitions. [2024-10-10 23:29:23,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:23,805 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 350 [2024-10-10 23:29:23,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:23,866 INFO L225 Difference]: With dead ends: 91381 [2024-10-10 23:29:23,867 INFO L226 Difference]: Without dead ends: 46079 [2024-10-10 23:29:23,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 349 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:29:23,903 INFO L432 NwaCegarLoop]: 688 mSDtfsCounter, 1076 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:23,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 820 Invalid, 2922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2395 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:29:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46079 states. [2024-10-10 23:29:24,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46079 to 46076. [2024-10-10 23:29:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46076 states, 46075 states have (on average 1.1360607704829082) internal successors, (52344), 46075 states have internal predecessors, (52344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46076 states to 46076 states and 52344 transitions. [2024-10-10 23:29:24,324 INFO L78 Accepts]: Start accepts. Automaton has 46076 states and 52344 transitions. Word has length 350 [2024-10-10 23:29:24,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:24,324 INFO L471 AbstractCegarLoop]: Abstraction has 46076 states and 52344 transitions. [2024-10-10 23:29:24,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 46076 states and 52344 transitions. [2024-10-10 23:29:24,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-10-10 23:29:24,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:24,330 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:24,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:29:24,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-10 23:29:24,531 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:24,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash -604995767, now seen corresponding path program 1 times [2024-10-10 23:29:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:24,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358859887] [2024-10-10 23:29:24,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:24,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:29:24,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:24,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358859887] [2024-10-10 23:29:24,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358859887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:24,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:24,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:29:24,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299084414] [2024-10-10 23:29:24,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:24,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:24,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:24,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:24,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:24,742 INFO L87 Difference]: Start difference. First operand 46076 states and 52344 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:27,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:27,738 INFO L93 Difference]: Finished difference Result 101585 states and 116819 transitions. [2024-10-10 23:29:27,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:27,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359 [2024-10-10 23:29:27,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:27,800 INFO L225 Difference]: With dead ends: 101585 [2024-10-10 23:29:27,800 INFO L226 Difference]: Without dead ends: 56297 [2024-10-10 23:29:27,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:27,830 INFO L432 NwaCegarLoop]: 1438 mSDtfsCounter, 1110 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 767 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 767 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:27,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1522 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [767 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:29:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56297 states. [2024-10-10 23:29:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56297 to 56296. [2024-10-10 23:29:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56296 states, 56295 states have (on average 1.1241673328004262) internal successors, (63285), 56295 states have internal predecessors, (63285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56296 states to 56296 states and 63285 transitions. [2024-10-10 23:29:28,632 INFO L78 Accepts]: Start accepts. Automaton has 56296 states and 63285 transitions. Word has length 359 [2024-10-10 23:29:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:28,632 INFO L471 AbstractCegarLoop]: Abstraction has 56296 states and 63285 transitions. [2024-10-10 23:29:28,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand 56296 states and 63285 transitions. [2024-10-10 23:29:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-10-10 23:29:28,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:28,640 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:28,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:29:28,641 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:28,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:28,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1227654167, now seen corresponding path program 1 times [2024-10-10 23:29:28,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:28,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309286190] [2024-10-10 23:29:28,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:28,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-10-10 23:29:28,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:28,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309286190] [2024-10-10 23:29:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309286190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:28,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:28,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:29:28,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872029315] [2024-10-10 23:29:28,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:28,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:29:28,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:28,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:29:28,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:29:28,872 INFO L87 Difference]: Start difference. First operand 56296 states and 63285 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:35,409 INFO L93 Difference]: Finished difference Result 141881 states and 159542 transitions. [2024-10-10 23:29:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:29:35,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 392 [2024-10-10 23:29:35,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:35,531 INFO L225 Difference]: With dead ends: 141881 [2024-10-10 23:29:35,531 INFO L226 Difference]: Without dead ends: 86373 [2024-10-10 23:29:35,571 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:29:35,572 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 1677 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 6623 mSolverCounterSat, 929 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 7552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 929 IncrementalHoareTripleChecker+Valid, 6623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:35,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1677 Valid, 916 Invalid, 7552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [929 Valid, 6623 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-10-10 23:29:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86373 states. [2024-10-10 23:29:36,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86373 to 68113. [2024-10-10 23:29:36,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68113 states, 68112 states have (on average 1.1126086445853887) internal successors, (75782), 68112 states have internal predecessors, (75782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68113 states to 68113 states and 75782 transitions. [2024-10-10 23:29:36,496 INFO L78 Accepts]: Start accepts. Automaton has 68113 states and 75782 transitions. Word has length 392 [2024-10-10 23:29:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:36,496 INFO L471 AbstractCegarLoop]: Abstraction has 68113 states and 75782 transitions. [2024-10-10 23:29:36,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 68113 states and 75782 transitions. [2024-10-10 23:29:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-10-10 23:29:36,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:36,509 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:36,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:29:36,510 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:36,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:36,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2106809376, now seen corresponding path program 1 times [2024-10-10 23:29:36,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:36,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960604350] [2024-10-10 23:29:36,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:36,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-10 23:29:37,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:37,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960604350] [2024-10-10 23:29:37,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960604350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:37,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:37,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:29:37,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347778366] [2024-10-10 23:29:37,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:37,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:37,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:37,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:37,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:37,114 INFO L87 Difference]: Start difference. First operand 68113 states and 75782 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:40,764 INFO L93 Difference]: Finished difference Result 159832 states and 178093 transitions. [2024-10-10 23:29:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:40,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 405 [2024-10-10 23:29:40,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:40,871 INFO L225 Difference]: With dead ends: 159832 [2024-10-10 23:29:40,871 INFO L226 Difference]: Without dead ends: 92507 [2024-10-10 23:29:40,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:40,910 INFO L432 NwaCegarLoop]: 700 mSDtfsCounter, 830 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 936 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 3332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 936 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:40,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 781 Invalid, 3332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [936 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:29:40,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92507 states. [2024-10-10 23:29:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92507 to 90919. [2024-10-10 23:29:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90919 states, 90918 states have (on average 1.098715325898062) internal successors, (99893), 90918 states have internal predecessors, (99893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90919 states to 90919 states and 99893 transitions. [2024-10-10 23:29:42,032 INFO L78 Accepts]: Start accepts. Automaton has 90919 states and 99893 transitions. Word has length 405 [2024-10-10 23:29:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:42,033 INFO L471 AbstractCegarLoop]: Abstraction has 90919 states and 99893 transitions. [2024-10-10 23:29:42,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 90919 states and 99893 transitions. [2024-10-10 23:29:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2024-10-10 23:29:42,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:42,042 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, 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, 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] [2024-10-10 23:29:42,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:29:42,042 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:42,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:42,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1538354151, now seen corresponding path program 1 times [2024-10-10 23:29:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:42,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945317588] [2024-10-10 23:29:42,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:42,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-10 23:29:42,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:42,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945317588] [2024-10-10 23:29:42,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945317588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:42,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:42,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:29:42,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115500163] [2024-10-10 23:29:42,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:42,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:42,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:42,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:42,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:42,680 INFO L87 Difference]: Start difference. First operand 90919 states and 99893 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:45,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:45,941 INFO L93 Difference]: Finished difference Result 204686 states and 224263 transitions. [2024-10-10 23:29:45,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:45,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 425 [2024-10-10 23:29:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:46,099 INFO L225 Difference]: With dead ends: 204686 [2024-10-10 23:29:46,099 INFO L226 Difference]: Without dead ends: 114555 [2024-10-10 23:29:46,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:46,141 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 795 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:46,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1114 Invalid, 2837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:29:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114555 states. [2024-10-10 23:29:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114555 to 110598. [2024-10-10 23:29:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110598 states, 110597 states have (on average 1.0885105382605316) internal successors, (120386), 110597 states have internal predecessors, (120386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110598 states to 110598 states and 120386 transitions. [2024-10-10 23:29:47,824 INFO L78 Accepts]: Start accepts. Automaton has 110598 states and 120386 transitions. Word has length 425 [2024-10-10 23:29:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:47,824 INFO L471 AbstractCegarLoop]: Abstraction has 110598 states and 120386 transitions. [2024-10-10 23:29:47,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 110598 states and 120386 transitions. [2024-10-10 23:29:47,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2024-10-10 23:29:47,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:47,838 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:47,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:29:47,839 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:47,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:47,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1306435249, now seen corresponding path program 1 times [2024-10-10 23:29:47,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:47,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009512852] [2024-10-10 23:29:47,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:47,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 383 proven. 113 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-10-10 23:29:49,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:49,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009512852] [2024-10-10 23:29:49,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009512852] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:29:49,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135395531] [2024-10-10 23:29:49,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:49,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:29:49,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:29:49,083 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:29:49,087 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:29:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:49,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:29:49,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:29:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-10 23:29:49,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:29:49,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135395531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:49,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:29:49,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2024-10-10 23:29:49,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726593869] [2024-10-10 23:29:49,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:49,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:49,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:49,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:49,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:29:49,764 INFO L87 Difference]: Start difference. First operand 110598 states and 120386 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:53,189 INFO L93 Difference]: Finished difference Result 210183 states and 229314 transitions. [2024-10-10 23:29:53,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:53,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 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 435 [2024-10-10 23:29:53,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:53,338 INFO L225 Difference]: With dead ends: 210183 [2024-10-10 23:29:53,339 INFO L226 Difference]: Without dead ends: 113756 [2024-10-10 23:29:53,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:29:53,381 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 682 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:53,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1148 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:29:53,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113756 states. [2024-10-10 23:29:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113756 to 113746. [2024-10-10 23:29:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113746 states, 113745 states have (on average 1.0789309420194295) internal successors, (122723), 113745 states have internal predecessors, (122723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113746 states to 113746 states and 122723 transitions. [2024-10-10 23:29:55,220 INFO L78 Accepts]: Start accepts. Automaton has 113746 states and 122723 transitions. Word has length 435 [2024-10-10 23:29:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:29:55,220 INFO L471 AbstractCegarLoop]: Abstraction has 113746 states and 122723 transitions. [2024-10-10 23:29:55,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand 113746 states and 122723 transitions. [2024-10-10 23:29:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2024-10-10 23:29:55,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:29:55,226 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:29:55,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:29:55,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-10 23:29:55,431 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:29:55,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:29:55,431 INFO L85 PathProgramCache]: Analyzing trace with hash 349300052, now seen corresponding path program 1 times [2024-10-10 23:29:55,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:29:55,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177420216] [2024-10-10 23:29:55,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:29:55,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:29:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:29:55,613 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-10-10 23:29:55,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:29:55,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177420216] [2024-10-10 23:29:55,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177420216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:29:55,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:29:55,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:29:55,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214334520] [2024-10-10 23:29:55,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:29:55,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:29:55,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:29:55,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:29:55,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:55,615 INFO L87 Difference]: Start difference. First operand 113746 states and 122723 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:29:59,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:29:59,089 INFO L93 Difference]: Finished difference Result 228279 states and 246242 transitions. [2024-10-10 23:29:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:29:59,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 481 [2024-10-10 23:29:59,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:29:59,487 INFO L225 Difference]: With dead ends: 228279 [2024-10-10 23:29:59,488 INFO L226 Difference]: Without dead ends: 115321 [2024-10-10 23:29:59,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:29:59,535 INFO L432 NwaCegarLoop]: 1335 mSDtfsCounter, 933 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 2961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:29:59,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 1414 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-10 23:29:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115321 states. [2024-10-10 23:30:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115321 to 113735. [2024-10-10 23:30:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113735 states, 113734 states have (on average 1.0587950832644593) internal successors, (120421), 113734 states have internal predecessors, (120421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113735 states to 113735 states and 120421 transitions. [2024-10-10 23:30:00,893 INFO L78 Accepts]: Start accepts. Automaton has 113735 states and 120421 transitions. Word has length 481 [2024-10-10 23:30:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:00,897 INFO L471 AbstractCegarLoop]: Abstraction has 113735 states and 120421 transitions. [2024-10-10 23:30:00,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:00,901 INFO L276 IsEmpty]: Start isEmpty. Operand 113735 states and 120421 transitions. [2024-10-10 23:30:00,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2024-10-10 23:30:00,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:00,914 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, 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, 2, 2, 2, 2, 2, 2, 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:30:00,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:30:00,915 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:00,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:00,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1566597970, now seen corresponding path program 1 times [2024-10-10 23:30:00,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:00,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139843130] [2024-10-10 23:30:00,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:00,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:01,755 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-10 23:30:01,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:01,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139843130] [2024-10-10 23:30:01,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139843130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:01,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:01,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:01,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346867326] [2024-10-10 23:30:01,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:01,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:01,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:01,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:01,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:01,757 INFO L87 Difference]: Start difference. First operand 113735 states and 120421 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:30:05,355 INFO L93 Difference]: Finished difference Result 250293 states and 265587 transitions. [2024-10-10 23:30:05,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:30:05,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 486 [2024-10-10 23:30:05,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:30:05,519 INFO L225 Difference]: With dead ends: 250293 [2024-10-10 23:30:05,519 INFO L226 Difference]: Without dead ends: 135772 [2024-10-10 23:30:05,561 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:30:05,562 INFO L432 NwaCegarLoop]: 1662 mSDtfsCounter, 729 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2433 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 2433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:30:05,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1794 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 2433 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:30:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135772 states. [2024-10-10 23:30:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135772 to 135758. [2024-10-10 23:30:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135758 states, 135757 states have (on average 1.0514816915518168) internal successors, (142746), 135757 states have internal predecessors, (142746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135758 states to 135758 states and 142746 transitions. [2024-10-10 23:30:07,283 INFO L78 Accepts]: Start accepts. Automaton has 135758 states and 142746 transitions. Word has length 486 [2024-10-10 23:30:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:30:07,287 INFO L471 AbstractCegarLoop]: Abstraction has 135758 states and 142746 transitions. [2024-10-10 23:30:07,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:30:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 135758 states and 142746 transitions. [2024-10-10 23:30:07,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2024-10-10 23:30:07,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:30:07,300 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:30:07,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:30:07,300 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:30:07,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:30:07,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1824534760, now seen corresponding path program 1 times [2024-10-10 23:30:07,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:30:07,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737124703] [2024-10-10 23:30:07,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:30:07,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:30:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:30:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-10-10 23:30:07,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:30:07,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737124703] [2024-10-10 23:30:07,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737124703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:30:07,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:30:07,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:30:07,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87484350] [2024-10-10 23:30:07,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:30:07,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:30:07,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:30:07,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:30:07,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:30:07,690 INFO L87 Difference]: Start difference. First operand 135758 states and 142746 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)