./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d2ad25966f5b06d930031b35708c7035a644982dad73f08910281a8c7df501a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:53:10,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:53:10,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:53:10,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:53:10,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:53:10,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:53:10,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:53:10,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:53:10,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:53:10,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:53:10,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:53:10,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:53:10,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:53:10,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:53:10,977 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:53:10,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:53:10,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:53:10,978 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:53:10,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:53:10,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:53:10,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:53:10,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:53:10,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:53:10,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:53:10,984 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:53:10,984 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:53:10,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:53:10,985 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:53:10,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:53:10,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:53:10,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:53:10,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:53:10,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:53:10,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:53:10,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:53:10,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:53:10,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:53:10,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:53:10,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:53:10,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:53:10,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:53:10,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:53:10,990 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d2ad25966f5b06d930031b35708c7035a644982dad73f08910281a8c7df501a [2024-11-08 15:53:11,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:53:11,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:53:11,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:53:11,265 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:53:11,266 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:53:11,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-11-08 15:53:12,776 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:53:12,981 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:53:12,982 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-11-08 15:53:12,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae0cd69ff/de3397fc33f84ee490ae10c83877338c/FLAG858323883 [2024-11-08 15:53:13,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae0cd69ff/de3397fc33f84ee490ae10c83877338c [2024-11-08 15:53:13,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:53:13,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:53:13,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:53:13,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:53:13,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:53:13,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:53:13" (1/1) ... [2024-11-08 15:53:13,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd6d5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:53:13, skipping insertion in model container [2024-11-08 15:53:13,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:53:13" (1/1) ... [2024-11-08 15:53:13,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:53:13,309 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2024-11-08 15:53:13,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:53:13,365 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:53:13,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2024-11-08 15:53:13,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:53:13,436 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:53:13,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:53:13 WrapperNode [2024-11-08 15:53:13,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:53:13,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:53:13,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:53:13,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:53:13,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:53:13" (1/1) ... [2024-11-08 15:53:13,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:53:13" (1/1) ... [2024-11-08 15:53:13,489 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 353 [2024-11-08 15:53:13,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:53:13,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:53:13,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:53:13,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:53:13,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:53:13" (1/1) ... [2024-11-08 15:53:13,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:53:13" (1/1) ... [2024-11-08 15:53:13,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:53:13" (1/1) ... [2024-11-08 15:53:13,523 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:53:13,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:53:13" (1/1) ... [2024-11-08 15:53:13,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:53:13" (1/1) ... [2024-11-08 15:53:13,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:53:13" (1/1) ... [2024-11-08 15:53:13,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:53:13" (1/1) ... [2024-11-08 15:53:13,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:53:13" (1/1) ... [2024-11-08 15:53:13,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:53:13" (1/1) ... [2024-11-08 15:53:13,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:53:13,545 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:53:13,545 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:53:13,545 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:53:13,546 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:53:13" (1/1) ... [2024-11-08 15:53:13,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:53:13,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:53:13,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:53:13,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:53:13,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:53:13,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:53:13,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:53:13,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:53:13,729 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:53:13,732 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:53:14,198 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-08 15:53:14,199 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:53:14,214 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:53:14,214 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:53:14,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:53:14 BoogieIcfgContainer [2024-11-08 15:53:14,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:53:14,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:53:14,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:53:14,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:53:14,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:53:13" (1/3) ... [2024-11-08 15:53:14,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a436b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:53:14, skipping insertion in model container [2024-11-08 15:53:14,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:53:13" (2/3) ... [2024-11-08 15:53:14,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a436b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:53:14, skipping insertion in model container [2024-11-08 15:53:14,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:53:14" (3/3) ... [2024-11-08 15:53:14,226 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2024-11-08 15:53:14,260 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:53:14,261 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:53:14,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:53:14,342 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;@3eca3eb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:53:14,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:53:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 15:53:14,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:14,356 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-11-08 15:53:14,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:14,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:14,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1485847759, now seen corresponding path program 1 times [2024-11-08 15:53:14,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:14,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603314885] [2024-11-08 15:53:14,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:14,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:14,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:14,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603314885] [2024-11-08 15:53:14,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603314885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:53:14,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:53:14,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:53:14,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62794426] [2024-11-08 15:53:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:53:14,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:53:14,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:14,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:53:14,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:53:14,818 INFO L87 Difference]: Start difference. First operand has 80 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-11-08 15:53:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:14,900 INFO L93 Difference]: Finished difference Result 184 states and 294 transitions. [2024-11-08 15:53:14,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:53:14,903 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-11-08 15:53:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:14,912 INFO L225 Difference]: With dead ends: 184 [2024-11-08 15:53:14,912 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 15:53:14,915 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-11-08 15:53:14,918 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 85 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:14,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 263 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:53:14,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 15:53:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-11-08 15:53:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 115 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:14,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2024-11-08 15:53:14,958 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 37 [2024-11-08 15:53:14,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:14,959 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2024-11-08 15:53:14,959 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-11-08 15:53:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2024-11-08 15:53:14,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 15:53:14,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:14,961 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-11-08 15:53:14,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:53:14,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:14,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:14,962 INFO L85 PathProgramCache]: Analyzing trace with hash -498229074, now seen corresponding path program 1 times [2024-11-08 15:53:14,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:14,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523056452] [2024-11-08 15:53:14,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:14,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:15,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:15,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523056452] [2024-11-08 15:53:15,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523056452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:53:15,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:53:15,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:53:15,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569714167] [2024-11-08 15:53:15,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:53:15,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:53:15,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:15,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:53:15,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:53:15,107 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-11-08 15:53:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:15,145 INFO L93 Difference]: Finished difference Result 276 states and 424 transitions. [2024-11-08 15:53:15,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:53:15,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-11-08 15:53:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:15,151 INFO L225 Difference]: With dead ends: 276 [2024-11-08 15:53:15,151 INFO L226 Difference]: Without dead ends: 180 [2024-11-08 15:53:15,152 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-11-08 15:53:15,155 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 69 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:15,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:53:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-08 15:53:15,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2024-11-08 15:53:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.5197740112994351) internal successors, (269), 177 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 269 transitions. [2024-11-08 15:53:15,173 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 269 transitions. Word has length 38 [2024-11-08 15:53:15,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:15,174 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 269 transitions. [2024-11-08 15:53:15,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-11-08 15:53:15,174 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 269 transitions. [2024-11-08 15:53:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 15:53:15,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:15,175 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-11-08 15:53:15,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:53:15,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:15,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1494403672, now seen corresponding path program 1 times [2024-11-08 15:53:15,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:15,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975631073] [2024-11-08 15:53:15,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:15,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:15,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975631073] [2024-11-08 15:53:15,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975631073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:53:15,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:53:15,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:53:15,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343718293] [2024-11-08 15:53:15,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:53:15,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:53:15,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:15,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:53:15,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:53:15,367 INFO L87 Difference]: Start difference. First operand 178 states and 269 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-11-08 15:53:15,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:15,483 INFO L93 Difference]: Finished difference Result 810 states and 1265 transitions. [2024-11-08 15:53:15,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:53:15,484 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-11-08 15:53:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:15,491 INFO L225 Difference]: With dead ends: 810 [2024-11-08 15:53:15,492 INFO L226 Difference]: Without dead ends: 652 [2024-11-08 15:53:15,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:53:15,494 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 447 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:15,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 620 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:53:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-08 15:53:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 334. [2024-11-08 15:53:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.5285285285285286) internal successors, (509), 333 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 509 transitions. [2024-11-08 15:53:15,527 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 509 transitions. Word has length 39 [2024-11-08 15:53:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:15,527 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 509 transitions. [2024-11-08 15:53:15,539 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-11-08 15:53:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 509 transitions. [2024-11-08 15:53:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 15:53:15,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:15,541 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] [2024-11-08 15:53:15,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:53:15,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:15,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:15,542 INFO L85 PathProgramCache]: Analyzing trace with hash -937582741, now seen corresponding path program 1 times [2024-11-08 15:53:15,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:15,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064692827] [2024-11-08 15:53:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:15,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:15,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:15,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064692827] [2024-11-08 15:53:15,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064692827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:53:15,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:53:15,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:53:15,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372973295] [2024-11-08 15:53:15,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:53:15,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:53:15,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:15,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:53:15,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:53:15,774 INFO L87 Difference]: Start difference. First operand 334 states and 509 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:15,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:15,838 INFO L93 Difference]: Finished difference Result 1164 states and 1792 transitions. [2024-11-08 15:53:15,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:53:15,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-11-08 15:53:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:15,843 INFO L225 Difference]: With dead ends: 1164 [2024-11-08 15:53:15,843 INFO L226 Difference]: Without dead ends: 850 [2024-11-08 15:53:15,846 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-11-08 15:53:15,850 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 264 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:15,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 334 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:53:15,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-11-08 15:53:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 846. [2024-11-08 15:53:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 845 states have (on average 1.5301775147928993) internal successors, (1293), 845 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1293 transitions. [2024-11-08 15:53:15,892 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1293 transitions. Word has length 40 [2024-11-08 15:53:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:15,894 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1293 transitions. [2024-11-08 15:53:15,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1293 transitions. [2024-11-08 15:53:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 15:53:15,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:15,897 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] [2024-11-08 15:53:15,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:53:15,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:15,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:15,898 INFO L85 PathProgramCache]: Analyzing trace with hash 936362024, now seen corresponding path program 1 times [2024-11-08 15:53:15,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:15,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659059633] [2024-11-08 15:53:15,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:15,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:15,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:15,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:15,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659059633] [2024-11-08 15:53:15,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659059633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:53:15,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:53:15,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:53:15,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261464593] [2024-11-08 15:53:15,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:53:15,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:53:15,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:15,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:53:15,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:53:15,973 INFO L87 Difference]: Start difference. First operand 846 states and 1293 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:16,003 INFO L93 Difference]: Finished difference Result 2234 states and 3407 transitions. [2024-11-08 15:53:16,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:53:16,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-11-08 15:53:16,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:16,011 INFO L225 Difference]: With dead ends: 2234 [2024-11-08 15:53:16,011 INFO L226 Difference]: Without dead ends: 1408 [2024-11-08 15:53:16,013 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-11-08 15:53:16,014 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 78 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:16,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 261 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:53:16,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-11-08 15:53:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1406. [2024-11-08 15:53:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1405 states have (on average 1.5010676156583629) internal successors, (2109), 1405 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2109 transitions. [2024-11-08 15:53:16,049 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2109 transitions. Word has length 40 [2024-11-08 15:53:16,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:16,049 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 2109 transitions. [2024-11-08 15:53:16,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2109 transitions. [2024-11-08 15:53:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 15:53:16,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:16,052 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-11-08 15:53:16,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:53:16,053 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:16,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:16,053 INFO L85 PathProgramCache]: Analyzing trace with hash -669019710, now seen corresponding path program 1 times [2024-11-08 15:53:16,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:16,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963400975] [2024-11-08 15:53:16,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:16,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:16,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:16,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:16,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963400975] [2024-11-08 15:53:16,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963400975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:53:16,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:53:16,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:53:16,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253736406] [2024-11-08 15:53:16,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:53:16,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:53:16,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:16,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:53:16,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:53:16,154 INFO L87 Difference]: Start difference. First operand 1406 states and 2109 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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-11-08 15:53:16,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:16,306 INFO L93 Difference]: Finished difference Result 4178 states and 6287 transitions. [2024-11-08 15:53:16,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:53:16,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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-11-08 15:53:16,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:16,341 INFO L225 Difference]: With dead ends: 4178 [2024-11-08 15:53:16,342 INFO L226 Difference]: Without dead ends: 2792 [2024-11-08 15:53:16,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:53:16,344 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 457 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:16,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 131 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:53:16,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2024-11-08 15:53:16,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2790. [2024-11-08 15:53:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2790 states, 2789 states have (on average 1.4933667981355325) internal successors, (4165), 2789 states have internal predecessors, (4165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 4165 transitions. [2024-11-08 15:53:16,401 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 4165 transitions. Word has length 42 [2024-11-08 15:53:16,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:16,402 INFO L471 AbstractCegarLoop]: Abstraction has 2790 states and 4165 transitions. [2024-11-08 15:53:16,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 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-11-08 15:53:16,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 4165 transitions. [2024-11-08 15:53:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 15:53:16,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:16,403 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-11-08 15:53:16,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:53:16,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:16,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:16,404 INFO L85 PathProgramCache]: Analyzing trace with hash 957144957, now seen corresponding path program 1 times [2024-11-08 15:53:16,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:16,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316600210] [2024-11-08 15:53:16,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:16,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:16,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:16,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316600210] [2024-11-08 15:53:16,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316600210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:53:16,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:53:16,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:53:16,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481401900] [2024-11-08 15:53:16,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:53:16,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:53:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:16,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:53:16,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:53:16,709 INFO L87 Difference]: Start difference. First operand 2790 states and 4165 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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-11-08 15:53:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:16,749 INFO L93 Difference]: Finished difference Result 2984 states and 4454 transitions. [2024-11-08 15:53:16,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:53:16,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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-11-08 15:53:16,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:16,762 INFO L225 Difference]: With dead ends: 2984 [2024-11-08 15:53:16,763 INFO L226 Difference]: Without dead ends: 2982 [2024-11-08 15:53:16,764 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-11-08 15:53:16,767 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:16,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 417 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:53:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2024-11-08 15:53:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2982. [2024-11-08 15:53:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2982 states, 2981 states have (on average 1.461590070446159) internal successors, (4357), 2981 states have internal predecessors, (4357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 4357 transitions. [2024-11-08 15:53:16,868 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 4357 transitions. Word has length 42 [2024-11-08 15:53:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:16,868 INFO L471 AbstractCegarLoop]: Abstraction has 2982 states and 4357 transitions. [2024-11-08 15:53:16,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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-11-08 15:53:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 4357 transitions. [2024-11-08 15:53:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 15:53:16,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:16,869 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:53:16,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:53:16,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:16,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:16,870 INFO L85 PathProgramCache]: Analyzing trace with hash -382704394, now seen corresponding path program 1 times [2024-11-08 15:53:16,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:16,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940226629] [2024-11-08 15:53:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:16,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:16,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-11-08 15:53:16,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:16,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940226629] [2024-11-08 15:53:16,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940226629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:53:16,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:53:16,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:53:16,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209500331] [2024-11-08 15:53:16,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:53:16,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:53:16,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:16,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:53:16,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:53:16,961 INFO L87 Difference]: Start difference. First operand 2982 states and 4357 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:17,008 INFO L93 Difference]: Finished difference Result 7124 states and 10403 transitions. [2024-11-08 15:53:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:53:17,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2024-11-08 15:53:17,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:17,027 INFO L225 Difference]: With dead ends: 7124 [2024-11-08 15:53:17,027 INFO L226 Difference]: Without dead ends: 4162 [2024-11-08 15:53:17,034 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-11-08 15:53:17,035 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 59 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:17,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 197 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:53:17,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states. [2024-11-08 15:53:17,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 4160. [2024-11-08 15:53:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4160 states, 4159 states have (on average 1.4486655446020678) internal successors, (6025), 4159 states have internal predecessors, (6025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 6025 transitions. [2024-11-08 15:53:17,140 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 6025 transitions. Word has length 43 [2024-11-08 15:53:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:17,140 INFO L471 AbstractCegarLoop]: Abstraction has 4160 states and 6025 transitions. [2024-11-08 15:53:17,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 6025 transitions. [2024-11-08 15:53:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 15:53:17,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:17,144 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, 1] [2024-11-08 15:53:17,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:53:17,144 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:17,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:17,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1624116797, now seen corresponding path program 1 times [2024-11-08 15:53:17,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:17,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725925665] [2024-11-08 15:53:17,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:17,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:53:17,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:17,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725925665] [2024-11-08 15:53:17,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725925665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:53:17,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171633992] [2024-11-08 15:53:17,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:17,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:53:17,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:53:17,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:53:17,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:53:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:17,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 15:53:17,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:53:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:18,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:53:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171633992] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:53:18,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:53:18,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 7] total 15 [2024-11-08 15:53:18,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914679766] [2024-11-08 15:53:18,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:53:18,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 15:53:18,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:18,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 15:53:18,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:53:18,717 INFO L87 Difference]: Start difference. First operand 4160 states and 6025 transitions. Second operand has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:19,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:19,566 INFO L93 Difference]: Finished difference Result 16221 states and 23464 transitions. [2024-11-08 15:53:19,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 15:53:19,566 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 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-11-08 15:53:19,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:19,613 INFO L225 Difference]: With dead ends: 16221 [2024-11-08 15:53:19,614 INFO L226 Difference]: Without dead ends: 12083 [2024-11-08 15:53:19,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=602, Unknown=0, NotChecked=0, Total=870 [2024-11-08 15:53:19,624 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1962 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:19,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 1142 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:53:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12083 states. [2024-11-08 15:53:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12083 to 11191. [2024-11-08 15:53:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11191 states, 11190 states have (on average 1.426988382484361) internal successors, (15968), 11190 states have internal predecessors, (15968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11191 states to 11191 states and 15968 transitions. [2024-11-08 15:53:19,864 INFO L78 Accepts]: Start accepts. Automaton has 11191 states and 15968 transitions. Word has length 60 [2024-11-08 15:53:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:19,864 INFO L471 AbstractCegarLoop]: Abstraction has 11191 states and 15968 transitions. [2024-11-08 15:53:19,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 11191 states and 15968 transitions. [2024-11-08 15:53:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 15:53:19,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:19,868 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-11-08 15:53:19,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 15:53:20,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:53:20,071 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:20,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1922561508, now seen corresponding path program 1 times [2024-11-08 15:53:20,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:20,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004891175] [2024-11-08 15:53:20,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:20,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:20,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004891175] [2024-11-08 15:53:20,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004891175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:53:20,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:53:20,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:53:20,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803632120] [2024-11-08 15:53:20,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:53:20,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:53:20,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:20,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:53:20,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:53:20,160 INFO L87 Difference]: Start difference. First operand 11191 states and 15968 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:20,241 INFO L93 Difference]: Finished difference Result 27096 states and 38531 transitions. [2024-11-08 15:53:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:53:20,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-11-08 15:53:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:20,278 INFO L225 Difference]: With dead ends: 27096 [2024-11-08 15:53:20,278 INFO L226 Difference]: Without dead ends: 18724 [2024-11-08 15:53:20,294 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-11-08 15:53:20,295 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 56 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:20,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 214 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:53:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18724 states. [2024-11-08 15:53:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18724 to 18722. [2024-11-08 15:53:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18722 states, 18721 states have (on average 1.4080978580204049) internal successors, (26361), 18721 states have internal predecessors, (26361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18722 states to 18722 states and 26361 transitions. [2024-11-08 15:53:20,700 INFO L78 Accepts]: Start accepts. Automaton has 18722 states and 26361 transitions. Word has length 61 [2024-11-08 15:53:20,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:20,700 INFO L471 AbstractCegarLoop]: Abstraction has 18722 states and 26361 transitions. [2024-11-08 15:53:20,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 18722 states and 26361 transitions. [2024-11-08 15:53:20,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 15:53:20,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:20,703 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-11-08 15:53:20,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:53:20,703 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:20,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1420896607, now seen corresponding path program 1 times [2024-11-08 15:53:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:20,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123536038] [2024-11-08 15:53:20,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:20,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:53:20,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:20,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123536038] [2024-11-08 15:53:20,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123536038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:53:20,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:53:20,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:53:20,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737880170] [2024-11-08 15:53:20,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:53:20,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:53:20,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:20,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:53:20,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:53:20,800 INFO L87 Difference]: Start difference. First operand 18722 states and 26361 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:21,024 INFO L93 Difference]: Finished difference Result 38769 states and 54929 transitions. [2024-11-08 15:53:21,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:53:21,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-08 15:53:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:21,087 INFO L225 Difference]: With dead ends: 38769 [2024-11-08 15:53:21,088 INFO L226 Difference]: Without dead ends: 30803 [2024-11-08 15:53:21,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-08 15:53:21,110 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 307 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:21,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 522 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:53:21,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30803 states. [2024-11-08 15:53:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30803 to 26375. [2024-11-08 15:53:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26375 states, 26374 states have (on average 1.401721392280276) internal successors, (36969), 26374 states have internal predecessors, (36969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26375 states to 26375 states and 36969 transitions. [2024-11-08 15:53:21,724 INFO L78 Accepts]: Start accepts. Automaton has 26375 states and 36969 transitions. Word has length 61 [2024-11-08 15:53:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:21,724 INFO L471 AbstractCegarLoop]: Abstraction has 26375 states and 36969 transitions. [2024-11-08 15:53:21,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 26375 states and 36969 transitions. [2024-11-08 15:53:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 15:53:21,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:21,728 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-11-08 15:53:21,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:53:21,728 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:21,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:21,729 INFO L85 PathProgramCache]: Analyzing trace with hash 997387912, now seen corresponding path program 1 times [2024-11-08 15:53:21,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:21,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584179738] [2024-11-08 15:53:21,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:21,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:21,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:21,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584179738] [2024-11-08 15:53:21,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584179738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:53:21,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:53:21,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:53:21,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353327267] [2024-11-08 15:53:21,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:53:21,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:53:21,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:21,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:53:21,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:53:21,809 INFO L87 Difference]: Start difference. First operand 26375 states and 36969 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:21,941 INFO L93 Difference]: Finished difference Result 43208 states and 60059 transitions. [2024-11-08 15:53:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:53:21,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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-11-08 15:53:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:22,005 INFO L225 Difference]: With dead ends: 43208 [2024-11-08 15:53:22,005 INFO L226 Difference]: Without dead ends: 27138 [2024-11-08 15:53:22,144 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-11-08 15:53:22,145 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 59 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:22,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 240 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:53:22,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27138 states. [2024-11-08 15:53:22,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27138 to 26424. [2024-11-08 15:53:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26424 states, 26423 states have (on average 1.372705597396208) internal successors, (36271), 26423 states have internal predecessors, (36271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26424 states to 26424 states and 36271 transitions. [2024-11-08 15:53:22,602 INFO L78 Accepts]: Start accepts. Automaton has 26424 states and 36271 transitions. Word has length 61 [2024-11-08 15:53:22,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:22,602 INFO L471 AbstractCegarLoop]: Abstraction has 26424 states and 36271 transitions. [2024-11-08 15:53:22,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 26424 states and 36271 transitions. [2024-11-08 15:53:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 15:53:22,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:22,605 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-11-08 15:53:22,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:53:22,605 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:22,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:22,606 INFO L85 PathProgramCache]: Analyzing trace with hash -545844847, now seen corresponding path program 1 times [2024-11-08 15:53:22,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:22,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212227867] [2024-11-08 15:53:22,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:22,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:53:22,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:22,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212227867] [2024-11-08 15:53:22,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212227867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:53:22,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:53:22,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:53:22,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401795666] [2024-11-08 15:53:22,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:53:22,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:53:22,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:22,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:53:22,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:53:22,709 INFO L87 Difference]: Start difference. First operand 26424 states and 36271 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-11-08 15:53:22,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:22,973 INFO L93 Difference]: Finished difference Result 39509 states and 54746 transitions. [2024-11-08 15:53:22,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:53:22,974 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 61 [2024-11-08 15:53:22,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:23,047 INFO L225 Difference]: With dead ends: 39509 [2024-11-08 15:53:23,047 INFO L226 Difference]: Without dead ends: 35091 [2024-11-08 15:53:23,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-08 15:53:23,065 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 314 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:23,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 506 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:53:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35091 states. [2024-11-08 15:53:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35091 to 30660. [2024-11-08 15:53:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30660 states, 30659 states have (on average 1.372093023255814) internal successors, (42067), 30659 states have internal predecessors, (42067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30660 states to 30660 states and 42067 transitions. [2024-11-08 15:53:23,685 INFO L78 Accepts]: Start accepts. Automaton has 30660 states and 42067 transitions. Word has length 61 [2024-11-08 15:53:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:23,685 INFO L471 AbstractCegarLoop]: Abstraction has 30660 states and 42067 transitions. [2024-11-08 15:53:23,685 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-11-08 15:53:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 30660 states and 42067 transitions. [2024-11-08 15:53:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 15:53:23,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:23,690 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] [2024-11-08 15:53:23,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:53:23,690 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:23,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash -237073659, now seen corresponding path program 1 times [2024-11-08 15:53:23,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:23,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365613370] [2024-11-08 15:53:23,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 15:53:23,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:23,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365613370] [2024-11-08 15:53:23,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365613370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:53:23,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:53:23,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:53:23,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232498344] [2024-11-08 15:53:23,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:53:23,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:53:23,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:23,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:53:23,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:53:23,797 INFO L87 Difference]: Start difference. First operand 30660 states and 42067 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:24,148 INFO L93 Difference]: Finished difference Result 52050 states and 72142 transitions. [2024-11-08 15:53:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:53:24,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 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 62 [2024-11-08 15:53:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:24,212 INFO L225 Difference]: With dead ends: 52050 [2024-11-08 15:53:24,212 INFO L226 Difference]: Without dead ends: 42701 [2024-11-08 15:53:24,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-08 15:53:24,234 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 307 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:24,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 536 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:53:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42701 states. [2024-11-08 15:53:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42701 to 38255. [2024-11-08 15:53:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38255 states, 38254 states have (on average 1.3673079939352748) internal successors, (52305), 38254 states have internal predecessors, (52305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38255 states to 38255 states and 52305 transitions. [2024-11-08 15:53:25,074 INFO L78 Accepts]: Start accepts. Automaton has 38255 states and 52305 transitions. Word has length 62 [2024-11-08 15:53:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:25,075 INFO L471 AbstractCegarLoop]: Abstraction has 38255 states and 52305 transitions. [2024-11-08 15:53:25,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 38255 states and 52305 transitions. [2024-11-08 15:53:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 15:53:25,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:25,081 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] [2024-11-08 15:53:25,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:53:25,082 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:25,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:25,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1234823791, now seen corresponding path program 1 times [2024-11-08 15:53:25,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:25,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939833839] [2024-11-08 15:53:25,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:25,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:25,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:25,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939833839] [2024-11-08 15:53:25,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939833839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:53:25,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:53:25,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:53:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305105213] [2024-11-08 15:53:25,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:53:25,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:53:25,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:25,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:53:25,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:53:25,186 INFO L87 Difference]: Start difference. First operand 38255 states and 52305 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:25,344 INFO L93 Difference]: Finished difference Result 67694 states and 92314 transitions. [2024-11-08 15:53:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:53:25,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-11-08 15:53:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:25,398 INFO L225 Difference]: With dead ends: 67694 [2024-11-08 15:53:25,399 INFO L226 Difference]: Without dead ends: 31731 [2024-11-08 15:53:25,435 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-11-08 15:53:25,435 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 56 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:25,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 250 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:53:25,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31731 states. [2024-11-08 15:53:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31731 to 28892. [2024-11-08 15:53:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28892 states, 28891 states have (on average 1.3502128690595687) internal successors, (39009), 28891 states have internal predecessors, (39009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28892 states to 28892 states and 39009 transitions. [2024-11-08 15:53:26,065 INFO L78 Accepts]: Start accepts. Automaton has 28892 states and 39009 transitions. Word has length 64 [2024-11-08 15:53:26,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:26,065 INFO L471 AbstractCegarLoop]: Abstraction has 28892 states and 39009 transitions. [2024-11-08 15:53:26,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:26,065 INFO L276 IsEmpty]: Start isEmpty. Operand 28892 states and 39009 transitions. [2024-11-08 15:53:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 15:53:26,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:26,071 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-11-08 15:53:26,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:53:26,071 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:26,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:26,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1761263523, now seen corresponding path program 1 times [2024-11-08 15:53:26,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:26,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440243930] [2024-11-08 15:53:26,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:26,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 15:53:26,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:26,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440243930] [2024-11-08 15:53:26,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440243930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:53:26,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:53:26,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:53:26,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913741867] [2024-11-08 15:53:26,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:53:26,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:53:26,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:26,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:53:26,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:53:26,158 INFO L87 Difference]: Start difference. First operand 28892 states and 39009 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:26,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:26,387 INFO L93 Difference]: Finished difference Result 67116 states and 90488 transitions. [2024-11-08 15:53:26,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:53:26,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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-11-08 15:53:26,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:26,441 INFO L225 Difference]: With dead ends: 67116 [2024-11-08 15:53:26,441 INFO L226 Difference]: Without dead ends: 38310 [2024-11-08 15:53:26,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:53:26,468 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 413 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:26,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 135 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:53:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38310 states. [2024-11-08 15:53:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38310 to 37966. [2024-11-08 15:53:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37966 states, 37965 states have (on average 1.3334123534834716) internal successors, (50623), 37965 states have internal predecessors, (50623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37966 states to 37966 states and 50623 transitions. [2024-11-08 15:53:27,155 INFO L78 Accepts]: Start accepts. Automaton has 37966 states and 50623 transitions. Word has length 66 [2024-11-08 15:53:27,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:27,155 INFO L471 AbstractCegarLoop]: Abstraction has 37966 states and 50623 transitions. [2024-11-08 15:53:27,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 37966 states and 50623 transitions. [2024-11-08 15:53:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 15:53:27,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:27,159 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-11-08 15:53:27,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:53:27,160 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:27,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:27,160 INFO L85 PathProgramCache]: Analyzing trace with hash -683589816, now seen corresponding path program 1 times [2024-11-08 15:53:27,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:27,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328961445] [2024-11-08 15:53:27,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:27,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:27,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:27,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328961445] [2024-11-08 15:53:27,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328961445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:53:27,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184828115] [2024-11-08 15:53:27,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:27,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:53:27,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:53:27,309 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:53:27,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 15:53:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:27,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:53:27,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:53:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:27,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:53:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:27,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184828115] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:53:27,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:53:27,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-08 15:53:27,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856663608] [2024-11-08 15:53:27,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:53:27,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 15:53:27,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:27,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 15:53:27,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:53:27,776 INFO L87 Difference]: Start difference. First operand 37966 states and 50623 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:28,476 INFO L93 Difference]: Finished difference Result 82254 states and 110188 transitions. [2024-11-08 15:53:28,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:53:28,476 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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-11-08 15:53:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:28,552 INFO L225 Difference]: With dead ends: 82254 [2024-11-08 15:53:28,552 INFO L226 Difference]: Without dead ends: 50365 [2024-11-08 15:53:28,574 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-11-08 15:53:28,575 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 957 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:28,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 364 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:53:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50365 states. [2024-11-08 15:53:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50365 to 37627. [2024-11-08 15:53:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37627 states, 37626 states have (on average 1.341412852814543) internal successors, (50472), 37626 states have internal predecessors, (50472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37627 states to 37627 states and 50472 transitions. [2024-11-08 15:53:29,024 INFO L78 Accepts]: Start accepts. Automaton has 37627 states and 50472 transitions. Word has length 66 [2024-11-08 15:53:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:29,024 INFO L471 AbstractCegarLoop]: Abstraction has 37627 states and 50472 transitions. [2024-11-08 15:53:29,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 37627 states and 50472 transitions. [2024-11-08 15:53:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 15:53:29,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:29,029 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] [2024-11-08 15:53:29,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 15:53:29,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 15:53:29,234 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:29,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:29,234 INFO L85 PathProgramCache]: Analyzing trace with hash -929496895, now seen corresponding path program 1 times [2024-11-08 15:53:29,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:29,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842089331] [2024-11-08 15:53:29,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:29,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:29,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:29,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842089331] [2024-11-08 15:53:29,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842089331] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:53:29,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711465874] [2024-11-08 15:53:29,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:29,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:53:29,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:53:29,540 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:53:29,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 15:53:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:29,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:53:29,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:53:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:29,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:53:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:29,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711465874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:53:29,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:53:29,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-08 15:53:29,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768692604] [2024-11-08 15:53:29,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:53:29,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 15:53:29,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:29,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 15:53:29,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:53:29,955 INFO L87 Difference]: Start difference. First operand 37627 states and 50472 transitions. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:30,290 INFO L93 Difference]: Finished difference Result 77678 states and 103789 transitions. [2024-11-08 15:53:30,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:53:30,290 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-08 15:53:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:30,350 INFO L225 Difference]: With dead ends: 77678 [2024-11-08 15:53:30,351 INFO L226 Difference]: Without dead ends: 44851 [2024-11-08 15:53:30,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 124 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-11-08 15:53:30,382 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 965 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:30,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 270 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:53:30,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44851 states. [2024-11-08 15:53:30,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44851 to 38511. [2024-11-08 15:53:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38511 states, 38510 states have (on average 1.333549727343547) internal successors, (51355), 38510 states have internal predecessors, (51355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38511 states to 38511 states and 51355 transitions. [2024-11-08 15:53:30,910 INFO L78 Accepts]: Start accepts. Automaton has 38511 states and 51355 transitions. Word has length 67 [2024-11-08 15:53:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:30,910 INFO L471 AbstractCegarLoop]: Abstraction has 38511 states and 51355 transitions. [2024-11-08 15:53:30,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 38511 states and 51355 transitions. [2024-11-08 15:53:30,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 15:53:30,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:30,918 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] [2024-11-08 15:53:30,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 15:53:31,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-08 15:53:31,119 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:31,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2073252700, now seen corresponding path program 1 times [2024-11-08 15:53:31,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:31,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61484655] [2024-11-08 15:53:31,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:31,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:31,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:31,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61484655] [2024-11-08 15:53:31,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61484655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:53:31,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715501145] [2024-11-08 15:53:31,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:31,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:53:31,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:53:31,248 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:53:31,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 15:53:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:31,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:53:31,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:53:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:31,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:53:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:31,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715501145] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:53:31,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:53:31,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-08 15:53:31,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117783019] [2024-11-08 15:53:31,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:53:31,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 15:53:31,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:31,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 15:53:31,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:53:31,689 INFO L87 Difference]: Start difference. First operand 38511 states and 51355 transitions. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:53:32,067 INFO L93 Difference]: Finished difference Result 72575 states and 96578 transitions. [2024-11-08 15:53:32,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:53:32,068 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-08 15:53:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:53:32,152 INFO L225 Difference]: With dead ends: 72575 [2024-11-08 15:53:32,152 INFO L226 Difference]: Without dead ends: 54262 [2024-11-08 15:53:32,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 124 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-11-08 15:53:32,180 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 776 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:53:32,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 252 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:53:32,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54262 states. [2024-11-08 15:53:32,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54262 to 42674. [2024-11-08 15:53:32,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42674 states, 42673 states have (on average 1.331357064185785) internal successors, (56813), 42673 states have internal predecessors, (56813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42674 states to 42674 states and 56813 transitions. [2024-11-08 15:53:32,967 INFO L78 Accepts]: Start accepts. Automaton has 42674 states and 56813 transitions. Word has length 67 [2024-11-08 15:53:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:53:32,967 INFO L471 AbstractCegarLoop]: Abstraction has 42674 states and 56813 transitions. [2024-11-08 15:53:32,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:53:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 42674 states and 56813 transitions. [2024-11-08 15:53:32,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 15:53:32,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:53:32,971 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, 1] [2024-11-08 15:53:32,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 15:53:33,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:53:33,172 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:53:33,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:53:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash 379264655, now seen corresponding path program 1 times [2024-11-08 15:53:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:53:33,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655339948] [2024-11-08 15:53:33,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:33,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:53:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:33,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:53:33,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655339948] [2024-11-08 15:53:33,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655339948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:53:33,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987153442] [2024-11-08 15:53:33,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:53:33,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:53:33,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:53:33,487 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:53:33,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 15:53:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:53:33,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 15:53:33,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:53:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:35,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:53:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:53:35,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987153442] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:53:35,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:53:35,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2024-11-08 15:53:35,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239083780] [2024-11-08 15:53:35,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:53:35,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 15:53:35,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:53:35,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 15:53:35,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2024-11-08 15:53:35,718 INFO L87 Difference]: Start difference. First operand 42674 states and 56813 transitions. Second operand has 32 states, 32 states have (on average 5.9375) internal successors, (190), 32 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:54:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:54:02,304 INFO L93 Difference]: Finished difference Result 704053 states and 927350 transitions. [2024-11-08 15:54:02,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 487 states. [2024-11-08 15:54:02,305 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.9375) internal successors, (190), 32 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-08 15:54:02,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:54:04,059 INFO L225 Difference]: With dead ends: 704053 [2024-11-08 15:54:04,060 INFO L226 Difference]: Without dead ends: 660704 [2024-11-08 15:54:04,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 514 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127745 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=26462, Invalid=239278, Unknown=0, NotChecked=0, Total=265740 [2024-11-08 15:54:04,327 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 14322 mSDsluCounter, 3807 mSDsCounter, 0 mSdLazyCounter, 5415 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14322 SdHoareTripleChecker+Valid, 4096 SdHoareTripleChecker+Invalid, 5770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 5415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:54:04,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14322 Valid, 4096 Invalid, 5770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 5415 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 15:54:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660704 states. [2024-11-08 15:54:09,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660704 to 152030. [2024-11-08 15:54:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152030 states, 152029 states have (on average 1.328391293766321) internal successors, (201954), 152029 states have internal predecessors, (201954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:54:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152030 states to 152030 states and 201954 transitions. [2024-11-08 15:54:09,597 INFO L78 Accepts]: Start accepts. Automaton has 152030 states and 201954 transitions. Word has length 69 [2024-11-08 15:54:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:54:09,597 INFO L471 AbstractCegarLoop]: Abstraction has 152030 states and 201954 transitions. [2024-11-08 15:54:09,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.9375) internal successors, (190), 32 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:54:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 152030 states and 201954 transitions. [2024-11-08 15:54:09,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 15:54:09,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:54:09,602 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:54:09,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 15:54:09,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:54:09,803 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:54:09,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:54:09,804 INFO L85 PathProgramCache]: Analyzing trace with hash -303813183, now seen corresponding path program 1 times [2024-11-08 15:54:09,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:54:09,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910018101] [2024-11-08 15:54:09,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:54:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:54:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:54:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:54:09,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:54:09,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910018101] [2024-11-08 15:54:09,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910018101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:54:09,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:54:09,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:54:09,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176723053] [2024-11-08 15:54:09,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:54:09,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:54:09,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:54:09,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:54:09,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:54:09,867 INFO L87 Difference]: Start difference. First operand 152030 states and 201954 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:54:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:54:11,040 INFO L93 Difference]: Finished difference Result 172883 states and 229283 transitions. [2024-11-08 15:54:11,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:54:11,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-11-08 15:54:11,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:54:11,290 INFO L225 Difference]: With dead ends: 172883 [2024-11-08 15:54:11,291 INFO L226 Difference]: Without dead ends: 146219 [2024-11-08 15:54:11,335 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-11-08 15:54:11,336 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 52 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 234 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-11-08 15:54:11,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 234 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:54:11,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146219 states. [2024-11-08 15:54:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146219 to 146217. [2024-11-08 15:54:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146217 states, 146216 states have (on average 1.3107457460195875) internal successors, (191652), 146216 states have internal predecessors, (191652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:54:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146217 states to 146217 states and 191652 transitions. [2024-11-08 15:54:14,127 INFO L78 Accepts]: Start accepts. Automaton has 146217 states and 191652 transitions. Word has length 70 [2024-11-08 15:54:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:54:14,127 INFO L471 AbstractCegarLoop]: Abstraction has 146217 states and 191652 transitions. [2024-11-08 15:54:14,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:54:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 146217 states and 191652 transitions. [2024-11-08 15:54:14,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 15:54:14,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:54:14,133 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, 1, 1] [2024-11-08 15:54:14,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 15:54:14,133 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:54:14,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:54:14,134 INFO L85 PathProgramCache]: Analyzing trace with hash 30251444, now seen corresponding path program 1 times [2024-11-08 15:54:14,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:54:14,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673111351] [2024-11-08 15:54:14,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:54:14,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:54:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:54:14,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 15:54:14,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:54:14,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673111351] [2024-11-08 15:54:14,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673111351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:54:14,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:54:14,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:54:14,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173070854] [2024-11-08 15:54:14,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:54:14,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:54:14,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:54:14,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:54:14,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:54:14,178 INFO L87 Difference]: Start difference. First operand 146217 states and 191652 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:54:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:54:14,744 INFO L93 Difference]: Finished difference Result 241011 states and 316204 transitions. [2024-11-08 15:54:14,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:54:14,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 70 [2024-11-08 15:54:14,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:54:14,865 INFO L225 Difference]: With dead ends: 241011 [2024-11-08 15:54:14,865 INFO L226 Difference]: Without dead ends: 95308 [2024-11-08 15:54:14,946 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-11-08 15:54:14,947 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 81 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:54:14,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 129 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:54:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95308 states. [2024-11-08 15:54:16,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95308 to 95308. [2024-11-08 15:54:16,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95308 states, 95307 states have (on average 1.2988133085712488) internal successors, (123786), 95307 states have internal predecessors, (123786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:54:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95308 states to 95308 states and 123786 transitions. [2024-11-08 15:54:16,476 INFO L78 Accepts]: Start accepts. Automaton has 95308 states and 123786 transitions. Word has length 70 [2024-11-08 15:54:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:54:16,476 INFO L471 AbstractCegarLoop]: Abstraction has 95308 states and 123786 transitions. [2024-11-08 15:54:16,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:54:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 95308 states and 123786 transitions. [2024-11-08 15:54:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 15:54:16,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:54:16,480 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, 1, 1, 1] [2024-11-08 15:54:16,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 15:54:16,480 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:54:16,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:54:16,480 INFO L85 PathProgramCache]: Analyzing trace with hash -570785947, now seen corresponding path program 1 times [2024-11-08 15:54:16,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:54:16,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339487889] [2024-11-08 15:54:16,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:54:16,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:54:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:54:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:54:17,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:54:17,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339487889] [2024-11-08 15:54:17,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339487889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:54:17,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650580460] [2024-11-08 15:54:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:54:17,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:54:17,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:54:17,779 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:54:17,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 15:54:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:54:17,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 15:54:17,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:54:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:54:22,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:54:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:54:23,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650580460] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:54:23,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:54:23,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 17] total 46 [2024-11-08 15:54:23,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830593845] [2024-11-08 15:54:23,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:54:23,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-08 15:54:23,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:54:23,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-08 15:54:23,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1851, Unknown=0, NotChecked=0, Total=2070 [2024-11-08 15:54:23,461 INFO L87 Difference]: Start difference. First operand 95308 states and 123786 transitions. Second operand has 46 states, 46 states have (on average 4.326086956521739) internal successors, (199), 46 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)