./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4c7460e797ab98c965c0146dc16cfd1742d13d580f8dc4b4e90e3d1aa36d777a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:50:46,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:50:46,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 02:50:46,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:50:46,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:50:46,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:50:46,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:50:46,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:50:46,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:50:46,488 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:50:46,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:50:46,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:50:46,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:50:46,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:50:46,491 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:50:46,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:50:46,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:50:46,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 02:50:46,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:50:46,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:50:46,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:50:46,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:50:46,494 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:50:46,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:50:46,494 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:50:46,494 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:50:46,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:50:46,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:50:46,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:50:46,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:50:46,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:50:46,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:50:46,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:50:46,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 02:50:46,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 02:50:46,496 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:50:46,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:50:46,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:50:46,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:50:46,497 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c7460e797ab98c965c0146dc16cfd1742d13d580f8dc4b4e90e3d1aa36d777a [2024-11-10 02:50:46,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:50:46,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:50:46,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:50:46,745 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:50:46,745 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:50:46,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c [2024-11-10 02:50:48,122 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:50:48,294 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:50:48,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c [2024-11-10 02:50:48,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c154dfdf/18756edd6f5d49fba8765802ab14b19f/FLAGb07eca32c [2024-11-10 02:50:48,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c154dfdf/18756edd6f5d49fba8765802ab14b19f [2024-11-10 02:50:48,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:50:48,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:50:48,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:50:48,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:50:48,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:50:48,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:50:48" (1/1) ... [2024-11-10 02:50:48,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fb1711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:48, skipping insertion in model container [2024-11-10 02:50:48,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:50:48" (1/1) ... [2024-11-10 02:50:48,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:50:48,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c[1253,1266] [2024-11-10 02:50:48,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:50:48,946 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:50:48,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2004_1.c[1253,1266] [2024-11-10 02:50:49,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:50:49,048 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:50:49,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:49 WrapperNode [2024-11-10 02:50:49,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:50:49,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:50:49,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:50:49,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:50:49,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:49" (1/1) ... [2024-11-10 02:50:49,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:49" (1/1) ... [2024-11-10 02:50:49,163 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 650 [2024-11-10 02:50:49,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:50:49,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:50:49,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:50:49,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:50:49,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:49" (1/1) ... [2024-11-10 02:50:49,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:49" (1/1) ... [2024-11-10 02:50:49,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:49" (1/1) ... [2024-11-10 02:50:49,230 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 02:50:49,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:49" (1/1) ... [2024-11-10 02:50:49,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:49" (1/1) ... [2024-11-10 02:50:49,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:49" (1/1) ... [2024-11-10 02:50:49,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:49" (1/1) ... [2024-11-10 02:50:49,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:49" (1/1) ... [2024-11-10 02:50:49,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:49" (1/1) ... [2024-11-10 02:50:49,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:50:49,297 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:50:49,297 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:50:49,297 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:50:49,298 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:49" (1/1) ... [2024-11-10 02:50:49,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:50:49,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:50:49,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 02:50:49,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 02:50:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:50:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 02:50:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:50:49,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:50:49,470 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:50:49,472 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:50:50,195 INFO L? ?]: Removed 394 outVars from TransFormulas that were not future-live. [2024-11-10 02:50:50,196 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:50:50,252 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:50:50,252 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:50:50,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:50:50 BoogieIcfgContainer [2024-11-10 02:50:50,253 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:50:50,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:50:50,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:50:50,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:50:50,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:50:48" (1/3) ... [2024-11-10 02:50:50,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b445ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:50:50, skipping insertion in model container [2024-11-10 02:50:50,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:50:49" (2/3) ... [2024-11-10 02:50:50,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b445ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:50:50, skipping insertion in model container [2024-11-10 02:50:50,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:50:50" (3/3) ... [2024-11-10 02:50:50,296 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_ball2004_1.c [2024-11-10 02:50:50,321 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:50:50,322 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:50:50,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:50:50,408 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;@692d65d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:50:50,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:50:50,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 197 states, 195 states have (on average 1.4871794871794872) internal successors, (290), 196 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 02:50:50,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:50:50,420 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] [2024-11-10 02:50:50,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:50:50,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:50:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash 116187848, now seen corresponding path program 1 times [2024-11-10 02:50:50,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:50:50,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147146036] [2024-11-10 02:50:50,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:50:50,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:50:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:50:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:50:50,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:50:50,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147146036] [2024-11-10 02:50:50,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147146036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:50:50,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:50:50,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:50:50,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499032378] [2024-11-10 02:50:50,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:50:50,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:50:50,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:50:50,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:50:50,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:50:50,903 INFO L87 Difference]: Start difference. First operand has 197 states, 195 states have (on average 1.4871794871794872) internal successors, (290), 196 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:50:51,053 INFO L93 Difference]: Finished difference Result 353 states and 523 transitions. [2024-11-10 02:50:51,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:50:51,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-10 02:50:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:50:51,064 INFO L225 Difference]: With dead ends: 353 [2024-11-10 02:50:51,064 INFO L226 Difference]: Without dead ends: 194 [2024-11-10 02:50:51,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:50:51,070 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 0 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:50:51,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 703 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:50:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-10 02:50:51,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-11-10 02:50:51,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4818652849740932) internal successors, (286), 193 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-11-10 02:50:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2024-11-10 02:50:51,117 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 28 [2024-11-10 02:50:51,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:50:51,118 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2024-11-10 02:50:51,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:51,118 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2024-11-10 02:50:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 02:50:51,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:50:51,119 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] [2024-11-10 02:50:51,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 02:50:51,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:50:51,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:50:51,120 INFO L85 PathProgramCache]: Analyzing trace with hash -548090386, now seen corresponding path program 1 times [2024-11-10 02:50:51,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:50:51,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532480160] [2024-11-10 02:50:51,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:50:51,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:50:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:50:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:50:51,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:50:51,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532480160] [2024-11-10 02:50:51,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532480160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:50:51,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:50:51,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:50:51,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030081734] [2024-11-10 02:50:51,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:50:51,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:50:51,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:50:51,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:50:51,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:50:51,239 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:50:51,354 INFO L93 Difference]: Finished difference Result 352 states and 519 transitions. [2024-11-10 02:50:51,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:50:51,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-10 02:50:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:50:51,356 INFO L225 Difference]: With dead ends: 352 [2024-11-10 02:50:51,358 INFO L226 Difference]: Without dead ends: 196 [2024-11-10 02:50:51,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:50:51,360 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 0 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:50:51,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 700 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:50:51,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-10 02:50:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-11-10 02:50:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.476923076923077) internal successors, (288), 195 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-11-10 02:50:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 288 transitions. [2024-11-10 02:50:51,371 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 288 transitions. Word has length 29 [2024-11-10 02:50:51,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:50:51,372 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 288 transitions. [2024-11-10 02:50:51,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 288 transitions. [2024-11-10 02:50:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 02:50:51,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:50:51,373 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] [2024-11-10 02:50:51,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 02:50:51,373 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:50:51,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:50:51,374 INFO L85 PathProgramCache]: Analyzing trace with hash -63688979, now seen corresponding path program 1 times [2024-11-10 02:50:51,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:50:51,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660266524] [2024-11-10 02:50:51,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:50:51,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:50:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:50:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:50:51,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:50:51,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660266524] [2024-11-10 02:50:51,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660266524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:50:51,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:50:51,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:50:51,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641937627] [2024-11-10 02:50:51,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:50:51,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:50:51,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:50:51,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:50:51,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:50:51,541 INFO L87 Difference]: Start difference. First operand 196 states and 288 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:50:51,709 INFO L93 Difference]: Finished difference Result 485 states and 714 transitions. [2024-11-10 02:50:51,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:50:51,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-10 02:50:51,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:50:51,711 INFO L225 Difference]: With dead ends: 485 [2024-11-10 02:50:51,711 INFO L226 Difference]: Without dead ends: 327 [2024-11-10 02:50:51,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:50:51,712 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 650 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:50:51,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 679 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:50:51,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-10 02:50:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 198. [2024-11-10 02:50:51,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.4720812182741116) internal successors, (290), 197 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 290 transitions. [2024-11-10 02:50:51,733 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 290 transitions. Word has length 30 [2024-11-10 02:50:51,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:50:51,733 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 290 transitions. [2024-11-10 02:50:51,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 290 transitions. [2024-11-10 02:50:51,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 02:50:51,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:50:51,738 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:50:51,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 02:50:51,739 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:50:51,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:50:51,739 INFO L85 PathProgramCache]: Analyzing trace with hash -137353535, now seen corresponding path program 1 times [2024-11-10 02:50:51,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:50:51,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271153565] [2024-11-10 02:50:51,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:50:51,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:50:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:50:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:50:52,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:50:52,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271153565] [2024-11-10 02:50:52,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271153565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:50:52,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:50:52,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:50:52,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298761939] [2024-11-10 02:50:52,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:50:52,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:50:52,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:50:52,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:50:52,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:50:52,465 INFO L87 Difference]: Start difference. First operand 198 states and 290 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:50:52,663 INFO L93 Difference]: Finished difference Result 477 states and 701 transitions. [2024-11-10 02:50:52,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:50:52,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-11-10 02:50:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:50:52,665 INFO L225 Difference]: With dead ends: 477 [2024-11-10 02:50:52,665 INFO L226 Difference]: Without dead ends: 319 [2024-11-10 02:50:52,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:50:52,666 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 598 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:50:52,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 672 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:50:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-10 02:50:52,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 245. [2024-11-10 02:50:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.4631147540983607) internal successors, (357), 244 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 357 transitions. [2024-11-10 02:50:52,685 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 357 transitions. Word has length 107 [2024-11-10 02:50:52,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:50:52,686 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 357 transitions. [2024-11-10 02:50:52,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:52,686 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 357 transitions. [2024-11-10 02:50:52,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 02:50:52,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:50:52,687 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:50:52,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 02:50:52,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:50:52,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:50:52,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2080886009, now seen corresponding path program 1 times [2024-11-10 02:50:52,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:50:52,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82105948] [2024-11-10 02:50:52,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:50:52,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:50:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:50:53,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:50:53,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:50:53,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82105948] [2024-11-10 02:50:53,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82105948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:50:53,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:50:53,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:50:53,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939305000] [2024-11-10 02:50:53,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:50:53,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:50:53,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:50:53,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:50:53,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:50:53,436 INFO L87 Difference]: Start difference. First operand 245 states and 357 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 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-11-10 02:50:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:50:53,599 INFO L93 Difference]: Finished difference Result 477 states and 699 transitions. [2024-11-10 02:50:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:50:53,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 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-11-10 02:50:53,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:50:53,601 INFO L225 Difference]: With dead ends: 477 [2024-11-10 02:50:53,601 INFO L226 Difference]: Without dead ends: 319 [2024-11-10 02:50:53,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:50:53,604 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 576 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:50:53,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 671 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:50:53,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-10 02:50:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 280. [2024-11-10 02:50:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 1.4623655913978495) internal successors, (408), 279 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 408 transitions. [2024-11-10 02:50:53,618 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 408 transitions. Word has length 109 [2024-11-10 02:50:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:50:53,618 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 408 transitions. [2024-11-10 02:50:53,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 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-11-10 02:50:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 408 transitions. [2024-11-10 02:50:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 02:50:53,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:50:53,623 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:50:53,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 02:50:53,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:50:53,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:50:53,624 INFO L85 PathProgramCache]: Analyzing trace with hash 701090102, now seen corresponding path program 1 times [2024-11-10 02:50:53,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:50:53,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908787641] [2024-11-10 02:50:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:50:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:50:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:50:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:50:54,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:50:54,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908787641] [2024-11-10 02:50:54,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908787641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:50:54,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:50:54,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:50:54,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014352944] [2024-11-10 02:50:54,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:50:54,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:50:54,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:50:54,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:50:54,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:50:54,121 INFO L87 Difference]: Start difference. First operand 280 states and 408 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:50:54,265 INFO L93 Difference]: Finished difference Result 535 states and 782 transitions. [2024-11-10 02:50:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:50:54,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-11-10 02:50:54,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:50:54,267 INFO L225 Difference]: With dead ends: 535 [2024-11-10 02:50:54,267 INFO L226 Difference]: Without dead ends: 319 [2024-11-10 02:50:54,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:50:54,269 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 604 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:50:54,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 678 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:50:54,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-10 02:50:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 280. [2024-11-10 02:50:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 1.4551971326164874) internal successors, (406), 279 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 406 transitions. [2024-11-10 02:50:54,277 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 406 transitions. Word has length 110 [2024-11-10 02:50:54,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:50:54,277 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 406 transitions. [2024-11-10 02:50:54,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 406 transitions. [2024-11-10 02:50:54,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 02:50:54,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:50:54,278 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:50:54,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 02:50:54,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:50:54,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:50:54,279 INFO L85 PathProgramCache]: Analyzing trace with hash -90860665, now seen corresponding path program 1 times [2024-11-10 02:50:54,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:50:54,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747804986] [2024-11-10 02:50:54,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:50:54,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:50:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:50:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:50:54,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:50:54,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747804986] [2024-11-10 02:50:54,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747804986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:50:54,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:50:54,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:50:54,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802935975] [2024-11-10 02:50:54,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:50:54,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:50:54,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:50:54,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:50:54,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:50:54,875 INFO L87 Difference]: Start difference. First operand 280 states and 406 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:55,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:50:55,031 INFO L93 Difference]: Finished difference Result 477 states and 696 transitions. [2024-11-10 02:50:55,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:50:55,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-10 02:50:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:50:55,033 INFO L225 Difference]: With dead ends: 477 [2024-11-10 02:50:55,033 INFO L226 Difference]: Without dead ends: 319 [2024-11-10 02:50:55,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:50:55,034 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 557 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:50:55,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 671 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:50:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-10 02:50:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 300. [2024-11-10 02:50:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.4548494983277591) internal successors, (435), 299 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 435 transitions. [2024-11-10 02:50:55,039 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 435 transitions. Word has length 112 [2024-11-10 02:50:55,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:50:55,040 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 435 transitions. [2024-11-10 02:50:55,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:55,040 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 435 transitions. [2024-11-10 02:50:55,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 02:50:55,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:50:55,041 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:50:55,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 02:50:55,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:50:55,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:50:55,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1115316867, now seen corresponding path program 1 times [2024-11-10 02:50:55,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:50:55,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616182917] [2024-11-10 02:50:55,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:50:55,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:50:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:50:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:50:55,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:50:55,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616182917] [2024-11-10 02:50:55,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616182917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:50:55,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:50:55,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:50:55,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234472908] [2024-11-10 02:50:55,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:50:55,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:50:55,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:50:55,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:50:55,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:50:55,564 INFO L87 Difference]: Start difference. First operand 300 states and 435 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:55,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:50:55,786 INFO L93 Difference]: Finished difference Result 485 states and 707 transitions. [2024-11-10 02:50:55,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:50:55,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-11-10 02:50:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:50:55,789 INFO L225 Difference]: With dead ends: 485 [2024-11-10 02:50:55,789 INFO L226 Difference]: Without dead ends: 327 [2024-11-10 02:50:55,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:50:55,793 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 576 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:50:55,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1108 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:50:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-10 02:50:55,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 303. [2024-11-10 02:50:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.4536423841059603) internal successors, (439), 302 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:55,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 439 transitions. [2024-11-10 02:50:55,803 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 439 transitions. Word has length 113 [2024-11-10 02:50:55,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:50:55,803 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 439 transitions. [2024-11-10 02:50:55,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:55,804 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 439 transitions. [2024-11-10 02:50:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-10 02:50:55,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:50:55,807 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:50:55,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 02:50:55,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:50:55,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:50:55,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1094481438, now seen corresponding path program 1 times [2024-11-10 02:50:55,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:50:55,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46987733] [2024-11-10 02:50:55,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:50:55,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:50:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:50:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:50:56,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:50:56,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46987733] [2024-11-10 02:50:56,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46987733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:50:56,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:50:56,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:50:56,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653433514] [2024-11-10 02:50:56,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:50:56,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:50:56,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:50:56,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:50:56,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:50:56,327 INFO L87 Difference]: Start difference. First operand 303 states and 439 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:50:56,481 INFO L93 Difference]: Finished difference Result 482 states and 702 transitions. [2024-11-10 02:50:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:50:56,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-10 02:50:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:50:56,483 INFO L225 Difference]: With dead ends: 482 [2024-11-10 02:50:56,483 INFO L226 Difference]: Without dead ends: 324 [2024-11-10 02:50:56,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:50:56,484 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 549 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:50:56,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 668 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:50:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-10 02:50:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2024-11-10 02:50:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 1.4517133956386292) internal successors, (466), 321 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 466 transitions. [2024-11-10 02:50:56,495 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 466 transitions. Word has length 114 [2024-11-10 02:50:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:50:56,495 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 466 transitions. [2024-11-10 02:50:56,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 466 transitions. [2024-11-10 02:50:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 02:50:56,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:50:56,497 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:50:56,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 02:50:56,497 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:50:56,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:50:56,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1612616713, now seen corresponding path program 1 times [2024-11-10 02:50:56,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:50:56,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813850013] [2024-11-10 02:50:56,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:50:56,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:50:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:50:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:50:57,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:50:57,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813850013] [2024-11-10 02:50:57,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813850013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:50:57,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:50:57,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:50:57,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929373480] [2024-11-10 02:50:57,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:50:57,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:50:57,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:50:57,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:50:57,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:50:57,015 INFO L87 Difference]: Start difference. First operand 322 states and 466 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 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-11-10 02:50:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:50:57,235 INFO L93 Difference]: Finished difference Result 487 states and 708 transitions. [2024-11-10 02:50:57,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:50:57,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 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-11-10 02:50:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:50:57,237 INFO L225 Difference]: With dead ends: 487 [2024-11-10 02:50:57,237 INFO L226 Difference]: Without dead ends: 329 [2024-11-10 02:50:57,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:50:57,238 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 557 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:50:57,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1105 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:50:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-10 02:50:57,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 325. [2024-11-10 02:50:57,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.4506172839506173) internal successors, (470), 324 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 470 transitions. [2024-11-10 02:50:57,244 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 470 transitions. Word has length 115 [2024-11-10 02:50:57,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:50:57,245 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 470 transitions. [2024-11-10 02:50:57,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 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-11-10 02:50:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 470 transitions. [2024-11-10 02:50:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 02:50:57,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:50:57,246 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:50:57,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 02:50:57,246 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:50:57,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:50:57,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1160395805, now seen corresponding path program 1 times [2024-11-10 02:50:57,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:50:57,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000972367] [2024-11-10 02:50:57,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:50:57,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:50:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:50:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:50:57,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:50:57,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000972367] [2024-11-10 02:50:57,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000972367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:50:57,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:50:57,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:50:57,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167534591] [2024-11-10 02:50:57,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:50:57,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:50:57,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:50:57,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:50:57,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:50:57,734 INFO L87 Difference]: Start difference. First operand 325 states and 470 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:50:57,934 INFO L93 Difference]: Finished difference Result 493 states and 716 transitions. [2024-11-10 02:50:57,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:50:57,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-10 02:50:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:50:57,936 INFO L225 Difference]: With dead ends: 493 [2024-11-10 02:50:57,936 INFO L226 Difference]: Without dead ends: 335 [2024-11-10 02:50:57,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 02:50:57,937 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 567 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:50:57,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 956 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:50:57,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-10 02:50:57,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2024-11-10 02:50:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.4484848484848485) internal successors, (478), 330 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 478 transitions. [2024-11-10 02:50:57,942 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 478 transitions. Word has length 116 [2024-11-10 02:50:57,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:50:57,942 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 478 transitions. [2024-11-10 02:50:57,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 478 transitions. [2024-11-10 02:50:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 02:50:57,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:50:57,956 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:50:57,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 02:50:57,956 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:50:57,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:50:57,956 INFO L85 PathProgramCache]: Analyzing trace with hash -229506514, now seen corresponding path program 1 times [2024-11-10 02:50:57,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:50:57,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753950320] [2024-11-10 02:50:57,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:50:57,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:50:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:50:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:50:58,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:50:58,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753950320] [2024-11-10 02:50:58,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753950320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:50:58,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:50:58,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:50:58,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912358653] [2024-11-10 02:50:58,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:50:58,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:50:58,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:50:58,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:50:58,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:50:58,406 INFO L87 Difference]: Start difference. First operand 331 states and 478 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:58,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:50:58,599 INFO L93 Difference]: Finished difference Result 514 states and 745 transitions. [2024-11-10 02:50:58,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:50:58,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-10 02:50:58,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:50:58,601 INFO L225 Difference]: With dead ends: 514 [2024-11-10 02:50:58,601 INFO L226 Difference]: Without dead ends: 329 [2024-11-10 02:50:58,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:50:58,602 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 554 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:50:58,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 672 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:50:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-10 02:50:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2024-11-10 02:50:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.4481707317073171) internal successors, (475), 328 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 475 transitions. [2024-11-10 02:50:58,609 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 475 transitions. Word has length 116 [2024-11-10 02:50:58,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:50:58,609 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 475 transitions. [2024-11-10 02:50:58,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:58,609 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 475 transitions. [2024-11-10 02:50:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 02:50:58,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:50:58,610 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:50:58,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 02:50:58,611 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:50:58,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:50:58,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1518332081, now seen corresponding path program 1 times [2024-11-10 02:50:58,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:50:58,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519316856] [2024-11-10 02:50:58,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:50:58,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:50:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:50:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:50:59,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:50:59,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519316856] [2024-11-10 02:50:59,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519316856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:50:59,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:50:59,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 02:50:59,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093176781] [2024-11-10 02:50:59,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:50:59,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 02:50:59,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:50:59,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 02:50:59,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:50:59,145 INFO L87 Difference]: Start difference. First operand 329 states and 475 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:59,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:50:59,336 INFO L93 Difference]: Finished difference Result 534 states and 773 transitions. [2024-11-10 02:50:59,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:50:59,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-10 02:50:59,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:50:59,338 INFO L225 Difference]: With dead ends: 534 [2024-11-10 02:50:59,338 INFO L226 Difference]: Without dead ends: 329 [2024-11-10 02:50:59,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:50:59,339 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 564 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:50:59,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 893 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:50:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-10 02:50:59,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2024-11-10 02:50:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.4451219512195121) internal successors, (474), 328 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 474 transitions. [2024-11-10 02:50:59,346 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 474 transitions. Word has length 116 [2024-11-10 02:50:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:50:59,346 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 474 transitions. [2024-11-10 02:50:59,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:50:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 474 transitions. [2024-11-10 02:50:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 02:50:59,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:50:59,347 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:50:59,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 02:50:59,347 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:50:59,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:50:59,348 INFO L85 PathProgramCache]: Analyzing trace with hash 800179508, now seen corresponding path program 1 times [2024-11-10 02:50:59,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:50:59,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469124772] [2024-11-10 02:50:59,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:50:59,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:50:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:00,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469124772] [2024-11-10 02:51:00,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469124772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:00,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2605077] [2024-11-10 02:51:00,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:00,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:00,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:51:00,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 02:51:00,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 02:51:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:00,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-10 02:51:00,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:51:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:01,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:51:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:01,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2605077] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:51:01,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 02:51:01,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2024-11-10 02:51:01,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563945494] [2024-11-10 02:51:01,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 02:51:01,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 02:51:01,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:01,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 02:51:01,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2024-11-10 02:51:01,909 INFO L87 Difference]: Start difference. First operand 329 states and 474 transitions. Second operand has 28 states, 28 states have (on average 12.035714285714286) internal successors, (337), 28 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:02,999 INFO L93 Difference]: Finished difference Result 878 states and 1268 transitions. [2024-11-10 02:51:02,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 02:51:02,999 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 12.035714285714286) internal successors, (337), 28 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-11-10 02:51:03,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:03,001 INFO L225 Difference]: With dead ends: 878 [2024-11-10 02:51:03,001 INFO L226 Difference]: Without dead ends: 600 [2024-11-10 02:51:03,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2024-11-10 02:51:03,003 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 1389 mSDsluCounter, 4949 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 5287 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:03,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 5287 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2168 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 02:51:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-10 02:51:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 471. [2024-11-10 02:51:03,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 1.4340425531914893) internal successors, (674), 470 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 674 transitions. [2024-11-10 02:51:03,012 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 674 transitions. Word has length 117 [2024-11-10 02:51:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:03,012 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 674 transitions. [2024-11-10 02:51:03,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 12.035714285714286) internal successors, (337), 28 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 674 transitions. [2024-11-10 02:51:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 02:51:03,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:03,014 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:03,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 02:51:03,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-10 02:51:03,218 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:03,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:03,218 INFO L85 PathProgramCache]: Analyzing trace with hash 989962697, now seen corresponding path program 1 times [2024-11-10 02:51:03,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:03,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32000884] [2024-11-10 02:51:03,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:03,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:03,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:03,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32000884] [2024-11-10 02:51:03,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32000884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:03,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:03,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:51:03,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554325348] [2024-11-10 02:51:03,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:03,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:51:03,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:03,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:51:03,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:51:03,499 INFO L87 Difference]: Start difference. First operand 471 states and 674 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:03,638 INFO L93 Difference]: Finished difference Result 750 states and 1076 transitions. [2024-11-10 02:51:03,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:03,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-11-10 02:51:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:03,640 INFO L225 Difference]: With dead ends: 750 [2024-11-10 02:51:03,640 INFO L226 Difference]: Without dead ends: 470 [2024-11-10 02:51:03,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:03,641 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 616 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:03,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 680 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:51:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-10 02:51:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2024-11-10 02:51:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 1.430406852248394) internal successors, (668), 467 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 668 transitions. [2024-11-10 02:51:03,656 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 668 transitions. Word has length 118 [2024-11-10 02:51:03,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:03,656 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 668 transitions. [2024-11-10 02:51:03,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:03,656 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 668 transitions. [2024-11-10 02:51:03,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 02:51:03,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:03,657 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:03,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 02:51:03,658 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:03,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:03,658 INFO L85 PathProgramCache]: Analyzing trace with hash 275034606, now seen corresponding path program 1 times [2024-11-10 02:51:03,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:03,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742213334] [2024-11-10 02:51:03,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:03,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:03,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:03,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:03,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742213334] [2024-11-10 02:51:03,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742213334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:03,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:03,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 02:51:03,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932548269] [2024-11-10 02:51:03,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:03,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 02:51:03,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:03,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 02:51:03,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:51:03,879 INFO L87 Difference]: Start difference. First operand 468 states and 668 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:04,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:04,048 INFO L93 Difference]: Finished difference Result 626 states and 900 transitions. [2024-11-10 02:51:04,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:51:04,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-11-10 02:51:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:04,049 INFO L225 Difference]: With dead ends: 626 [2024-11-10 02:51:04,049 INFO L226 Difference]: Without dead ends: 345 [2024-11-10 02:51:04,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:51:04,050 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 598 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:04,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 898 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:51:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-10 02:51:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2024-11-10 02:51:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.436046511627907) internal successors, (494), 344 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 494 transitions. [2024-11-10 02:51:04,057 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 494 transitions. Word has length 118 [2024-11-10 02:51:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:04,057 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 494 transitions. [2024-11-10 02:51:04,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 494 transitions. [2024-11-10 02:51:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 02:51:04,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:04,059 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:04,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 02:51:04,059 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:04,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:04,059 INFO L85 PathProgramCache]: Analyzing trace with hash 883160026, now seen corresponding path program 1 times [2024-11-10 02:51:04,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:04,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257087630] [2024-11-10 02:51:04,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:04,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 43 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:06,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:06,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257087630] [2024-11-10 02:51:06,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257087630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:06,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907826511] [2024-11-10 02:51:06,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:06,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:06,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:51:06,922 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 02:51:06,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 02:51:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:07,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-10 02:51:07,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:51:08,266 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 43 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:08,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:51:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 43 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:09,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907826511] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:51:09,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 02:51:09,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2024-11-10 02:51:09,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619670655] [2024-11-10 02:51:09,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 02:51:09,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-10 02:51:09,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:09,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-10 02:51:09,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1329, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 02:51:09,609 INFO L87 Difference]: Start difference. First operand 345 states and 494 transitions. Second operand has 39 states, 39 states have (on average 13.692307692307692) internal successors, (534), 39 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:15,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:15,166 INFO L93 Difference]: Finished difference Result 2768 states and 4023 transitions. [2024-11-10 02:51:15,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2024-11-10 02:51:15,167 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 13.692307692307692) internal successors, (534), 39 states have internal predecessors, (534), 0 states have call successors, (0), 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 194 [2024-11-10 02:51:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:15,174 INFO L225 Difference]: With dead ends: 2768 [2024-11-10 02:51:15,174 INFO L226 Difference]: Without dead ends: 2610 [2024-11-10 02:51:15,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2927, Invalid=18243, Unknown=0, NotChecked=0, Total=21170 [2024-11-10 02:51:15,179 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 23551 mSDsluCounter, 6694 mSDsCounter, 0 mSdLazyCounter, 3682 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23551 SdHoareTripleChecker+Valid, 6987 SdHoareTripleChecker+Invalid, 3743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:15,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23551 Valid, 6987 Invalid, 3743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3682 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 02:51:15,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2024-11-10 02:51:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 1238. [2024-11-10 02:51:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1237 states have (on average 1.4308811641067098) internal successors, (1770), 1237 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1770 transitions. [2024-11-10 02:51:15,212 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1770 transitions. Word has length 194 [2024-11-10 02:51:15,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:15,212 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1770 transitions. [2024-11-10 02:51:15,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 13.692307692307692) internal successors, (534), 39 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1770 transitions. [2024-11-10 02:51:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-10 02:51:15,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:15,216 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:15,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 02:51:15,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 02:51:15,419 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:15,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1902763325, now seen corresponding path program 1 times [2024-11-10 02:51:15,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:15,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933619152] [2024-11-10 02:51:15,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:15,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:18,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:18,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933619152] [2024-11-10 02:51:18,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933619152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:18,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305537034] [2024-11-10 02:51:18,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:18,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:18,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:51:18,165 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 02:51:18,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 02:51:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:18,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-10 02:51:18,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:51:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:18,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:51:19,890 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:19,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305537034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:51:19,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 02:51:19,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 11] total 32 [2024-11-10 02:51:19,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656868389] [2024-11-10 02:51:19,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 02:51:19,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 02:51:19,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:19,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 02:51:19,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-11-10 02:51:19,892 INFO L87 Difference]: Start difference. First operand 1238 states and 1770 transitions. Second operand has 32 states, 32 states have (on average 17.09375) internal successors, (547), 32 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:23,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:23,135 INFO L93 Difference]: Finished difference Result 2604 states and 3761 transitions. [2024-11-10 02:51:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-10 02:51:23,136 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 17.09375) internal successors, (547), 32 states have internal predecessors, (547), 0 states have call successors, (0), 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 195 [2024-11-10 02:51:23,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:23,142 INFO L225 Difference]: With dead ends: 2604 [2024-11-10 02:51:23,142 INFO L226 Difference]: Without dead ends: 2242 [2024-11-10 02:51:23,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1967 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1250, Invalid=6760, Unknown=0, NotChecked=0, Total=8010 [2024-11-10 02:51:23,146 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 12772 mSDsluCounter, 4911 mSDsCounter, 0 mSdLazyCounter, 2589 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12772 SdHoareTripleChecker+Valid, 5212 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:23,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12772 Valid, 5212 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2589 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 02:51:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2024-11-10 02:51:23,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 1337. [2024-11-10 02:51:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 1336 states have (on average 1.4341317365269461) internal successors, (1916), 1336 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1916 transitions. [2024-11-10 02:51:23,173 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1916 transitions. Word has length 195 [2024-11-10 02:51:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:23,174 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 1916 transitions. [2024-11-10 02:51:23,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 17.09375) internal successors, (547), 32 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1916 transitions. [2024-11-10 02:51:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 02:51:23,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:23,176 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:23,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 02:51:23,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 02:51:23,378 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:23,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:23,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1449724479, now seen corresponding path program 1 times [2024-11-10 02:51:23,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:23,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533945485] [2024-11-10 02:51:23,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:23,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 02:51:24,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:24,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533945485] [2024-11-10 02:51:24,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533945485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:24,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:24,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 02:51:24,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909738857] [2024-11-10 02:51:24,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:24,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:51:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:24,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:51:24,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 02:51:24,641 INFO L87 Difference]: Start difference. First operand 1337 states and 1916 transitions. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:24,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:24,867 INFO L93 Difference]: Finished difference Result 2343 states and 3400 transitions. [2024-11-10 02:51:24,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:51:24,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2024-11-10 02:51:24,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:24,873 INFO L225 Difference]: With dead ends: 2343 [2024-11-10 02:51:24,873 INFO L226 Difference]: Without dead ends: 1962 [2024-11-10 02:51:24,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:51:24,875 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 129 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:24,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1242 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:51:24,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2024-11-10 02:51:24,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1914. [2024-11-10 02:51:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.446941975953999) internal successors, (2768), 1913 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2768 transitions. [2024-11-10 02:51:24,904 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2768 transitions. Word has length 196 [2024-11-10 02:51:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:24,905 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2768 transitions. [2024-11-10 02:51:24,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:24,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2768 transitions. [2024-11-10 02:51:24,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 02:51:24,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:24,909 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:24,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 02:51:24,909 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:24,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:24,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1687976362, now seen corresponding path program 1 times [2024-11-10 02:51:24,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:24,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025124103] [2024-11-10 02:51:24,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:24,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:26,044 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 74 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:26,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:26,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025124103] [2024-11-10 02:51:26,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025124103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:26,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341406487] [2024-11-10 02:51:26,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:26,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:26,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:51:26,047 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 02:51:26,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 02:51:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:26,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 02:51:26,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:51:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:26,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:51:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 61 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:27,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341406487] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:51:27,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 02:51:27,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 25 [2024-11-10 02:51:27,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312597029] [2024-11-10 02:51:27,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 02:51:27,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 02:51:27,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:27,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 02:51:27,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-11-10 02:51:27,536 INFO L87 Difference]: Start difference. First operand 1914 states and 2768 transitions. Second operand has 25 states, 25 states have (on average 20.88) internal successors, (522), 25 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:28,571 INFO L93 Difference]: Finished difference Result 3136 states and 4567 transitions. [2024-11-10 02:51:28,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 02:51:28,571 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 20.88) internal successors, (522), 25 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2024-11-10 02:51:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:28,579 INFO L225 Difference]: With dead ends: 3136 [2024-11-10 02:51:28,579 INFO L226 Difference]: Without dead ends: 1947 [2024-11-10 02:51:28,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 376 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=426, Invalid=1830, Unknown=0, NotChecked=0, Total=2256 [2024-11-10 02:51:28,583 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 3987 mSDsluCounter, 3264 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3987 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:28,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3987 Valid, 3574 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 02:51:28,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2024-11-10 02:51:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1766. [2024-11-10 02:51:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1765 states have (on average 1.43342776203966) internal successors, (2530), 1765 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2530 transitions. [2024-11-10 02:51:28,619 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2530 transitions. Word has length 196 [2024-11-10 02:51:28,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:28,619 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2530 transitions. [2024-11-10 02:51:28,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 20.88) internal successors, (522), 25 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2530 transitions. [2024-11-10 02:51:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-10 02:51:28,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:28,622 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:28,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 02:51:28,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:28,823 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:28,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1423784478, now seen corresponding path program 1 times [2024-11-10 02:51:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:28,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783264710] [2024-11-10 02:51:28,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:28,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:30,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:30,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783264710] [2024-11-10 02:51:30,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783264710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:30,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490108212] [2024-11-10 02:51:30,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:30,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:30,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:51:30,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 02:51:30,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 02:51:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:31,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 02:51:31,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:51:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-10 02:51:31,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 02:51:31,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490108212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:31,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 02:51:31,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2024-11-10 02:51:31,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667844772] [2024-11-10 02:51:31,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:31,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:51:31,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:31,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:51:31,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-11-10 02:51:31,355 INFO L87 Difference]: Start difference. First operand 1766 states and 2530 transitions. Second operand has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:31,514 INFO L93 Difference]: Finished difference Result 3177 states and 4586 transitions. [2024-11-10 02:51:31,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 02:51:31,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2024-11-10 02:51:31,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:31,521 INFO L225 Difference]: With dead ends: 3177 [2024-11-10 02:51:31,521 INFO L226 Difference]: Without dead ends: 2546 [2024-11-10 02:51:31,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-10 02:51:31,523 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 149 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:31,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1003 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:51:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2024-11-10 02:51:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2186. [2024-11-10 02:51:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2186 states, 2185 states have (on average 1.4379862700228834) internal successors, (3142), 2185 states have internal predecessors, (3142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 3142 transitions. [2024-11-10 02:51:31,574 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 3142 transitions. Word has length 197 [2024-11-10 02:51:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:31,575 INFO L471 AbstractCegarLoop]: Abstraction has 2186 states and 3142 transitions. [2024-11-10 02:51:31,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.571428571428573) internal successors, (165), 7 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 3142 transitions. [2024-11-10 02:51:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 02:51:31,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:31,578 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:31,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 02:51:31,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:31,778 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:31,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:31,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1925518515, now seen corresponding path program 1 times [2024-11-10 02:51:31,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:31,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523375202] [2024-11-10 02:51:31,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:31,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 64 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 02:51:33,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:33,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523375202] [2024-11-10 02:51:33,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523375202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:33,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069752472] [2024-11-10 02:51:33,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:33,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:33,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:51:33,301 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 02:51:33,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 02:51:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:33,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-10 02:51:33,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:51:34,539 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:34,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:51:35,069 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-10 02:51:35,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069752472] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:35,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 02:51:35,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [11, 22] total 43 [2024-11-10 02:51:35,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793385062] [2024-11-10 02:51:35,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:35,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 02:51:35,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:35,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 02:51:35,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1544, Unknown=0, NotChecked=0, Total=1806 [2024-11-10 02:51:35,070 INFO L87 Difference]: Start difference. First operand 2186 states and 3142 transitions. Second operand has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:35,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:35,676 INFO L93 Difference]: Finished difference Result 4395 states and 6378 transitions. [2024-11-10 02:51:35,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 02:51:35,676 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 0 states have call successors, (0), 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 198 [2024-11-10 02:51:35,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:35,683 INFO L225 Difference]: With dead ends: 4395 [2024-11-10 02:51:35,683 INFO L226 Difference]: Without dead ends: 2600 [2024-11-10 02:51:35,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=316, Invalid=1754, Unknown=0, NotChecked=0, Total=2070 [2024-11-10 02:51:35,687 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 1143 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:35,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 2064 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 02:51:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2024-11-10 02:51:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2536. [2024-11-10 02:51:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2535 states have (on average 1.4406311637080869) internal successors, (3652), 2535 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3652 transitions. [2024-11-10 02:51:35,753 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3652 transitions. Word has length 198 [2024-11-10 02:51:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:35,753 INFO L471 AbstractCegarLoop]: Abstraction has 2536 states and 3652 transitions. [2024-11-10 02:51:35,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3652 transitions. [2024-11-10 02:51:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 02:51:35,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:35,758 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:35,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 02:51:35,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:35,960 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:35,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:35,962 INFO L85 PathProgramCache]: Analyzing trace with hash -456581124, now seen corresponding path program 1 times [2024-11-10 02:51:35,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:35,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083106930] [2024-11-10 02:51:35,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:35,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:37,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:37,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083106930] [2024-11-10 02:51:37,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083106930] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:37,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514380340] [2024-11-10 02:51:37,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:37,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:37,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:51:37,014 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 02:51:37,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 02:51:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:37,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-10 02:51:37,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:51:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:38,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:51:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 02:51:38,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514380340] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:38,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 02:51:38,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10, 17] total 33 [2024-11-10 02:51:38,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405141112] [2024-11-10 02:51:38,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:38,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 02:51:38,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:38,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 02:51:38,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 02:51:38,441 INFO L87 Difference]: Start difference. First operand 2536 states and 3652 transitions. Second operand has 10 states, 10 states have (on average 18.4) internal successors, (184), 10 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:38,969 INFO L93 Difference]: Finished difference Result 7369 states and 10652 transitions. [2024-11-10 02:51:38,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 02:51:38,969 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.4) internal successors, (184), 10 states have internal predecessors, (184), 0 states have call successors, (0), 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 198 [2024-11-10 02:51:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:38,977 INFO L225 Difference]: With dead ends: 7369 [2024-11-10 02:51:38,978 INFO L226 Difference]: Without dead ends: 3281 [2024-11-10 02:51:38,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=1178, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 02:51:38,982 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 998 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:38,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1889 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 02:51:38,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2024-11-10 02:51:39,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 3139. [2024-11-10 02:51:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3139 states, 3138 states have (on average 1.438495857233907) internal successors, (4514), 3138 states have internal predecessors, (4514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 4514 transitions. [2024-11-10 02:51:39,023 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 4514 transitions. Word has length 198 [2024-11-10 02:51:39,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:39,023 INFO L471 AbstractCegarLoop]: Abstraction has 3139 states and 4514 transitions. [2024-11-10 02:51:39,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.4) internal successors, (184), 10 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 4514 transitions. [2024-11-10 02:51:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 02:51:39,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:39,027 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:39,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 02:51:39,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:39,228 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:39,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:39,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1026397435, now seen corresponding path program 1 times [2024-11-10 02:51:39,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:39,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027465220] [2024-11-10 02:51:39,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:40,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:40,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027465220] [2024-11-10 02:51:40,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027465220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:40,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232927343] [2024-11-10 02:51:40,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:40,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:40,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:51:40,341 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 02:51:40,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 02:51:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:40,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-10 02:51:40,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:51:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 70 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:41,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:51:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 02:51:41,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232927343] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:41,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 02:51:41,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 13] total 26 [2024-11-10 02:51:41,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044386418] [2024-11-10 02:51:41,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:41,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 02:51:41,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:41,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 02:51:41,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2024-11-10 02:51:41,491 INFO L87 Difference]: Start difference. First operand 3139 states and 4514 transitions. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:41,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:41,739 INFO L93 Difference]: Finished difference Result 9491 states and 13708 transitions. [2024-11-10 02:51:41,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:51:41,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 0 states have call successors, (0), 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 198 [2024-11-10 02:51:41,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:41,749 INFO L225 Difference]: With dead ends: 9491 [2024-11-10 02:51:41,750 INFO L226 Difference]: Without dead ends: 4238 [2024-11-10 02:51:41,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 380 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2024-11-10 02:51:41,755 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 498 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:41,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1150 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:51:41,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4238 states. [2024-11-10 02:51:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4238 to 3499. [2024-11-10 02:51:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3499 states, 3498 states have (on average 1.4391080617495713) internal successors, (5034), 3498 states have internal predecessors, (5034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 5034 transitions. [2024-11-10 02:51:41,812 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 5034 transitions. Word has length 198 [2024-11-10 02:51:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:41,812 INFO L471 AbstractCegarLoop]: Abstraction has 3499 states and 5034 transitions. [2024-11-10 02:51:41,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 5034 transitions. [2024-11-10 02:51:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 02:51:41,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:41,817 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:41,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 02:51:42,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 02:51:42,018 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:42,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:42,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1334289150, now seen corresponding path program 1 times [2024-11-10 02:51:42,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:42,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16610938] [2024-11-10 02:51:42,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:42,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-10 02:51:42,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:42,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16610938] [2024-11-10 02:51:42,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16610938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:42,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:51:42,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 02:51:42,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610248299] [2024-11-10 02:51:42,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:42,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:51:42,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:42,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:51:42,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:51:42,836 INFO L87 Difference]: Start difference. First operand 3499 states and 5034 transitions. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:43,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:43,034 INFO L93 Difference]: Finished difference Result 10160 states and 14660 transitions. [2024-11-10 02:51:43,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 02:51:43,034 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2024-11-10 02:51:43,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:43,045 INFO L225 Difference]: With dead ends: 10160 [2024-11-10 02:51:43,045 INFO L226 Difference]: Without dead ends: 7877 [2024-11-10 02:51:43,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 02:51:43,049 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 656 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:43,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1612 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 02:51:43,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7877 states. [2024-11-10 02:51:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7877 to 3531. [2024-11-10 02:51:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3531 states, 3530 states have (on average 1.4359773371104816) internal successors, (5069), 3530 states have internal predecessors, (5069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3531 states to 3531 states and 5069 transitions. [2024-11-10 02:51:43,115 INFO L78 Accepts]: Start accepts. Automaton has 3531 states and 5069 transitions. Word has length 198 [2024-11-10 02:51:43,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:43,115 INFO L471 AbstractCegarLoop]: Abstraction has 3531 states and 5069 transitions. [2024-11-10 02:51:43,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:43,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3531 states and 5069 transitions. [2024-11-10 02:51:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 02:51:43,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:43,121 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:43,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 02:51:43,121 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:43,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:43,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1488579727, now seen corresponding path program 1 times [2024-11-10 02:51:43,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:43,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842454456] [2024-11-10 02:51:43,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:43,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 71 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:44,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:44,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842454456] [2024-11-10 02:51:44,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842454456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:44,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310629774] [2024-11-10 02:51:44,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:44,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:44,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:51:44,539 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 02:51:44,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 02:51:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:45,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-10 02:51:45,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:51:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 71 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:45,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:51:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 65 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:47,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310629774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:51:47,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 02:51:47,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 16] total 36 [2024-11-10 02:51:47,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633718053] [2024-11-10 02:51:47,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 02:51:47,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-10 02:51:47,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:47,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-10 02:51:47,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1090, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 02:51:47,030 INFO L87 Difference]: Start difference. First operand 3531 states and 5069 transitions. Second operand has 36 states, 36 states have (on average 14.416666666666666) internal successors, (519), 36 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:48,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:48,287 INFO L93 Difference]: Finished difference Result 6782 states and 9809 transitions. [2024-11-10 02:51:48,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 02:51:48,288 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 14.416666666666666) internal successors, (519), 36 states have internal predecessors, (519), 0 states have call successors, (0), 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 198 [2024-11-10 02:51:48,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:48,295 INFO L225 Difference]: With dead ends: 6782 [2024-11-10 02:51:48,295 INFO L226 Difference]: Without dead ends: 5009 [2024-11-10 02:51:48,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=291, Invalid=1965, Unknown=0, NotChecked=0, Total=2256 [2024-11-10 02:51:48,299 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 1196 mSDsluCounter, 5487 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 5937 SdHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:48,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 5937 Invalid, 2585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2574 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 02:51:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5009 states. [2024-11-10 02:51:48,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5009 to 4033. [2024-11-10 02:51:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4033 states, 4032 states have (on average 1.4293154761904763) internal successors, (5763), 4032 states have internal predecessors, (5763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 4033 states and 5763 transitions. [2024-11-10 02:51:48,346 INFO L78 Accepts]: Start accepts. Automaton has 4033 states and 5763 transitions. Word has length 198 [2024-11-10 02:51:48,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:48,347 INFO L471 AbstractCegarLoop]: Abstraction has 4033 states and 5763 transitions. [2024-11-10 02:51:48,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 14.416666666666666) internal successors, (519), 36 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:48,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4033 states and 5763 transitions. [2024-11-10 02:51:48,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 02:51:48,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:48,353 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:48,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 02:51:48,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-10 02:51:48,553 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:48,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:48,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1147613863, now seen corresponding path program 1 times [2024-11-10 02:51:48,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:48,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085218451] [2024-11-10 02:51:48,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:48,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 19 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 02:51:49,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:49,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085218451] [2024-11-10 02:51:49,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085218451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:49,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365460106] [2024-11-10 02:51:49,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:49,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:49,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:51:49,583 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 02:51:49,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 02:51:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:50,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 123 conjuncts are in the unsatisfiable core [2024-11-10 02:51:50,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:51:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-10 02:51:50,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 02:51:50,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365460106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:51:50,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 02:51:50,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [8] total 26 [2024-11-10 02:51:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820764363] [2024-11-10 02:51:50,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:51:50,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 02:51:50,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:50,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 02:51:50,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2024-11-10 02:51:50,807 INFO L87 Difference]: Start difference. First operand 4033 states and 5763 transitions. Second operand has 20 states, 20 states have (on average 8.35) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:51:51,734 INFO L93 Difference]: Finished difference Result 6020 states and 8667 transitions. [2024-11-10 02:51:51,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 02:51:51,735 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.35) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 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 199 [2024-11-10 02:51:51,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:51:51,741 INFO L225 Difference]: With dead ends: 6020 [2024-11-10 02:51:51,741 INFO L226 Difference]: Without dead ends: 4643 [2024-11-10 02:51:51,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 02:51:51,745 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 156 mSDsluCounter, 2899 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 3150 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 02:51:51,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 3150 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 02:51:51,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4643 states. [2024-11-10 02:51:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4643 to 4014. [2024-11-10 02:51:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4014 states, 4013 states have (on average 1.4273610765013705) internal successors, (5728), 4013 states have internal predecessors, (5728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:51,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4014 states to 4014 states and 5728 transitions. [2024-11-10 02:51:51,792 INFO L78 Accepts]: Start accepts. Automaton has 4014 states and 5728 transitions. Word has length 199 [2024-11-10 02:51:51,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:51:51,793 INFO L471 AbstractCegarLoop]: Abstraction has 4014 states and 5728 transitions. [2024-11-10 02:51:51,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.35) internal successors, (167), 20 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 02:51:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 4014 states and 5728 transitions. [2024-11-10 02:51:51,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 02:51:51,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:51:51,798 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:51:51,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-10 02:51:51,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-10 02:51:51,999 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:51:51,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:51:51,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1757451114, now seen corresponding path program 1 times [2024-11-10 02:51:51,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:51:51,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104599583] [2024-11-10 02:51:51,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:51,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:51:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:53,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:51:53,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104599583] [2024-11-10 02:51:53,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104599583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 02:51:53,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790543153] [2024-11-10 02:51:53,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:51:53,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 02:51:53,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:51:53,238 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 02:51:53,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 02:51:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:51:53,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 156 conjuncts are in the unsatisfiable core [2024-11-10 02:51:53,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:51:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 8 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:55,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:51:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 8 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 02:51:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790543153] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:51:57,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 02:51:57,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 29, 24] total 59 [2024-11-10 02:51:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994970628] [2024-11-10 02:51:57,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 02:51:57,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-10 02:51:57,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:51:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-10 02:51:57,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=2905, Unknown=0, NotChecked=0, Total=3422 [2024-11-10 02:51:57,918 INFO L87 Difference]: Start difference. First operand 4014 states and 5728 transitions. Second operand has 59 states, 59 states have (on average 9.88135593220339) internal successors, (583), 59 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)