./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d2ad25966f5b06d930031b35708c7035a644982dad73f08910281a8c7df501a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:38:46,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:38:46,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:38:46,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:38:46,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:38:46,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:38:46,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:38:46,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:38:46,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:38:46,941 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:38:46,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:38:46,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:38:46,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:38:46,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:38:46,946 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:38:46,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:38:46,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:38:46,947 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:38:46,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:38:46,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:38:46,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:38:46,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:38:46,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:38:46,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:38:46,951 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:38:46,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:38:46,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:38:46,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:38:46,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:38:46,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:38:46,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:38:46,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:38:46,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:38:46,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:38:46,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:38:46,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:38:46,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:38:46,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:38:46,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:38:46,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:38:46,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:38:46,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:38:46,954 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d2ad25966f5b06d930031b35708c7035a644982dad73f08910281a8c7df501a [2024-10-11 03:38:47,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:38:47,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:38:47,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:38:47,257 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:38:47,260 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:38:47,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-11 03:38:48,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:38:49,116 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:38:49,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-11 03:38:49,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f5205563f/adb300a2c4b74a409522579ee216ab5e/FLAGaf1bbce30 [2024-10-11 03:38:49,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f5205563f/adb300a2c4b74a409522579ee216ab5e [2024-10-11 03:38:49,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:38:49,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:38:49,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:38:49,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:38:49,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:38:49,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:38:49" (1/1) ... [2024-10-11 03:38:49,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@367d0832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:38:49, skipping insertion in model container [2024-10-11 03:38:49,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:38:49" (1/1) ... [2024-10-11 03:38:49,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:38:49,862 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2024-10-11 03:38:49,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:38:49,899 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:38:49,929 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2024-10-11 03:38:49,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:38:49,958 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:38:49,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:38:49 WrapperNode [2024-10-11 03:38:49,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:38:49,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:38:49,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:38:49,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:38:49,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:38:49" (1/1) ... [2024-10-11 03:38:50,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:38:49" (1/1) ... [2024-10-11 03:38:50,067 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 353 [2024-10-11 03:38:50,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:38:50,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:38:50,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:38:50,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:38:50,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:38:49" (1/1) ... [2024-10-11 03:38:50,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:38:49" (1/1) ... [2024-10-11 03:38:50,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:38:49" (1/1) ... [2024-10-11 03:38:50,107 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:38:50,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:38:49" (1/1) ... [2024-10-11 03:38:50,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:38:49" (1/1) ... [2024-10-11 03:38:50,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:38:49" (1/1) ... [2024-10-11 03:38:50,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:38:49" (1/1) ... [2024-10-11 03:38:50,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:38:49" (1/1) ... [2024-10-11 03:38:50,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:38:49" (1/1) ... [2024-10-11 03:38:50,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:38:50,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:38:50,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:38:50,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:38:50,121 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:38:49" (1/1) ... [2024-10-11 03:38:50,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:38:50,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:38:50,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:38:50,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:38:50,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:38:50,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:38:50,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:38:50,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:38:50,310 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:38:50,315 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:38:50,664 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-11 03:38:50,664 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:38:50,701 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:38:50,702 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:38:50,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:38:50 BoogieIcfgContainer [2024-10-11 03:38:50,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:38:50,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:38:50,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:38:50,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:38:50,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:38:49" (1/3) ... [2024-10-11 03:38:50,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58764f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:38:50, skipping insertion in model container [2024-10-11 03:38:50,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:38:49" (2/3) ... [2024-10-11 03:38:50,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58764f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:38:50, skipping insertion in model container [2024-10-11 03:38:50,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:38:50" (3/3) ... [2024-10-11 03:38:50,711 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-10-11 03:38:50,725 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:38:50,725 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:38:50,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:38:50,788 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;@425e55c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:38:50,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:38:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 76 states have (on average 1.7105263157894737) internal successors, (130), 77 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:50,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 03:38:50,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:38:50,805 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:38:50,806 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:38:50,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:38:50,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2064705082, now seen corresponding path program 1 times [2024-10-11 03:38:50,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:38:50,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821074255] [2024-10-11 03:38:50,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:38:50,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:38:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:38:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:38:51,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:38:51,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821074255] [2024-10-11 03:38:51,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821074255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:38:51,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:38:51,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:38:51,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231852584] [2024-10-11 03:38:51,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:38:51,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:38:51,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:38:51,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:38:51,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:38:51,176 INFO L87 Difference]: Start difference. First operand has 78 states, 76 states have (on average 1.7105263157894737) internal successors, (130), 77 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:38:51,270 INFO L93 Difference]: Finished difference Result 180 states and 290 transitions. [2024-10-11 03:38:51,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:38:51,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-10-11 03:38:51,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:38:51,279 INFO L225 Difference]: With dead ends: 180 [2024-10-11 03:38:51,279 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 03:38:51,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:38:51,286 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 84 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:38:51,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 255 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:38:51,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 03:38:51,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2024-10-11 03:38:51,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5) internal successors, (171), 114 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2024-10-11 03:38:51,320 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 36 [2024-10-11 03:38:51,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:38:51,321 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2024-10-11 03:38:51,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:51,321 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2024-10-11 03:38:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 03:38:51,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:38:51,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:38:51,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:38:51,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:38:51,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:38:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2100240699, now seen corresponding path program 1 times [2024-10-11 03:38:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:38:51,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383014969] [2024-10-11 03:38:51,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:38:51,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:38:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:38:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:38:51,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:38:51,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383014969] [2024-10-11 03:38:51,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383014969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:38:51,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:38:51,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:38:51,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305254692] [2024-10-11 03:38:51,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:38:51,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:38:51,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:38:51,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:38:51,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:38:51,411 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:38:51,431 INFO L93 Difference]: Finished difference Result 275 states and 423 transitions. [2024-10-11 03:38:51,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:38:51,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-10-11 03:38:51,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:38:51,432 INFO L225 Difference]: With dead ends: 275 [2024-10-11 03:38:51,432 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 03:38:51,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:38:51,434 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 69 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:38:51,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 211 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:38:51,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 03:38:51,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2024-10-11 03:38:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.5227272727272727) internal successors, (268), 176 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 268 transitions. [2024-10-11 03:38:51,446 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 268 transitions. Word has length 37 [2024-10-11 03:38:51,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:38:51,446 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 268 transitions. [2024-10-11 03:38:51,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:51,446 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 268 transitions. [2024-10-11 03:38:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 03:38:51,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:38:51,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:38:51,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:38:51,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:38:51,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:38:51,450 INFO L85 PathProgramCache]: Analyzing trace with hash -923316447, now seen corresponding path program 1 times [2024-10-11 03:38:51,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:38:51,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851923394] [2024-10-11 03:38:51,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:38:51,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:38:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:38:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:38:51,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:38:51,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851923394] [2024-10-11 03:38:51,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851923394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:38:51,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:38:51,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:38:51,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132592291] [2024-10-11 03:38:51,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:38:51,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:38:51,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:38:51,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:38:51,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:38:51,593 INFO L87 Difference]: Start difference. First operand 177 states and 268 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:38:51,726 INFO L93 Difference]: Finished difference Result 809 states and 1264 transitions. [2024-10-11 03:38:51,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:38:51,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-11 03:38:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:38:51,734 INFO L225 Difference]: With dead ends: 809 [2024-10-11 03:38:51,734 INFO L226 Difference]: Without dead ends: 651 [2024-10-11 03:38:51,735 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-10-11 03:38:51,740 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 447 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:38:51,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 618 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:38:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2024-10-11 03:38:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 333. [2024-10-11 03:38:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.5301204819277108) internal successors, (508), 332 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 508 transitions. [2024-10-11 03:38:51,782 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 508 transitions. Word has length 38 [2024-10-11 03:38:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:38:51,782 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 508 transitions. [2024-10-11 03:38:51,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 508 transitions. [2024-10-11 03:38:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 03:38:51,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:38:51,784 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:38:51,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:38:51,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:38:51,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:38:51,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1422504898, now seen corresponding path program 1 times [2024-10-11 03:38:51,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:38:51,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321881154] [2024-10-11 03:38:51,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:38:51,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:38:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:38:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:38:51,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:38:51,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321881154] [2024-10-11 03:38:51,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321881154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:38:51,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:38:51,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:38:51,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823836395] [2024-10-11 03:38:51,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:38:51,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:38:51,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:38:51,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:38:51,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:38:51,962 INFO L87 Difference]: Start difference. First operand 333 states and 508 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:52,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:38:52,028 INFO L93 Difference]: Finished difference Result 1163 states and 1791 transitions. [2024-10-11 03:38:52,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:38:52,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-10-11 03:38:52,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:38:52,034 INFO L225 Difference]: With dead ends: 1163 [2024-10-11 03:38:52,034 INFO L226 Difference]: Without dead ends: 849 [2024-10-11 03:38:52,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:38:52,040 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 218 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:38:52,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 333 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:38:52,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-10-11 03:38:52,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 845. [2024-10-11 03:38:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.5308056872037914) internal successors, (1292), 844 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1292 transitions. [2024-10-11 03:38:52,071 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1292 transitions. Word has length 39 [2024-10-11 03:38:52,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:38:52,073 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1292 transitions. [2024-10-11 03:38:52,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1292 transitions. [2024-10-11 03:38:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 03:38:52,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:38:52,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:38:52,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:38:52,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:38:52,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:38:52,078 INFO L85 PathProgramCache]: Analyzing trace with hash -998517633, now seen corresponding path program 1 times [2024-10-11 03:38:52,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:38:52,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083891473] [2024-10-11 03:38:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:38:52,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:38:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:38:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:38:52,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:38:52,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083891473] [2024-10-11 03:38:52,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083891473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:38:52,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:38:52,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:38:52,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905356762] [2024-10-11 03:38:52,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:38:52,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:38:52,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:38:52,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:38:52,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:38:52,152 INFO L87 Difference]: Start difference. First operand 845 states and 1292 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:52,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:38:52,178 INFO L93 Difference]: Finished difference Result 2233 states and 3406 transitions. [2024-10-11 03:38:52,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:38:52,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-10-11 03:38:52,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:38:52,185 INFO L225 Difference]: With dead ends: 2233 [2024-10-11 03:38:52,185 INFO L226 Difference]: Without dead ends: 1407 [2024-10-11 03:38:52,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:38:52,190 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 78 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:38:52,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 259 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:38:52,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2024-10-11 03:38:52,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1405. [2024-10-11 03:38:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.5014245014245013) internal successors, (2108), 1404 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2108 transitions. [2024-10-11 03:38:52,217 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2108 transitions. Word has length 39 [2024-10-11 03:38:52,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:38:52,217 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2108 transitions. [2024-10-11 03:38:52,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2108 transitions. [2024-10-11 03:38:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 03:38:52,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:38:52,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:38:52,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:38:52,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:38:52,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:38:52,224 INFO L85 PathProgramCache]: Analyzing trace with hash -367530919, now seen corresponding path program 1 times [2024-10-11 03:38:52,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:38:52,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037327628] [2024-10-11 03:38:52,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:38:52,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:38:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:38:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:38:52,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:38:52,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037327628] [2024-10-11 03:38:52,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037327628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:38:52,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:38:52,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:38:52,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124264993] [2024-10-11 03:38:52,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:38:52,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:38:52,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:38:52,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:38:52,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:38:52,387 INFO L87 Difference]: Start difference. First operand 1405 states and 2108 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:38:52,617 INFO L93 Difference]: Finished difference Result 4177 states and 6286 transitions. [2024-10-11 03:38:52,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:38:52,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-10-11 03:38:52,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:38:52,635 INFO L225 Difference]: With dead ends: 4177 [2024-10-11 03:38:52,637 INFO L226 Difference]: Without dead ends: 2791 [2024-10-11 03:38:52,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-10-11 03:38:52,642 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 457 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:38:52,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 129 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:38:52,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2024-10-11 03:38:52,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2789. [2024-10-11 03:38:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2788 states have (on average 1.4935437589670015) internal successors, (4164), 2788 states have internal predecessors, (4164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4164 transitions. [2024-10-11 03:38:52,749 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4164 transitions. Word has length 41 [2024-10-11 03:38:52,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:38:52,753 INFO L471 AbstractCegarLoop]: Abstraction has 2789 states and 4164 transitions. [2024-10-11 03:38:52,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4164 transitions. [2024-10-11 03:38:52,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 03:38:52,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:38:52,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:38:52,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:38:52,755 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:38:52,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:38:52,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1258633748, now seen corresponding path program 1 times [2024-10-11 03:38:52,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:38:52,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164362685] [2024-10-11 03:38:52,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:38:52,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:38:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:38:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:38:52,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:38:52,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164362685] [2024-10-11 03:38:52,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164362685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:38:52,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:38:52,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:38:52,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011508520] [2024-10-11 03:38:52,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:38:52,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:38:52,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:38:52,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:38:52,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:38:52,958 INFO L87 Difference]: Start difference. First operand 2789 states and 4164 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:52,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:38:52,986 INFO L93 Difference]: Finished difference Result 2983 states and 4453 transitions. [2024-10-11 03:38:52,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:38:52,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-10-11 03:38:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:38:52,994 INFO L225 Difference]: With dead ends: 2983 [2024-10-11 03:38:52,994 INFO L226 Difference]: Without dead ends: 2981 [2024-10-11 03:38:52,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:38:52,996 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:38:52,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 412 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:38:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2024-10-11 03:38:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2981. [2024-10-11 03:38:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2981 states, 2980 states have (on average 1.461744966442953) internal successors, (4356), 2980 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2981 states and 4356 transitions. [2024-10-11 03:38:53,057 INFO L78 Accepts]: Start accepts. Automaton has 2981 states and 4356 transitions. Word has length 41 [2024-10-11 03:38:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:38:53,058 INFO L471 AbstractCegarLoop]: Abstraction has 2981 states and 4356 transitions. [2024-10-11 03:38:53,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2981 states and 4356 transitions. [2024-10-11 03:38:53,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 03:38:53,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:38:53,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:38:53,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:38:53,059 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:38:53,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:38:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash 373513535, now seen corresponding path program 1 times [2024-10-11 03:38:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:38:53,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621003413] [2024-10-11 03:38:53,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:38:53,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:38:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:38:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:38:53,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:38:53,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621003413] [2024-10-11 03:38:53,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621003413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:38:53,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:38:53,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:38:53,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568377076] [2024-10-11 03:38:53,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:38:53,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:38:53,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:38:53,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:38:53,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:38:53,107 INFO L87 Difference]: Start difference. First operand 2981 states and 4356 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:53,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:38:53,136 INFO L93 Difference]: Finished difference Result 7123 states and 10402 transitions. [2024-10-11 03:38:53,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:38:53,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-11 03:38:53,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:38:53,150 INFO L225 Difference]: With dead ends: 7123 [2024-10-11 03:38:53,150 INFO L226 Difference]: Without dead ends: 4161 [2024-10-11 03:38:53,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:38:53,154 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 59 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:38:53,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 195 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:38:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4161 states. [2024-10-11 03:38:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4161 to 4159. [2024-10-11 03:38:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4159 states, 4158 states have (on average 1.4487734487734487) internal successors, (6024), 4158 states have internal predecessors, (6024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4159 states to 4159 states and 6024 transitions. [2024-10-11 03:38:53,217 INFO L78 Accepts]: Start accepts. Automaton has 4159 states and 6024 transitions. Word has length 42 [2024-10-11 03:38:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:38:53,217 INFO L471 AbstractCegarLoop]: Abstraction has 4159 states and 6024 transitions. [2024-10-11 03:38:53,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4159 states and 6024 transitions. [2024-10-11 03:38:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 03:38:53,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:38:53,219 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 03:38:53,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:38:53,219 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:38:53,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:38:53,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1493660826, now seen corresponding path program 1 times [2024-10-11 03:38:53,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:38:53,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542217558] [2024-10-11 03:38:53,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:38:53,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:38:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:38:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:38:53,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:38:53,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542217558] [2024-10-11 03:38:53,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542217558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:38:53,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067252345] [2024-10-11 03:38:53,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:38:53,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:38:53,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:38:53,344 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:38:53,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:38:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:38:53,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 03:38:53,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:38:54,043 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:38:54,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:38:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:38:54,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067252345] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:38:54,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:38:54,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2024-10-11 03:38:54,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130350257] [2024-10-11 03:38:54,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:38:54,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 03:38:54,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:38:54,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 03:38:54,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:38:54,607 INFO L87 Difference]: Start difference. First operand 4159 states and 6024 transitions. Second operand has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:38:55,310 INFO L93 Difference]: Finished difference Result 18142 states and 26108 transitions. [2024-10-11 03:38:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 03:38:55,311 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-10-11 03:38:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:38:55,353 INFO L225 Difference]: With dead ends: 18142 [2024-10-11 03:38:55,354 INFO L226 Difference]: Without dead ends: 14004 [2024-10-11 03:38:55,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:38:55,365 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 1528 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:38:55,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1528 Valid, 1269 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:38:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14004 states. [2024-10-11 03:38:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14004 to 12504. [2024-10-11 03:38:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12504 states, 12503 states have (on average 1.4213388786691195) internal successors, (17771), 12503 states have internal predecessors, (17771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12504 states to 12504 states and 17771 transitions. [2024-10-11 03:38:55,886 INFO L78 Accepts]: Start accepts. Automaton has 12504 states and 17771 transitions. Word has length 59 [2024-10-11 03:38:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:38:55,886 INFO L471 AbstractCegarLoop]: Abstraction has 12504 states and 17771 transitions. [2024-10-11 03:38:55,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 12504 states and 17771 transitions. [2024-10-11 03:38:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:38:55,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:38:55,888 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:38:55,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 03:38:56,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:38:56,092 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:38:56,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:38:56,093 INFO L85 PathProgramCache]: Analyzing trace with hash -210579987, now seen corresponding path program 1 times [2024-10-11 03:38:56,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:38:56,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542240074] [2024-10-11 03:38:56,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:38:56,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:38:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:38:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:38:56,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:38:56,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542240074] [2024-10-11 03:38:56,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542240074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:38:56,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:38:56,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:38:56,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862872929] [2024-10-11 03:38:56,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:38:56,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:38:56,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:38:56,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:38:56,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:38:56,140 INFO L87 Difference]: Start difference. First operand 12504 states and 17771 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:56,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:38:56,202 INFO L93 Difference]: Finished difference Result 27774 states and 39429 transitions. [2024-10-11 03:38:56,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:38:56,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-11 03:38:56,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:38:56,227 INFO L225 Difference]: With dead ends: 27774 [2024-10-11 03:38:56,228 INFO L226 Difference]: Without dead ends: 17448 [2024-10-11 03:38:56,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:38:56,242 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 56 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:38:56,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 212 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:38:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17448 states. [2024-10-11 03:38:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17448 to 17446. [2024-10-11 03:38:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17446 states, 17445 states have (on average 1.4074519919747779) internal successors, (24553), 17445 states have internal predecessors, (24553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17446 states to 17446 states and 24553 transitions. [2024-10-11 03:38:56,719 INFO L78 Accepts]: Start accepts. Automaton has 17446 states and 24553 transitions. Word has length 60 [2024-10-11 03:38:56,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:38:56,720 INFO L471 AbstractCegarLoop]: Abstraction has 17446 states and 24553 transitions. [2024-10-11 03:38:56,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:56,721 INFO L276 IsEmpty]: Start isEmpty. Operand 17446 states and 24553 transitions. [2024-10-11 03:38:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:38:56,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:38:56,722 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:38:56,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:38:56,723 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:38:56,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:38:56,723 INFO L85 PathProgramCache]: Analyzing trace with hash 740929194, now seen corresponding path program 1 times [2024-10-11 03:38:56,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:38:56,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006323961] [2024-10-11 03:38:56,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:38:56,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:38:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:38:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:38:56,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:38:56,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006323961] [2024-10-11 03:38:56,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006323961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:38:56,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:38:56,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:38:56,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041721727] [2024-10-11 03:38:56,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:38:56,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:38:56,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:38:56,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:38:56,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:38:56,891 INFO L87 Difference]: Start difference. First operand 17446 states and 24553 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:38:57,126 INFO L93 Difference]: Finished difference Result 37009 states and 52425 transitions. [2024-10-11 03:38:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:38:57,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-11 03:38:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:38:57,184 INFO L225 Difference]: With dead ends: 37009 [2024-10-11 03:38:57,184 INFO L226 Difference]: Without dead ends: 29263 [2024-10-11 03:38:57,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:38:57,196 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 308 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:38:57,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 530 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:38:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29263 states. [2024-10-11 03:38:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29263 to 24919. [2024-10-11 03:38:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24919 states, 24918 states have (on average 1.400955132835701) internal successors, (34909), 24918 states have internal predecessors, (34909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24919 states to 24919 states and 34909 transitions. [2024-10-11 03:38:57,726 INFO L78 Accepts]: Start accepts. Automaton has 24919 states and 34909 transitions. Word has length 60 [2024-10-11 03:38:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:38:57,727 INFO L471 AbstractCegarLoop]: Abstraction has 24919 states and 34909 transitions. [2024-10-11 03:38:57,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:57,727 INFO L276 IsEmpty]: Start isEmpty. Operand 24919 states and 34909 transitions. [2024-10-11 03:38:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:38:57,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:38:57,729 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:38:57,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:38:57,729 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:38:57,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:38:57,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1135753583, now seen corresponding path program 1 times [2024-10-11 03:38:57,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:38:57,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368189519] [2024-10-11 03:38:57,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:38:57,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:38:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:38:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:38:57,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:38:57,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368189519] [2024-10-11 03:38:57,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368189519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:38:57,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:38:57,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:38:57,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921115867] [2024-10-11 03:38:57,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:38:57,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:38:57,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:38:57,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:38:57,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:38:57,783 INFO L87 Difference]: Start difference. First operand 24919 states and 34909 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:57,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:38:58,107 INFO L93 Difference]: Finished difference Result 40452 states and 56232 transitions. [2024-10-11 03:38:58,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:38:58,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-11 03:38:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:38:58,201 INFO L225 Difference]: With dead ends: 40452 [2024-10-11 03:38:58,201 INFO L226 Difference]: Without dead ends: 25585 [2024-10-11 03:38:58,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:38:58,219 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 59 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:38:58,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 238 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:38:58,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25585 states. [2024-10-11 03:38:58,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25585 to 24968. [2024-10-11 03:38:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24968 states, 24967 states have (on average 1.3726519005086715) internal successors, (34271), 24967 states have internal predecessors, (34271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24968 states to 24968 states and 34271 transitions. [2024-10-11 03:38:58,592 INFO L78 Accepts]: Start accepts. Automaton has 24968 states and 34271 transitions. Word has length 60 [2024-10-11 03:38:58,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:38:58,592 INFO L471 AbstractCegarLoop]: Abstraction has 24968 states and 34271 transitions. [2024-10-11 03:38:58,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 24968 states and 34271 transitions. [2024-10-11 03:38:58,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:38:58,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:38:58,593 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:38:58,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:38:58,594 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:38:58,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:38:58,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1615980954, now seen corresponding path program 1 times [2024-10-11 03:38:58,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:38:58,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043119455] [2024-10-11 03:38:58,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:38:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:38:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:38:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:38:58,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:38:58,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043119455] [2024-10-11 03:38:58,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043119455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:38:58,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:38:58,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:38:58,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392982573] [2024-10-11 03:38:58,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:38:58,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:38:58,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:38:58,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:38:58,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:38:58,667 INFO L87 Difference]: Start difference. First operand 24968 states and 34271 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:38:58,919 INFO L93 Difference]: Finished difference Result 37849 states and 52462 transitions. [2024-10-11 03:38:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:38:58,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 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 60 [2024-10-11 03:38:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:38:58,976 INFO L225 Difference]: With dead ends: 37849 [2024-10-11 03:38:58,976 INFO L226 Difference]: Without dead ends: 33511 [2024-10-11 03:38:58,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:38:58,991 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 313 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:38:58,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 511 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:38:59,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33511 states. [2024-10-11 03:38:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33511 to 29144. [2024-10-11 03:38:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29144 states, 29143 states have (on average 1.3722334694437772) internal successors, (39991), 29143 states have internal predecessors, (39991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29144 states to 29144 states and 39991 transitions. [2024-10-11 03:38:59,402 INFO L78 Accepts]: Start accepts. Automaton has 29144 states and 39991 transitions. Word has length 60 [2024-10-11 03:38:59,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:38:59,402 INFO L471 AbstractCegarLoop]: Abstraction has 29144 states and 39991 transitions. [2024-10-11 03:38:59,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 29144 states and 39991 transitions. [2024-10-11 03:38:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 03:38:59,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:38:59,405 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 03:38:59,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:38:59,405 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:38:59,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:38:59,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1939950564, now seen corresponding path program 1 times [2024-10-11 03:38:59,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:38:59,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57976233] [2024-10-11 03:38:59,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:38:59,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:38:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:38:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:38:59,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:38:59,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57976233] [2024-10-11 03:38:59,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57976233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:38:59,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:38:59,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:38:59,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499287495] [2024-10-11 03:38:59,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:38:59,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:38:59,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:38:59,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:38:59,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:38:59,587 INFO L87 Difference]: Start difference. First operand 29144 states and 39991 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:38:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:38:59,739 INFO L93 Difference]: Finished difference Result 49752 states and 68959 transitions. [2024-10-11 03:38:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:38:59,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 61 [2024-10-11 03:38:59,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:38:59,795 INFO L225 Difference]: With dead ends: 49752 [2024-10-11 03:38:59,796 INFO L226 Difference]: Without dead ends: 40965 [2024-10-11 03:38:59,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:38:59,816 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 307 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:38:59,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 534 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:38:59,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40965 states. [2024-10-11 03:39:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40965 to 36583. [2024-10-11 03:39:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36583 states, 36582 states have (on average 1.3681318681318682) internal successors, (50049), 36582 states have internal predecessors, (50049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36583 states to 36583 states and 50049 transitions. [2024-10-11 03:39:00,467 INFO L78 Accepts]: Start accepts. Automaton has 36583 states and 50049 transitions. Word has length 61 [2024-10-11 03:39:00,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:00,467 INFO L471 AbstractCegarLoop]: Abstraction has 36583 states and 50049 transitions. [2024-10-11 03:39:00,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 36583 states and 50049 transitions. [2024-10-11 03:39:00,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 03:39:00,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:00,474 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:00,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:39:00,475 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:00,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:00,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1316989720, now seen corresponding path program 1 times [2024-10-11 03:39:00,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:00,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339744595] [2024-10-11 03:39:00,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:00,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:00,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:00,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339744595] [2024-10-11 03:39:00,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339744595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:00,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:00,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:39:00,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907225704] [2024-10-11 03:39:00,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:00,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:39:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:00,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:39:00,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:00,532 INFO L87 Difference]: Start difference. First operand 36583 states and 50049 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:00,702 INFO L93 Difference]: Finished difference Result 60693 states and 82717 transitions. [2024-10-11 03:39:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:39:00,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-10-11 03:39:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:00,737 INFO L225 Difference]: With dead ends: 60693 [2024-10-11 03:39:00,738 INFO L226 Difference]: Without dead ends: 26048 [2024-10-11 03:39:00,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:39:00,769 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 56 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:00,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 245 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:39:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26048 states. [2024-10-11 03:39:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26048 to 22861. [2024-10-11 03:39:01,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22861 states, 22860 states have (on average 1.3496062992125983) internal successors, (30852), 22860 states have internal predecessors, (30852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22861 states to 22861 states and 30852 transitions. [2024-10-11 03:39:01,105 INFO L78 Accepts]: Start accepts. Automaton has 22861 states and 30852 transitions. Word has length 63 [2024-10-11 03:39:01,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:01,106 INFO L471 AbstractCegarLoop]: Abstraction has 22861 states and 30852 transitions. [2024-10-11 03:39:01,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 22861 states and 30852 transitions. [2024-10-11 03:39:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:39:01,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:01,109 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:01,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:39:01,109 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:01,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash 109217082, now seen corresponding path program 1 times [2024-10-11 03:39:01,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:01,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792308330] [2024-10-11 03:39:01,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:01,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:01,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:39:01,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:01,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792308330] [2024-10-11 03:39:01,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792308330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:39:01,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:39:01,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:39:01,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702822336] [2024-10-11 03:39:01,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:39:01,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:39:01,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:01,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:39:01,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:39:01,179 INFO L87 Difference]: Start difference. First operand 22861 states and 30852 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:01,538 INFO L93 Difference]: Finished difference Result 53355 states and 71881 transitions. [2024-10-11 03:39:01,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:39:01,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 65 [2024-10-11 03:39:01,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:01,576 INFO L225 Difference]: With dead ends: 53355 [2024-10-11 03:39:01,576 INFO L226 Difference]: Without dead ends: 30579 [2024-10-11 03:39:01,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-10-11 03:39:01,596 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 413 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:01,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 133 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:39:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30579 states. [2024-10-11 03:39:01,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30579 to 30263. [2024-10-11 03:39:01,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30263 states, 30262 states have (on average 1.332991870993325) internal successors, (40339), 30262 states have internal predecessors, (40339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30263 states to 30263 states and 40339 transitions. [2024-10-11 03:39:01,922 INFO L78 Accepts]: Start accepts. Automaton has 30263 states and 40339 transitions. Word has length 65 [2024-10-11 03:39:01,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:01,923 INFO L471 AbstractCegarLoop]: Abstraction has 30263 states and 40339 transitions. [2024-10-11 03:39:01,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 30263 states and 40339 transitions. [2024-10-11 03:39:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:39:01,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:01,925 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:01,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:39:01,926 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:01,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:01,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1959331039, now seen corresponding path program 1 times [2024-10-11 03:39:01,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:01,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344956253] [2024-10-11 03:39:01,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:01,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:02,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:02,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344956253] [2024-10-11 03:39:02,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344956253] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:39:02,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224059776] [2024-10-11 03:39:02,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:02,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:39:02,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:39:02,011 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:39:02,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:39:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:02,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:39:02,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:39:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:02,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:39:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:02,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224059776] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:39:02,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:39:02,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-11 03:39:02,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457799660] [2024-10-11 03:39:02,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:39:02,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:39:02,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:02,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:39:02,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:39:02,616 INFO L87 Difference]: Start difference. First operand 30263 states and 40339 transitions. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 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-10-11 03:39:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:03,056 INFO L93 Difference]: Finished difference Result 65069 states and 87168 transitions. [2024-10-11 03:39:03,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:39:03,057 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 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 65 [2024-10-11 03:39:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:03,110 INFO L225 Difference]: With dead ends: 65069 [2024-10-11 03:39:03,110 INFO L226 Difference]: Without dead ends: 39003 [2024-10-11 03:39:03,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:39:03,135 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 831 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:03,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 333 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:39:03,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39003 states. [2024-10-11 03:39:03,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39003 to 29751. [2024-10-11 03:39:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29751 states, 29750 states have (on average 1.3378823529411765) internal successors, (39802), 29750 states have internal predecessors, (39802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29751 states to 29751 states and 39802 transitions. [2024-10-11 03:39:03,794 INFO L78 Accepts]: Start accepts. Automaton has 29751 states and 39802 transitions. Word has length 65 [2024-10-11 03:39:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:03,794 INFO L471 AbstractCegarLoop]: Abstraction has 29751 states and 39802 transitions. [2024-10-11 03:39:03,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 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-10-11 03:39:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 29751 states and 39802 transitions. [2024-10-11 03:39:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 03:39:03,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:03,797 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:03,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:39:04,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 03:39:04,002 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:04,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:04,004 INFO L85 PathProgramCache]: Analyzing trace with hash -603329014, now seen corresponding path program 1 times [2024-10-11 03:39:04,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:04,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860988474] [2024-10-11 03:39:04,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:04,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:04,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:04,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860988474] [2024-10-11 03:39:04,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860988474] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:39:04,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452074324] [2024-10-11 03:39:04,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:04,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:39:04,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:39:04,117 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:39:04,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:39:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:04,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:39:04,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:39:04,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:04,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:39:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:04,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452074324] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:39:04,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:39:04,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-11 03:39:04,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105035480] [2024-10-11 03:39:04,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:39:04,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:39:04,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:04,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:39:04,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:39:04,456 INFO L87 Difference]: Start difference. First operand 29751 states and 39802 transitions. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:04,740 INFO L93 Difference]: Finished difference Result 62740 states and 83515 transitions. [2024-10-11 03:39:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:39:04,740 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 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 66 [2024-10-11 03:39:04,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:04,787 INFO L225 Difference]: With dead ends: 62740 [2024-10-11 03:39:04,787 INFO L226 Difference]: Without dead ends: 35398 [2024-10-11 03:39:04,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:39:04,816 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 965 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:04,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 205 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:39:04,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35398 states. [2024-10-11 03:39:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35398 to 30269. [2024-10-11 03:39:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30269 states, 30268 states have (on average 1.3312078763050086) internal successors, (40293), 30268 states have internal predecessors, (40293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30269 states to 30269 states and 40293 transitions. [2024-10-11 03:39:05,426 INFO L78 Accepts]: Start accepts. Automaton has 30269 states and 40293 transitions. Word has length 66 [2024-10-11 03:39:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:05,426 INFO L471 AbstractCegarLoop]: Abstraction has 30269 states and 40293 transitions. [2024-10-11 03:39:05,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 30269 states and 40293 transitions. [2024-10-11 03:39:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 03:39:05,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:05,429 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:05,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:39:05,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:39:05,630 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:05,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:05,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1747084819, now seen corresponding path program 1 times [2024-10-11 03:39:05,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:05,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950052823] [2024-10-11 03:39:05,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:05,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:05,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:05,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950052823] [2024-10-11 03:39:05,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950052823] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:39:05,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108105598] [2024-10-11 03:39:05,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:05,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:39:05,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:39:05,775 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:39:05,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:39:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:05,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:39:05,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:39:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:06,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:39:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:06,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108105598] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:39:06,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:39:06,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-11 03:39:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259321710] [2024-10-11 03:39:06,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:39:06,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:39:06,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:06,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:39:06,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:39:06,221 INFO L87 Difference]: Start difference. First operand 30269 states and 40293 transitions. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:39:06,700 INFO L93 Difference]: Finished difference Result 55854 states and 74272 transitions. [2024-10-11 03:39:06,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:39:06,700 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 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 66 [2024-10-11 03:39:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:39:06,763 INFO L225 Difference]: With dead ends: 55854 [2024-10-11 03:39:06,763 INFO L226 Difference]: Without dead ends: 41785 [2024-10-11 03:39:06,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:39:06,788 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 498 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:39:06,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 381 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:39:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41785 states. [2024-10-11 03:39:07,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41785 to 33330. [2024-10-11 03:39:07,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33330 states, 33329 states have (on average 1.3291427885625131) internal successors, (44299), 33329 states have internal predecessors, (44299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33330 states to 33330 states and 44299 transitions. [2024-10-11 03:39:07,527 INFO L78 Accepts]: Start accepts. Automaton has 33330 states and 44299 transitions. Word has length 66 [2024-10-11 03:39:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:39:07,527 INFO L471 AbstractCegarLoop]: Abstraction has 33330 states and 44299 transitions. [2024-10-11 03:39:07,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:39:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 33330 states and 44299 transitions. [2024-10-11 03:39:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:39:07,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:39:07,530 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:39:07,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 03:39:07,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:39:07,734 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:39:07,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:39:07,734 INFO L85 PathProgramCache]: Analyzing trace with hash 293985688, now seen corresponding path program 1 times [2024-10-11 03:39:07,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:39:07,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460054599] [2024-10-11 03:39:07,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:07,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:39:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:39:07,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460054599] [2024-10-11 03:39:07,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460054599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:39:07,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963085561] [2024-10-11 03:39:07,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:39:07,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:39:07,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:39:07,934 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:39:07,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:39:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:39:08,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 03:39:08,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:39:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:11,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:39:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:39:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963085561] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:39:13,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:39:13,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20, 19] total 45 [2024-10-11 03:39:13,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176528091] [2024-10-11 03:39:13,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:39:13,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-11 03:39:13,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:39:13,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-11 03:39:13,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2024-10-11 03:39:13,158 INFO L87 Difference]: Start difference. First operand 33330 states and 44299 transitions. Second operand has 45 states, 45 states have (on average 4.177777777777778) internal successors, (188), 45 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)