./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.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 c5be25d34b5f565c0e61b447a9da3cd9d228084b5ddd898e062981f46972caa8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:30:25,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:30:25,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:30:25,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:30:25,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:30:25,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:30:25,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:30:25,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:30:25,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:30:25,552 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:30:25,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:30:25,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:30:25,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:30:25,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:30:25,555 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:30:25,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:30:25,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:30:25,556 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:30:25,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:30:25,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:30:25,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:30:25,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:30:25,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:30:25,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:30:25,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:30:25,560 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:30:25,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:30:25,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:30:25,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:30:25,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:30:25,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:30:25,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:30:25,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:30:25,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:30:25,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:30:25,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:30:25,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:30:25,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:30:25,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:30:25,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:30:25,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:30:25,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:30:25,566 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 -> c5be25d34b5f565c0e61b447a9da3cd9d228084b5ddd898e062981f46972caa8 [2024-10-14 03:30:25,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:30:25,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:30:25,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:30:25,872 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:30:25,873 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:30:25,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2024-10-14 03:30:27,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:30:27,449 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:30:27,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2024-10-14 03:30:27,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16cd4cfe/2117d6b022544bf1aaf63076c550bd39/FLAGce76400e0 [2024-10-14 03:30:27,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16cd4cfe/2117d6b022544bf1aaf63076c550bd39 [2024-10-14 03:30:27,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:30:27,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:30:27,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:30:27,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:30:27,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:30:27,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:30:27" (1/1) ... [2024-10-14 03:30:27,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bdf2212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:27, skipping insertion in model container [2024-10-14 03:30:27,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:30:27" (1/1) ... [2024-10-14 03:30:27,524 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:30:27,772 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c[9280,9293] [2024-10-14 03:30:27,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:30:27,785 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:30:27,829 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c[9280,9293] [2024-10-14 03:30:27,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:30:27,854 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:30:27,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:27 WrapperNode [2024-10-14 03:30:27,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:30:27,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:30:27,859 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:30:27,859 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:30:27,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:27" (1/1) ... [2024-10-14 03:30:27,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:27" (1/1) ... [2024-10-14 03:30:27,908 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 313 [2024-10-14 03:30:27,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:30:27,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:30:27,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:30:27,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:30:27,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:27" (1/1) ... [2024-10-14 03:30:27,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:27" (1/1) ... [2024-10-14 03:30:27,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:27" (1/1) ... [2024-10-14 03:30:27,937 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:30:27,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:27" (1/1) ... [2024-10-14 03:30:27,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:27" (1/1) ... [2024-10-14 03:30:27,945 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:27" (1/1) ... [2024-10-14 03:30:27,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:27" (1/1) ... [2024-10-14 03:30:27,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:27" (1/1) ... [2024-10-14 03:30:27,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:27" (1/1) ... [2024-10-14 03:30:27,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:30:27,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:30:27,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:30:27,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:30:27,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:27" (1/1) ... [2024-10-14 03:30:27,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:30:27,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:30:28,002 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-10-14 03:30:28,008 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-10-14 03:30:28,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:30:28,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:30:28,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:30:28,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:30:28,155 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:30:28,159 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:30:28,658 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-14 03:30:28,658 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:30:28,699 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:30:28,699 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 03:30:28,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:30:28 BoogieIcfgContainer [2024-10-14 03:30:28,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:30:28,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:30:28,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:30:28,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:30:28,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:30:27" (1/3) ... [2024-10-14 03:30:28,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a24351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:30:28, skipping insertion in model container [2024-10-14 03:30:28,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:30:27" (2/3) ... [2024-10-14 03:30:28,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a24351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:30:28, skipping insertion in model container [2024-10-14 03:30:28,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:30:28" (3/3) ... [2024-10-14 03:30:28,715 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2024-10-14 03:30:28,732 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:30:28,733 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:30:28,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:30:28,798 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;@32f0fcaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:30:28,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:30:28,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 76 states have (on average 1.7763157894736843) internal successors, (135), 77 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:28,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 03:30:28,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:28,813 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] [2024-10-14 03:30:28,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:28,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1762021428, now seen corresponding path program 1 times [2024-10-14 03:30:28,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:28,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497210258] [2024-10-14 03:30:28,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:28,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:29,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:29,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497210258] [2024-10-14 03:30:29,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497210258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:29,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:29,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:30:29,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832241802] [2024-10-14 03:30:29,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:29,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:30:29,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:29,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:30:29,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:30:29,094 INFO L87 Difference]: Start difference. First operand has 78 states, 76 states have (on average 1.7763157894736843) internal successors, (135), 77 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:29,129 INFO L93 Difference]: Finished difference Result 129 states and 218 transitions. [2024-10-14 03:30:29,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:30:29,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-14 03:30:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:29,141 INFO L225 Difference]: With dead ends: 129 [2024-10-14 03:30:29,141 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 03:30:29,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:30:29,148 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:29,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:29,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 03:30:29,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-14 03:30:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.7333333333333334) internal successors, (130), 75 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 130 transitions. [2024-10-14 03:30:29,192 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 130 transitions. Word has length 26 [2024-10-14 03:30:29,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:29,193 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 130 transitions. [2024-10-14 03:30:29,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2024-10-14 03:30:29,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 03:30:29,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:29,194 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] [2024-10-14 03:30:29,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:30:29,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:29,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:29,196 INFO L85 PathProgramCache]: Analyzing trace with hash -43416906, now seen corresponding path program 1 times [2024-10-14 03:30:29,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:29,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271531298] [2024-10-14 03:30:29,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:29,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:29,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:29,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271531298] [2024-10-14 03:30:29,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271531298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:29,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:29,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:30:29,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059997986] [2024-10-14 03:30:29,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:29,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:30:29,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:29,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:30:29,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:30:29,427 INFO L87 Difference]: Start difference. First operand 76 states and 130 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:29,527 INFO L93 Difference]: Finished difference Result 175 states and 289 transitions. [2024-10-14 03:30:29,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:30:29,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-14 03:30:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:29,530 INFO L225 Difference]: With dead ends: 175 [2024-10-14 03:30:29,530 INFO L226 Difference]: Without dead ends: 124 [2024-10-14 03:30:29,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:30:29,532 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 77 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:29,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 348 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:30:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-14 03:30:29,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 76. [2024-10-14 03:30:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 106 transitions. [2024-10-14 03:30:29,542 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 106 transitions. Word has length 26 [2024-10-14 03:30:29,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:29,543 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 106 transitions. [2024-10-14 03:30:29,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 106 transitions. [2024-10-14 03:30:29,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:30:29,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:29,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:29,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:30:29,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:29,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:29,546 INFO L85 PathProgramCache]: Analyzing trace with hash -836453865, now seen corresponding path program 1 times [2024-10-14 03:30:29,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:29,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407229177] [2024-10-14 03:30:29,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:29,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:29,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:29,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407229177] [2024-10-14 03:30:29,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407229177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:29,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:29,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:30:29,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027288829] [2024-10-14 03:30:29,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:29,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:30:29,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:29,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:30:29,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:30:29,795 INFO L87 Difference]: Start difference. First operand 76 states and 106 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:29,951 INFO L93 Difference]: Finished difference Result 316 states and 496 transitions. [2024-10-14 03:30:29,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:30:29,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-14 03:30:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:29,956 INFO L225 Difference]: With dead ends: 316 [2024-10-14 03:30:29,957 INFO L226 Difference]: Without dead ends: 268 [2024-10-14 03:30:29,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:30:29,959 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 715 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:29,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 507 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:30:29,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-14 03:30:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 122. [2024-10-14 03:30:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.4958677685950412) internal successors, (181), 121 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2024-10-14 03:30:29,977 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 181 transitions. Word has length 49 [2024-10-14 03:30:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:29,978 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 181 transitions. [2024-10-14 03:30:29,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:29,979 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2024-10-14 03:30:29,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 03:30:29,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:29,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:29,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:30:29,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:29,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:29,982 INFO L85 PathProgramCache]: Analyzing trace with hash -173296900, now seen corresponding path program 1 times [2024-10-14 03:30:29,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:29,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131315738] [2024-10-14 03:30:29,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:29,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:30,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:30,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131315738] [2024-10-14 03:30:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131315738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:30,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:30,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:30:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227017744] [2024-10-14 03:30:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:30,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:30:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:30,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:30:30,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:30:30,209 INFO L87 Difference]: Start difference. First operand 122 states and 181 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:30,234 INFO L93 Difference]: Finished difference Result 128 states and 188 transitions. [2024-10-14 03:30:30,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:30:30,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-14 03:30:30,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:30,236 INFO L225 Difference]: With dead ends: 128 [2024-10-14 03:30:30,236 INFO L226 Difference]: Without dead ends: 126 [2024-10-14 03:30:30,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:30:30,238 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:30,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-14 03:30:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-14 03:30:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.48) internal successors, (185), 125 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2024-10-14 03:30:30,249 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 50 [2024-10-14 03:30:30,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:30,249 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2024-10-14 03:30:30,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2024-10-14 03:30:30,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 03:30:30,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:30,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:30,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:30:30,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:30,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:30,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1076206113, now seen corresponding path program 1 times [2024-10-14 03:30:30,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:30,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785651864] [2024-10-14 03:30:30,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:30,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:30,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:30,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:30,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785651864] [2024-10-14 03:30:30,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785651864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:30,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:30,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:30,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47409687] [2024-10-14 03:30:30,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:30,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:30,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:30,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:30,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:30,324 INFO L87 Difference]: Start difference. First operand 126 states and 185 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:30,342 INFO L93 Difference]: Finished difference Result 308 states and 475 transitions. [2024-10-14 03:30:30,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:30,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-14 03:30:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:30,344 INFO L225 Difference]: With dead ends: 308 [2024-10-14 03:30:30,344 INFO L226 Difference]: Without dead ends: 210 [2024-10-14 03:30:30,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:30,346 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 47 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:30,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 177 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-14 03:30:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2024-10-14 03:30:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.5217391304347827) internal successors, (315), 207 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 315 transitions. [2024-10-14 03:30:30,356 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 315 transitions. Word has length 51 [2024-10-14 03:30:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:30,357 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 315 transitions. [2024-10-14 03:30:30,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 315 transitions. [2024-10-14 03:30:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 03:30:30,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:30,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:30,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:30:30,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:30,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:30,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1721355813, now seen corresponding path program 1 times [2024-10-14 03:30:30,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:30,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699709212] [2024-10-14 03:30:30,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:30,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:30,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:30,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699709212] [2024-10-14 03:30:30,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699709212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:30,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:30,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:30,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752127813] [2024-10-14 03:30:30,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:30,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:30,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:30,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:30,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:30,438 INFO L87 Difference]: Start difference. First operand 208 states and 315 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:30,465 INFO L93 Difference]: Finished difference Result 392 states and 608 transitions. [2024-10-14 03:30:30,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:30,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-14 03:30:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:30,468 INFO L225 Difference]: With dead ends: 392 [2024-10-14 03:30:30,470 INFO L226 Difference]: Without dead ends: 294 [2024-10-14 03:30:30,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:30,471 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 66 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:30,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 237 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-14 03:30:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2024-10-14 03:30:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.5360824742268042) internal successors, (447), 291 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 447 transitions. [2024-10-14 03:30:30,500 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 447 transitions. Word has length 51 [2024-10-14 03:30:30,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:30,500 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 447 transitions. [2024-10-14 03:30:30,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 447 transitions. [2024-10-14 03:30:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:30:30,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:30,502 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:30,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:30:30,502 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:30,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:30,502 INFO L85 PathProgramCache]: Analyzing trace with hash 963324867, now seen corresponding path program 1 times [2024-10-14 03:30:30,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:30,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28854994] [2024-10-14 03:30:30,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:30,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:30,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:30,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28854994] [2024-10-14 03:30:30,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28854994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:30,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:30,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:30,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968208798] [2024-10-14 03:30:30,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:30,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:30,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:30,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:30,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:30,610 INFO L87 Difference]: Start difference. First operand 292 states and 447 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:30,648 INFO L93 Difference]: Finished difference Result 768 states and 1197 transitions. [2024-10-14 03:30:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:30,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-14 03:30:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:30,654 INFO L225 Difference]: With dead ends: 768 [2024-10-14 03:30:30,654 INFO L226 Difference]: Without dead ends: 506 [2024-10-14 03:30:30,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:30,659 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 54 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:30,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 209 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:30,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-10-14 03:30:30,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2024-10-14 03:30:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 1.536779324055666) internal successors, (773), 503 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 773 transitions. [2024-10-14 03:30:30,687 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 773 transitions. Word has length 52 [2024-10-14 03:30:30,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:30,688 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 773 transitions. [2024-10-14 03:30:30,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 773 transitions. [2024-10-14 03:30:30,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:30:30,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:30,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:30,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:30:30,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:30,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:30,692 INFO L85 PathProgramCache]: Analyzing trace with hash 489596131, now seen corresponding path program 1 times [2024-10-14 03:30:30,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:30,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757731176] [2024-10-14 03:30:30,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:30,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:30,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757731176] [2024-10-14 03:30:30,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757731176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:30,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:30,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:30,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681118464] [2024-10-14 03:30:30,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:30,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:30,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:30,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:30,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:30,785 INFO L87 Difference]: Start difference. First operand 504 states and 773 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:30,825 INFO L93 Difference]: Finished difference Result 1356 states and 2091 transitions. [2024-10-14 03:30:30,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:30,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-14 03:30:30,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:30,830 INFO L225 Difference]: With dead ends: 1356 [2024-10-14 03:30:30,831 INFO L226 Difference]: Without dead ends: 882 [2024-10-14 03:30:30,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:30,833 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 58 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:30,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 222 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-14 03:30:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 880. [2024-10-14 03:30:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 1.5187713310580204) internal successors, (1335), 879 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1335 transitions. [2024-10-14 03:30:30,868 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1335 transitions. Word has length 52 [2024-10-14 03:30:30,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:30,869 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1335 transitions. [2024-10-14 03:30:30,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1335 transitions. [2024-10-14 03:30:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:30:30,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:30,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:30,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:30:30,870 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:30,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:30,871 INFO L85 PathProgramCache]: Analyzing trace with hash 307269123, now seen corresponding path program 1 times [2024-10-14 03:30:30,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:30,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402799188] [2024-10-14 03:30:30,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:30,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:30,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:30,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402799188] [2024-10-14 03:30:30,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402799188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:30,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:30,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:30,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753506179] [2024-10-14 03:30:30,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:30,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:30,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:30,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:30,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:30,950 INFO L87 Difference]: Start difference. First operand 880 states and 1335 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:30,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:31,001 INFO L93 Difference]: Finished difference Result 2388 states and 3609 transitions. [2024-10-14 03:30:31,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:31,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-14 03:30:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:31,007 INFO L225 Difference]: With dead ends: 2388 [2024-10-14 03:30:31,008 INFO L226 Difference]: Without dead ends: 1538 [2024-10-14 03:30:31,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:31,010 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 62 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:31,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 235 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:31,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2024-10-14 03:30:31,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1536. [2024-10-14 03:30:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1535 states have (on average 1.4846905537459283) internal successors, (2279), 1535 states have internal predecessors, (2279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 2279 transitions. [2024-10-14 03:30:31,068 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 2279 transitions. Word has length 52 [2024-10-14 03:30:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:31,068 INFO L471 AbstractCegarLoop]: Abstraction has 1536 states and 2279 transitions. [2024-10-14 03:30:31,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2279 transitions. [2024-10-14 03:30:31,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 03:30:31,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:31,070 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:31,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:30:31,070 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:31,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:31,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1749415936, now seen corresponding path program 1 times [2024-10-14 03:30:31,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:31,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292026138] [2024-10-14 03:30:31,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:31,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:31,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:31,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292026138] [2024-10-14 03:30:31,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292026138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:31,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:31,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:31,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730219446] [2024-10-14 03:30:31,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:31,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:31,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:31,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:31,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:31,218 INFO L87 Difference]: Start difference. First operand 1536 states and 2279 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:31,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:31,263 INFO L93 Difference]: Finished difference Result 3044 states and 4529 transitions. [2024-10-14 03:30:31,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:31,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-14 03:30:31,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:31,269 INFO L225 Difference]: With dead ends: 3044 [2024-10-14 03:30:31,269 INFO L226 Difference]: Without dead ends: 1538 [2024-10-14 03:30:31,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:31,272 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 52 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:31,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 224 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2024-10-14 03:30:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1536. [2024-10-14 03:30:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1535 states have (on average 1.4690553745928339) internal successors, (2255), 1535 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:31,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 2255 transitions. [2024-10-14 03:30:31,318 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 2255 transitions. Word has length 73 [2024-10-14 03:30:31,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:31,319 INFO L471 AbstractCegarLoop]: Abstraction has 1536 states and 2255 transitions. [2024-10-14 03:30:31,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:31,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2255 transitions. [2024-10-14 03:30:31,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 03:30:31,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:31,321 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:31,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:30:31,321 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:31,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:31,322 INFO L85 PathProgramCache]: Analyzing trace with hash -422196063, now seen corresponding path program 1 times [2024-10-14 03:30:31,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:31,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329482630] [2024-10-14 03:30:31,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:31,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:31,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:31,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329482630] [2024-10-14 03:30:31,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329482630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:31,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:31,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:31,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759064909] [2024-10-14 03:30:31,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:31,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:31,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:31,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:31,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:31,473 INFO L87 Difference]: Start difference. First operand 1536 states and 2255 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:31,508 INFO L93 Difference]: Finished difference Result 2292 states and 3369 transitions. [2024-10-14 03:30:31,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:31,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-14 03:30:31,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:31,512 INFO L225 Difference]: With dead ends: 2292 [2024-10-14 03:30:31,513 INFO L226 Difference]: Without dead ends: 786 [2024-10-14 03:30:31,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:31,516 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 46 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:31,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 205 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:31,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-10-14 03:30:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 784. [2024-10-14 03:30:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 783 states have (on average 1.4444444444444444) internal successors, (1131), 783 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1131 transitions. [2024-10-14 03:30:31,537 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1131 transitions. Word has length 73 [2024-10-14 03:30:31,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:31,538 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1131 transitions. [2024-10-14 03:30:31,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1131 transitions. [2024-10-14 03:30:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 03:30:31,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:31,540 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:31,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:30:31,542 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:31,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash 84089282, now seen corresponding path program 1 times [2024-10-14 03:30:31,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:31,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827438523] [2024-10-14 03:30:31,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:31,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:31,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:31,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827438523] [2024-10-14 03:30:31,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827438523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:31,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:31,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:31,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528976307] [2024-10-14 03:30:31,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:31,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:31,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:31,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:31,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:31,645 INFO L87 Difference]: Start difference. First operand 784 states and 1131 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:31,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:31,673 INFO L93 Difference]: Finished difference Result 1164 states and 1683 transitions. [2024-10-14 03:30:31,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:31,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-14 03:30:31,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:31,676 INFO L225 Difference]: With dead ends: 1164 [2024-10-14 03:30:31,676 INFO L226 Difference]: Without dead ends: 410 [2024-10-14 03:30:31,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:31,681 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 40 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:31,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 186 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:31,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-14 03:30:31,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2024-10-14 03:30:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.4127764127764129) internal successors, (575), 407 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 575 transitions. [2024-10-14 03:30:31,694 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 575 transitions. Word has length 73 [2024-10-14 03:30:31,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:31,695 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 575 transitions. [2024-10-14 03:30:31,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 575 transitions. [2024-10-14 03:30:31,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 03:30:31,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:31,696 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, 1, 1, 1] [2024-10-14 03:30:31,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:30:31,696 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:31,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:31,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2036211555, now seen corresponding path program 1 times [2024-10-14 03:30:31,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:31,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84384237] [2024-10-14 03:30:31,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:31,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:33,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:33,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84384237] [2024-10-14 03:30:33,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84384237] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:30:33,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043599688] [2024-10-14 03:30:33,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:33,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:30:33,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:30:33,617 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-10-14 03:30:33,618 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-10-14 03:30:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:33,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 03:30:33,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:30:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:34,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:30:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:34,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043599688] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:30:34,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:30:34,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 23 [2024-10-14 03:30:34,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103098855] [2024-10-14 03:30:34,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:30:34,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 03:30:34,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:34,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 03:30:34,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:30:34,996 INFO L87 Difference]: Start difference. First operand 408 states and 575 transitions. Second operand has 23 states, 23 states have (on average 9.173913043478262) internal successors, (211), 23 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:43,484 INFO L93 Difference]: Finished difference Result 3987 states and 5537 transitions. [2024-10-14 03:30:43,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2024-10-14 03:30:43,485 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.173913043478262) internal successors, (211), 23 states have internal predecessors, (211), 0 states have call successors, (0), 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 73 [2024-10-14 03:30:43,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:43,497 INFO L225 Difference]: With dead ends: 3987 [2024-10-14 03:30:43,498 INFO L226 Difference]: Without dead ends: 3609 [2024-10-14 03:30:43,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6843 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2871, Invalid=15761, Unknown=0, NotChecked=0, Total=18632 [2024-10-14 03:30:43,504 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 6172 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6172 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:43,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6172 Valid, 1659 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1784 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 03:30:43,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3609 states. [2024-10-14 03:30:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3609 to 2221. [2024-10-14 03:30:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2221 states, 2220 states have (on average 1.3936936936936937) internal successors, (3094), 2220 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 3094 transitions. [2024-10-14 03:30:43,603 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 3094 transitions. Word has length 73 [2024-10-14 03:30:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:43,603 INFO L471 AbstractCegarLoop]: Abstraction has 2221 states and 3094 transitions. [2024-10-14 03:30:43,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.173913043478262) internal successors, (211), 23 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 3094 transitions. [2024-10-14 03:30:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:30:43,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:43,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:43,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:30:43,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 03:30:43,809 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:43,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash 204855425, now seen corresponding path program 1 times [2024-10-14 03:30:43,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:43,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385339468] [2024-10-14 03:30:43,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:43,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:30:43,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385339468] [2024-10-14 03:30:43,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385339468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:43,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:43,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:30:43,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004019494] [2024-10-14 03:30:43,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:43,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:30:43,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:43,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:30:43,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:30:43,930 INFO L87 Difference]: Start difference. First operand 2221 states and 3094 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:44,110 INFO L93 Difference]: Finished difference Result 6505 states and 9174 transitions. [2024-10-14 03:30:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:30:44,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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 74 [2024-10-14 03:30:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:44,131 INFO L225 Difference]: With dead ends: 6505 [2024-10-14 03:30:44,131 INFO L226 Difference]: Without dead ends: 5430 [2024-10-14 03:30:44,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:30:44,136 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 498 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:44,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 651 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:44,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5430 states. [2024-10-14 03:30:44,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5430 to 3262. [2024-10-14 03:30:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3262 states, 3261 states have (on average 1.3879178166206685) internal successors, (4526), 3261 states have internal predecessors, (4526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4526 transitions. [2024-10-14 03:30:44,292 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4526 transitions. Word has length 74 [2024-10-14 03:30:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:44,292 INFO L471 AbstractCegarLoop]: Abstraction has 3262 states and 4526 transitions. [2024-10-14 03:30:44,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:44,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4526 transitions. [2024-10-14 03:30:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:30:44,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:44,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:44,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:30:44,294 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:44,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:44,294 INFO L85 PathProgramCache]: Analyzing trace with hash 704207684, now seen corresponding path program 1 times [2024-10-14 03:30:44,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:44,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842527641] [2024-10-14 03:30:44,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:44,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:30:44,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:44,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842527641] [2024-10-14 03:30:44,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842527641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:44,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:44,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:30:44,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997168380] [2024-10-14 03:30:44,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:44,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:30:44,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:44,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:30:44,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:30:44,412 INFO L87 Difference]: Start difference. First operand 3262 states and 4526 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:44,596 INFO L93 Difference]: Finished difference Result 7546 states and 10606 transitions. [2024-10-14 03:30:44,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:30:44,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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 74 [2024-10-14 03:30:44,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:44,616 INFO L225 Difference]: With dead ends: 7546 [2024-10-14 03:30:44,617 INFO L226 Difference]: Without dead ends: 6471 [2024-10-14 03:30:44,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:30:44,621 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 499 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:44,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 571 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6471 states. [2024-10-14 03:30:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6471 to 4310. [2024-10-14 03:30:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4310 states, 4309 states have (on average 1.3852401949408215) internal successors, (5969), 4309 states have internal predecessors, (5969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 5969 transitions. [2024-10-14 03:30:44,826 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 5969 transitions. Word has length 74 [2024-10-14 03:30:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:44,826 INFO L471 AbstractCegarLoop]: Abstraction has 4310 states and 5969 transitions. [2024-10-14 03:30:44,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 5969 transitions. [2024-10-14 03:30:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:30:44,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:44,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:44,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:30:44,828 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:44,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:44,828 INFO L85 PathProgramCache]: Analyzing trace with hash 523355902, now seen corresponding path program 1 times [2024-10-14 03:30:44,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:44,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118327966] [2024-10-14 03:30:44,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:44,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 03:30:44,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:44,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118327966] [2024-10-14 03:30:44,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118327966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:44,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:44,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:30:44,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927851295] [2024-10-14 03:30:44,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:44,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:30:44,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:44,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:30:44,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:30:44,943 INFO L87 Difference]: Start difference. First operand 4310 states and 5969 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-10-14 03:30:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:45,224 INFO L93 Difference]: Finished difference Result 8587 states and 12038 transitions. [2024-10-14 03:30:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:30:45,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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 74 [2024-10-14 03:30:45,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:45,255 INFO L225 Difference]: With dead ends: 8587 [2024-10-14 03:30:45,256 INFO L226 Difference]: Without dead ends: 7512 [2024-10-14 03:30:45,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:30:45,260 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 493 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:45,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 627 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:30:45,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7512 states. [2024-10-14 03:30:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7512 to 5337. [2024-10-14 03:30:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5337 states, 5336 states have (on average 1.3828710644677662) internal successors, (7379), 5336 states have internal predecessors, (7379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5337 states to 5337 states and 7379 transitions. [2024-10-14 03:30:45,474 INFO L78 Accepts]: Start accepts. Automaton has 5337 states and 7379 transitions. Word has length 74 [2024-10-14 03:30:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:45,475 INFO L471 AbstractCegarLoop]: Abstraction has 5337 states and 7379 transitions. [2024-10-14 03:30:45,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-10-14 03:30:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 5337 states and 7379 transitions. [2024-10-14 03:30:45,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:30:45,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:45,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:45,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:30:45,479 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:45,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:45,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1147855616, now seen corresponding path program 1 times [2024-10-14 03:30:45,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:45,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472298930] [2024-10-14 03:30:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:45,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:30:45,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:45,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472298930] [2024-10-14 03:30:45,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472298930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:45,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:45,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:30:45,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031613602] [2024-10-14 03:30:45,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:45,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:30:45,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:45,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:30:45,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:30:45,582 INFO L87 Difference]: Start difference. First operand 5337 states and 7379 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:45,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:45,850 INFO L93 Difference]: Finished difference Result 9614 states and 13448 transitions. [2024-10-14 03:30:45,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:30:45,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 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 74 [2024-10-14 03:30:45,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:45,865 INFO L225 Difference]: With dead ends: 9614 [2024-10-14 03:30:45,866 INFO L226 Difference]: Without dead ends: 8539 [2024-10-14 03:30:45,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:30:45,871 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 438 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:45,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 705 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:45,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8539 states. [2024-10-14 03:30:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8539 to 6378. [2024-10-14 03:30:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6378 states, 6377 states have (on average 1.3816841775129372) internal successors, (8811), 6377 states have internal predecessors, (8811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6378 states to 6378 states and 8811 transitions. [2024-10-14 03:30:46,140 INFO L78 Accepts]: Start accepts. Automaton has 6378 states and 8811 transitions. Word has length 74 [2024-10-14 03:30:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:46,140 INFO L471 AbstractCegarLoop]: Abstraction has 6378 states and 8811 transitions. [2024-10-14 03:30:46,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:46,141 INFO L276 IsEmpty]: Start isEmpty. Operand 6378 states and 8811 transitions. [2024-10-14 03:30:46,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 03:30:46,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:46,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:46,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:30:46,142 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:46,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2099787166, now seen corresponding path program 1 times [2024-10-14 03:30:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:46,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940803964] [2024-10-14 03:30:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:46,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:46,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:46,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940803964] [2024-10-14 03:30:46,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940803964] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:30:46,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570653457] [2024-10-14 03:30:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:46,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:30:46,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:30:46,504 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-10-14 03:30:46,505 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-10-14 03:30:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:46,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 03:30:46,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:30:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:47,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:30:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:48,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570653457] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:30:48,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:30:48,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 15] total 34 [2024-10-14 03:30:48,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792591683] [2024-10-14 03:30:48,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:30:48,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-14 03:30:48,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:48,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-14 03:30:48,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 03:30:48,749 INFO L87 Difference]: Start difference. First operand 6378 states and 8811 transitions. Second operand has 35 states, 35 states have (on average 5.914285714285715) internal successors, (207), 34 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:56,479 INFO L93 Difference]: Finished difference Result 42593 states and 59273 transitions. [2024-10-14 03:30:56,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2024-10-14 03:30:56,480 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.914285714285715) internal successors, (207), 34 states have internal predecessors, (207), 0 states have call successors, (0), 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 77 [2024-10-14 03:30:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:56,545 INFO L225 Difference]: With dead ends: 42593 [2024-10-14 03:30:56,545 INFO L226 Difference]: Without dead ends: 36324 [2024-10-14 03:30:56,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8284 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4092, Invalid=19470, Unknown=0, NotChecked=0, Total=23562 [2024-10-14 03:30:56,567 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 6872 mSDsluCounter, 2285 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6872 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 2312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:56,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6872 Valid, 2444 Invalid, 2312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:30:56,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36324 states. [2024-10-14 03:30:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36324 to 21546. [2024-10-14 03:30:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21546 states, 21545 states have (on average 1.3632397307960085) internal successors, (29371), 21545 states have internal predecessors, (29371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21546 states to 21546 states and 29371 transitions. [2024-10-14 03:30:57,571 INFO L78 Accepts]: Start accepts. Automaton has 21546 states and 29371 transitions. Word has length 77 [2024-10-14 03:30:57,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:57,572 INFO L471 AbstractCegarLoop]: Abstraction has 21546 states and 29371 transitions. [2024-10-14 03:30:57,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.914285714285715) internal successors, (207), 34 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand 21546 states and 29371 transitions. [2024-10-14 03:30:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 03:30:57,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:57,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:57,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 03:30:57,778 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,SelfDestructingSolverStorable17 [2024-10-14 03:30:57,779 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:57,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:57,779 INFO L85 PathProgramCache]: Analyzing trace with hash -55232738, now seen corresponding path program 1 times [2024-10-14 03:30:57,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:57,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873960185] [2024-10-14 03:30:57,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:57,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:30:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:30:57,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:30:57,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873960185] [2024-10-14 03:30:57,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873960185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:30:57,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:30:57,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:30:57,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510584216] [2024-10-14 03:30:57,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:30:57,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:30:57,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:30:57,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:30:57,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:57,830 INFO L87 Difference]: Start difference. First operand 21546 states and 29371 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:30:58,796 INFO L93 Difference]: Finished difference Result 53192 states and 72485 transitions. [2024-10-14 03:30:58,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:30:58,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-14 03:30:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:30:58,862 INFO L225 Difference]: With dead ends: 53192 [2024-10-14 03:30:58,862 INFO L226 Difference]: Without dead ends: 31799 [2024-10-14 03:30:59,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:30:59,005 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 48 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:30:59,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 241 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:30:59,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31799 states. [2024-10-14 03:30:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31799 to 29115. [2024-10-14 03:30:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29115 states, 29114 states have (on average 1.3488012639967026) internal successors, (39269), 29114 states have internal predecessors, (39269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29115 states to 29115 states and 39269 transitions. [2024-10-14 03:30:59,929 INFO L78 Accepts]: Start accepts. Automaton has 29115 states and 39269 transitions. Word has length 77 [2024-10-14 03:30:59,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:30:59,930 INFO L471 AbstractCegarLoop]: Abstraction has 29115 states and 39269 transitions. [2024-10-14 03:30:59,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:30:59,930 INFO L276 IsEmpty]: Start isEmpty. Operand 29115 states and 39269 transitions. [2024-10-14 03:30:59,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 03:30:59,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:30:59,932 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:30:59,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:30:59,932 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:30:59,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:30:59,933 INFO L85 PathProgramCache]: Analyzing trace with hash -789037125, now seen corresponding path program 1 times [2024-10-14 03:30:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:30:59,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697877362] [2024-10-14 03:30:59,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:30:59,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:30:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:00,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:00,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:00,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697877362] [2024-10-14 03:31:00,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697877362] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:31:00,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93151866] [2024-10-14 03:31:00,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:00,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:31:00,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:31:00,330 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-10-14 03:31:00,332 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-10-14 03:31:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:00,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 03:31:00,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:31:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:00,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:31:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:01,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93151866] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:31:01,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:31:01,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-10-14 03:31:01,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847500010] [2024-10-14 03:31:01,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:31:01,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 03:31:01,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:01,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 03:31:01,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-10-14 03:31:01,726 INFO L87 Difference]: Start difference. First operand 29115 states and 39269 transitions. Second operand has 19 states, 19 states have (on average 8.31578947368421) internal successors, (158), 18 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:04,031 INFO L93 Difference]: Finished difference Result 93416 states and 125620 transitions. [2024-10-14 03:31:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:31:04,032 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.31578947368421) internal successors, (158), 18 states have internal predecessors, (158), 0 states have call successors, (0), 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 77 [2024-10-14 03:31:04,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:04,137 INFO L225 Difference]: With dead ends: 93416 [2024-10-14 03:31:04,138 INFO L226 Difference]: Without dead ends: 64630 [2024-10-14 03:31:04,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=653, Unknown=0, NotChecked=0, Total=870 [2024-10-14 03:31:04,186 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 988 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:04,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 672 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:31:04,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64630 states. [2024-10-14 03:31:06,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64630 to 58132. [2024-10-14 03:31:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58132 states, 58131 states have (on average 1.3462180248060416) internal successors, (78257), 58131 states have internal predecessors, (78257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58132 states to 58132 states and 78257 transitions. [2024-10-14 03:31:06,588 INFO L78 Accepts]: Start accepts. Automaton has 58132 states and 78257 transitions. Word has length 77 [2024-10-14 03:31:06,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:06,588 INFO L471 AbstractCegarLoop]: Abstraction has 58132 states and 78257 transitions. [2024-10-14 03:31:06,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.31578947368421) internal successors, (158), 18 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:06,589 INFO L276 IsEmpty]: Start isEmpty. Operand 58132 states and 78257 transitions. [2024-10-14 03:31:06,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:31:06,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:06,591 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:06,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 03:31:06,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:31:06,793 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:06,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:06,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1566484629, now seen corresponding path program 1 times [2024-10-14 03:31:06,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:06,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487442686] [2024-10-14 03:31:06,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:06,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:06,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:06,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487442686] [2024-10-14 03:31:06,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487442686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:31:06,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:31:06,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:31:06,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283237907] [2024-10-14 03:31:06,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:31:06,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:31:06,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:06,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:31:06,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:31:06,857 INFO L87 Difference]: Start difference. First operand 58132 states and 78257 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:09,706 INFO L93 Difference]: Finished difference Result 133134 states and 178899 transitions. [2024-10-14 03:31:09,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:31:09,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-14 03:31:09,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:09,842 INFO L225 Difference]: With dead ends: 133134 [2024-10-14 03:31:09,842 INFO L226 Difference]: Without dead ends: 75555 [2024-10-14 03:31:10,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:31:10,008 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 48 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:10,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 204 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:31:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75555 states. [2024-10-14 03:31:12,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75555 to 75553. [2024-10-14 03:31:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75553 states, 75552 states have (on average 1.3227975434138077) internal successors, (99940), 75552 states have internal predecessors, (99940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75553 states to 75553 states and 99940 transitions. [2024-10-14 03:31:13,200 INFO L78 Accepts]: Start accepts. Automaton has 75553 states and 99940 transitions. Word has length 78 [2024-10-14 03:31:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:13,201 INFO L471 AbstractCegarLoop]: Abstraction has 75553 states and 99940 transitions. [2024-10-14 03:31:13,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:13,201 INFO L276 IsEmpty]: Start isEmpty. Operand 75553 states and 99940 transitions. [2024-10-14 03:31:13,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:31:13,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:13,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:13,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:31:13,205 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:13,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:13,206 INFO L85 PathProgramCache]: Analyzing trace with hash 384090759, now seen corresponding path program 1 times [2024-10-14 03:31:13,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:13,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912171739] [2024-10-14 03:31:13,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:13,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:13,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:13,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912171739] [2024-10-14 03:31:13,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912171739] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:31:13,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775988677] [2024-10-14 03:31:13,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:13,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:31:13,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:31:13,952 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-10-14 03:31:13,953 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-10-14 03:31:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:14,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 03:31:14,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:31:14,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:14,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:31:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:15,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775988677] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:31:15,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:31:15,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 39 [2024-10-14 03:31:15,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515235661] [2024-10-14 03:31:15,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:31:15,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-14 03:31:15,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:15,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-14 03:31:15,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1396, Unknown=0, NotChecked=0, Total=1560 [2024-10-14 03:31:15,948 INFO L87 Difference]: Start difference. First operand 75553 states and 99940 transitions. Second operand has 40 states, 40 states have (on average 5.375) internal successors, (215), 39 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)