./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.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 890f1e18995284b0a908a97d5deeec0465d64ba29b3115b90de791926566ed26 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:55:02,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:55:02,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:55:02,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:55:02,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:55:02,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:55:02,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:55:02,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:55:02,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:55:02,266 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:55:02,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:55:02,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:55:02,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:55:02,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:55:02,268 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:55:02,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:55:02,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:55:02,269 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:55:02,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:55:02,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:55:02,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:55:02,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:55:02,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:55:02,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:55:02,274 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:55:02,274 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:55:02,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:55:02,275 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:55:02,275 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:55:02,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:55:02,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:55:02,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:55:02,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:55:02,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:55:02,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:55:02,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:55:02,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:55:02,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:55:02,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:55:02,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:55:02,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:55:02,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:55:02,282 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 -> 890f1e18995284b0a908a97d5deeec0465d64ba29b3115b90de791926566ed26 [2024-11-10 00:55:02,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:55:02,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:55:02,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:55:02,546 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:55:02,547 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:55:02,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c [2024-11-10 00:55:04,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:55:04,494 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:55:04,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c [2024-11-10 00:55:04,525 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2db2bc57b/84c06459da994494a3b01d00328d7d24/FLAG2dd38bb13 [2024-11-10 00:55:04,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2db2bc57b/84c06459da994494a3b01d00328d7d24 [2024-11-10 00:55:04,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:55:04,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:55:04,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:55:04,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:55:04,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:55:04,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:55:04" (1/1) ... [2024-11-10 00:55:04,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4799a03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:04, skipping insertion in model container [2024-11-10 00:55:04,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:55:04" (1/1) ... [2024-11-10 00:55:04,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:55:05,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c[11668,11681] [2024-11-10 00:55:05,069 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c[13543,13556] [2024-11-10 00:55:05,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:55:05,764 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:55:05,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c[11668,11681] [2024-11-10 00:55:05,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c[13543,13556] [2024-11-10 00:55:06,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:55:06,349 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:55:06,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:06 WrapperNode [2024-11-10 00:55:06,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:55:06,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:55:06,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:55:06,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:55:06,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:06" (1/1) ... [2024-11-10 00:55:06,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:06" (1/1) ... [2024-11-10 00:55:06,711 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5095 [2024-11-10 00:55:06,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:55:06,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:55:06,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:55:06,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:55:06,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:06" (1/1) ... [2024-11-10 00:55:06,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:06" (1/1) ... [2024-11-10 00:55:06,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:06" (1/1) ... [2024-11-10 00:55:07,068 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 00:55:07,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:06" (1/1) ... [2024-11-10 00:55:07,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:06" (1/1) ... [2024-11-10 00:55:07,243 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:06" (1/1) ... [2024-11-10 00:55:07,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:06" (1/1) ... [2024-11-10 00:55:07,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:06" (1/1) ... [2024-11-10 00:55:07,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:06" (1/1) ... [2024-11-10 00:55:07,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:55:07,390 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:55:07,390 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:55:07,390 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:55:07,392 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:06" (1/1) ... [2024-11-10 00:55:07,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:55:07,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:07,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 00:55:07,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 00:55:07,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:55:07,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:55:07,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:55:07,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:55:07,610 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:55:07,613 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:55:13,019 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: havoc calculate_output_#t~ret37#1; [2024-11-10 00:55:13,019 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc calculate_output2_#t~ret38#1; [2024-11-10 00:55:13,019 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5098: havoc calculate_output3_#t~ret39#1; [2024-11-10 00:55:13,253 INFO L? ?]: Removed 2081 outVars from TransFormulas that were not future-live. [2024-11-10 00:55:13,253 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:55:13,295 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:55:13,297 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:55:13,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:55:13 BoogieIcfgContainer [2024-11-10 00:55:13,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:55:13,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:55:13,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:55:13,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:55:13,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:55:04" (1/3) ... [2024-11-10 00:55:13,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5b1400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:55:13, skipping insertion in model container [2024-11-10 00:55:13,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:55:06" (2/3) ... [2024-11-10 00:55:13,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5b1400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:55:13, skipping insertion in model container [2024-11-10 00:55:13,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:55:13" (3/3) ... [2024-11-10 00:55:13,308 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label00.c [2024-11-10 00:55:13,324 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:55:13,324 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:55:13,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:55:13,431 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;@73ac7db5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:55:13,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:55:13,445 INFO L276 IsEmpty]: Start isEmpty. Operand has 908 states, 905 states have (on average 2.648618784530387) internal successors, (2397), 907 states have internal predecessors, (2397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 00:55:13,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:13,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:13,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:13,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:13,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1440305943, now seen corresponding path program 1 times [2024-11-10 00:55:13,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:13,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509733730] [2024-11-10 00:55:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:13,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:13,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:13,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509733730] [2024-11-10 00:55:13,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509733730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:13,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:13,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:55:13,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244602810] [2024-11-10 00:55:13,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:13,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:13,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:13,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:13,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:13,833 INFO L87 Difference]: Start difference. First operand has 908 states, 905 states have (on average 2.648618784530387) internal successors, (2397), 907 states have internal predecessors, (2397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:18,494 INFO L93 Difference]: Finished difference Result 2531 states and 6903 transitions. [2024-11-10 00:55:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:18,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-10 00:55:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:18,522 INFO L225 Difference]: With dead ends: 2531 [2024-11-10 00:55:18,522 INFO L226 Difference]: Without dead ends: 1592 [2024-11-10 00:55:18,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:18,535 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 1703 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3797 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 4568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 3797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:18,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 303 Invalid, 4568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 3797 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-10 00:55:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-10 00:55:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1592. [2024-11-10 00:55:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1590 states have (on average 2.6930817610062894) internal successors, (4282), 1591 states have internal predecessors, (4282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 4282 transitions. [2024-11-10 00:55:18,648 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 4282 transitions. Word has length 18 [2024-11-10 00:55:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:18,649 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 4282 transitions. [2024-11-10 00:55:18,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 4282 transitions. [2024-11-10 00:55:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 00:55:18,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:18,651 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-11-10 00:55:18,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:55:18,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:18,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:18,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1789896393, now seen corresponding path program 1 times [2024-11-10 00:55:18,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:18,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756763751] [2024-11-10 00:55:18,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:18,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:18,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:18,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756763751] [2024-11-10 00:55:18,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756763751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:18,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:18,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:55:18,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896834217] [2024-11-10 00:55:18,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:18,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:55:18,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:18,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:55:18,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:55:18,883 INFO L87 Difference]: Start difference. First operand 1592 states and 4282 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-11-10 00:55:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:18,979 INFO L93 Difference]: Finished difference Result 1643 states and 4359 transitions. [2024-11-10 00:55:18,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:55:18,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-11-10 00:55:18,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:18,989 INFO L225 Difference]: With dead ends: 1643 [2024-11-10 00:55:18,989 INFO L226 Difference]: Without dead ends: 1592 [2024-11-10 00:55:18,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:55:18,991 INFO L432 NwaCegarLoop]: 2260 mSDtfsCounter, 0 mSDsluCounter, 6744 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9004 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:18,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9004 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:18,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-10 00:55:19,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1592. [2024-11-10 00:55:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1590 states have (on average 2.6735849056603773) internal successors, (4251), 1591 states have internal predecessors, (4251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 4251 transitions. [2024-11-10 00:55:19,043 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 4251 transitions. Word has length 26 [2024-11-10 00:55:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:19,043 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 4251 transitions. [2024-11-10 00:55:19,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-11-10 00:55:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 4251 transitions. [2024-11-10 00:55:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 00:55:19,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:19,046 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, 1, 1, 1, 1] [2024-11-10 00:55:19,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:55:19,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:19,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:19,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1922131449, now seen corresponding path program 1 times [2024-11-10 00:55:19,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:19,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130998985] [2024-11-10 00:55:19,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:19,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:19,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:19,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130998985] [2024-11-10 00:55:19,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130998985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:19,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718780213] [2024-11-10 00:55:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:19,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:19,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:19,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:19,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:19,333 INFO L87 Difference]: Start difference. First operand 1592 states and 4251 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:19,621 INFO L93 Difference]: Finished difference Result 2062 states and 4981 transitions. [2024-11-10 00:55:19,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 00:55:19,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-10 00:55:19,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:19,633 INFO L225 Difference]: With dead ends: 2062 [2024-11-10 00:55:19,633 INFO L226 Difference]: Without dead ends: 2015 [2024-11-10 00:55:19,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-10 00:55:19,638 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 11419 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11419 SdHoareTripleChecker+Valid, 3435 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:19,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11419 Valid, 3435 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-11-10 00:55:19,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1636. [2024-11-10 00:55:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1634 states have (on average 2.6438188494492043) internal successors, (4320), 1635 states have internal predecessors, (4320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 4320 transitions. [2024-11-10 00:55:19,690 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 4320 transitions. Word has length 56 [2024-11-10 00:55:19,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:19,691 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 4320 transitions. [2024-11-10 00:55:19,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 4320 transitions. [2024-11-10 00:55:19,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:55:19,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:19,694 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, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:19,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:55:19,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:19,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:19,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1673221541, now seen corresponding path program 1 times [2024-11-10 00:55:19,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:19,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801648017] [2024-11-10 00:55:19,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:19,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:20,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:20,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801648017] [2024-11-10 00:55:20,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801648017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:20,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:20,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:20,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351074689] [2024-11-10 00:55:20,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:20,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:20,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:20,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:20,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:20,105 INFO L87 Difference]: Start difference. First operand 1636 states and 4320 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:20,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:20,306 INFO L93 Difference]: Finished difference Result 1730 states and 4464 transitions. [2024-11-10 00:55:20,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:20,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:55:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:20,316 INFO L225 Difference]: With dead ends: 1730 [2024-11-10 00:55:20,316 INFO L226 Difference]: Without dead ends: 1639 [2024-11-10 00:55:20,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-10 00:55:20,318 INFO L432 NwaCegarLoop]: 2224 mSDtfsCounter, 6540 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6540 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:20,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6540 Valid, 2501 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:20,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-11-10 00:55:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1636. [2024-11-10 00:55:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1634 states have (on average 2.6432068543451654) internal successors, (4319), 1635 states have internal predecessors, (4319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 4319 transitions. [2024-11-10 00:55:20,360 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 4319 transitions. Word has length 58 [2024-11-10 00:55:20,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:20,363 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 4319 transitions. [2024-11-10 00:55:20,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 4319 transitions. [2024-11-10 00:55:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 00:55:20,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:20,367 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:20,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:55:20,368 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:20,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:20,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1393558986, now seen corresponding path program 1 times [2024-11-10 00:55:20,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:20,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245374382] [2024-11-10 00:55:20,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:20,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:20,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:20,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245374382] [2024-11-10 00:55:20,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245374382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:20,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:20,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:20,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338497007] [2024-11-10 00:55:20,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:20,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:20,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:20,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:20,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:20,488 INFO L87 Difference]: Start difference. First operand 1636 states and 4319 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:20,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:20,529 INFO L93 Difference]: Finished difference Result 1806 states and 4581 transitions. [2024-11-10 00:55:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:20,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-10 00:55:20,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:20,538 INFO L225 Difference]: With dead ends: 1806 [2024-11-10 00:55:20,538 INFO L226 Difference]: Without dead ends: 1715 [2024-11-10 00:55:20,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:20,540 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2168 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2168 SdHoareTripleChecker+Valid, 2293 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:20,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2168 Valid, 2293 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:20,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2024-11-10 00:55:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1710. [2024-11-10 00:55:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1708 states have (on average 2.5942622950819674) internal successors, (4431), 1709 states have internal predecessors, (4431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 4431 transitions. [2024-11-10 00:55:20,582 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 4431 transitions. Word has length 59 [2024-11-10 00:55:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:20,583 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 4431 transitions. [2024-11-10 00:55:20,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 4431 transitions. [2024-11-10 00:55:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:55:20,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:20,585 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:20,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:55:20,585 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:20,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:20,586 INFO L85 PathProgramCache]: Analyzing trace with hash 691569053, now seen corresponding path program 1 times [2024-11-10 00:55:20,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:20,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203838632] [2024-11-10 00:55:20,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:20,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:20,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:20,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203838632] [2024-11-10 00:55:20,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203838632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:20,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:20,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:20,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483150852] [2024-11-10 00:55:20,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:20,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:20,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:20,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:20,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:20,647 INFO L87 Difference]: Start difference. First operand 1710 states and 4431 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:20,691 INFO L93 Difference]: Finished difference Result 2024 states and 4909 transitions. [2024-11-10 00:55:20,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:20,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:55:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:20,703 INFO L225 Difference]: With dead ends: 2024 [2024-11-10 00:55:20,703 INFO L226 Difference]: Without dead ends: 1859 [2024-11-10 00:55:20,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:20,707 INFO L432 NwaCegarLoop]: 2280 mSDtfsCounter, 2181 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:20,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2181 Valid, 2358 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2024-11-10 00:55:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1856. [2024-11-10 00:55:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1854 states have (on average 2.5080906148867315) internal successors, (4650), 1855 states have internal predecessors, (4650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 4650 transitions. [2024-11-10 00:55:20,756 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 4650 transitions. Word has length 60 [2024-11-10 00:55:20,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:20,756 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 4650 transitions. [2024-11-10 00:55:20,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 4650 transitions. [2024-11-10 00:55:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:55:20,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:20,758 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:20,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:55:20,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:20,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash -309840675, now seen corresponding path program 1 times [2024-11-10 00:55:20,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:20,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218712539] [2024-11-10 00:55:20,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:20,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:20,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:20,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218712539] [2024-11-10 00:55:20,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218712539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:20,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:20,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:20,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972950568] [2024-11-10 00:55:20,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:20,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:20,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:20,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:20,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:20,839 INFO L87 Difference]: Start difference. First operand 1856 states and 4650 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:20,880 INFO L93 Difference]: Finished difference Result 2446 states and 5538 transitions. [2024-11-10 00:55:20,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:20,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:55:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:20,892 INFO L225 Difference]: With dead ends: 2446 [2024-11-10 00:55:20,893 INFO L226 Difference]: Without dead ends: 2135 [2024-11-10 00:55:20,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:20,895 INFO L432 NwaCegarLoop]: 2278 mSDtfsCounter, 2179 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2179 SdHoareTripleChecker+Valid, 2360 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:20,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2179 Valid, 2360 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2024-11-10 00:55:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 2132. [2024-11-10 00:55:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2132 states, 2130 states have (on average 2.3737089201877932) internal successors, (5056), 2131 states have internal predecessors, (5056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:20,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 5056 transitions. [2024-11-10 00:55:20,962 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 5056 transitions. Word has length 60 [2024-11-10 00:55:20,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:20,963 INFO L471 AbstractCegarLoop]: Abstraction has 2132 states and 5056 transitions. [2024-11-10 00:55:20,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:20,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 5056 transitions. [2024-11-10 00:55:20,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:55:20,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:20,965 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:20,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:55:20,966 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:20,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:20,966 INFO L85 PathProgramCache]: Analyzing trace with hash -324290531, now seen corresponding path program 1 times [2024-11-10 00:55:20,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:20,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612567216] [2024-11-10 00:55:20,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:20,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:21,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:21,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612567216] [2024-11-10 00:55:21,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612567216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:21,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:21,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:21,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342494173] [2024-11-10 00:55:21,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:21,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:21,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:21,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:21,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:21,031 INFO L87 Difference]: Start difference. First operand 2132 states and 5056 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:21,079 INFO L93 Difference]: Finished difference Result 3242 states and 6700 transitions. [2024-11-10 00:55:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:21,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:55:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:21,091 INFO L225 Difference]: With dead ends: 3242 [2024-11-10 00:55:21,091 INFO L226 Difference]: Without dead ends: 2655 [2024-11-10 00:55:21,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:21,094 INFO L432 NwaCegarLoop]: 2276 mSDtfsCounter, 2177 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:21,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 2362 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2024-11-10 00:55:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2652. [2024-11-10 00:55:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 2650 states have (on average 2.190188679245283) internal successors, (5804), 2651 states have internal predecessors, (5804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 5804 transitions. [2024-11-10 00:55:21,162 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 5804 transitions. Word has length 60 [2024-11-10 00:55:21,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:21,162 INFO L471 AbstractCegarLoop]: Abstraction has 2652 states and 5804 transitions. [2024-11-10 00:55:21,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:21,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 5804 transitions. [2024-11-10 00:55:21,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:55:21,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:21,163 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:21,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:55:21,164 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:21,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:21,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1767312221, now seen corresponding path program 1 times [2024-11-10 00:55:21,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:21,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39890057] [2024-11-10 00:55:21,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:21,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:21,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:21,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39890057] [2024-11-10 00:55:21,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39890057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:21,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:21,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:21,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293931682] [2024-11-10 00:55:21,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:21,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:21,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:21,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:21,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:21,218 INFO L87 Difference]: Start difference. First operand 2652 states and 5804 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:21,280 INFO L93 Difference]: Finished difference Result 4738 states and 8832 transitions. [2024-11-10 00:55:21,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:21,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:55:21,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:21,302 INFO L225 Difference]: With dead ends: 4738 [2024-11-10 00:55:21,306 INFO L226 Difference]: Without dead ends: 3631 [2024-11-10 00:55:21,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:21,310 INFO L432 NwaCegarLoop]: 2274 mSDtfsCounter, 2175 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2175 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:21,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2175 Valid, 2364 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3631 states. [2024-11-10 00:55:21,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3631 to 3628. [2024-11-10 00:55:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3628 states, 3626 states have (on average 1.9779371207942638) internal successors, (7172), 3627 states have internal predecessors, (7172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 7172 transitions. [2024-11-10 00:55:21,419 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 7172 transitions. Word has length 60 [2024-11-10 00:55:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:21,419 INFO L471 AbstractCegarLoop]: Abstraction has 3628 states and 7172 transitions. [2024-11-10 00:55:21,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 7172 transitions. [2024-11-10 00:55:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:55:21,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:21,421 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:21,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:55:21,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:21,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1243035166, now seen corresponding path program 1 times [2024-11-10 00:55:21,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:21,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119971708] [2024-11-10 00:55:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:21,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:21,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:21,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119971708] [2024-11-10 00:55:21,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119971708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:21,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:21,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:55:21,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136141572] [2024-11-10 00:55:21,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:21,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:55:21,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:21,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:55:21,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:55:21,645 INFO L87 Difference]: Start difference. First operand 3628 states and 7172 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:21,724 INFO L93 Difference]: Finished difference Result 3727 states and 7302 transitions. [2024-11-10 00:55:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:55:21,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:55:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:21,747 INFO L225 Difference]: With dead ends: 3727 [2024-11-10 00:55:21,751 INFO L226 Difference]: Without dead ends: 3724 [2024-11-10 00:55:21,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:55:21,755 INFO L432 NwaCegarLoop]: 2228 mSDtfsCounter, 0 mSDsluCounter, 6675 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8903 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:21,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8903 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:21,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2024-11-10 00:55:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3724. [2024-11-10 00:55:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3724 states, 3722 states have (on average 1.9484148307361633) internal successors, (7252), 3723 states have internal predecessors, (7252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 7252 transitions. [2024-11-10 00:55:21,862 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 7252 transitions. Word has length 60 [2024-11-10 00:55:21,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:21,863 INFO L471 AbstractCegarLoop]: Abstraction has 3724 states and 7252 transitions. [2024-11-10 00:55:21,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:21,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 7252 transitions. [2024-11-10 00:55:21,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:55:21,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:21,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:21,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:55:21,866 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:21,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1092605501, now seen corresponding path program 1 times [2024-11-10 00:55:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:21,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200365031] [2024-11-10 00:55:21,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:21,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:21,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:21,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200365031] [2024-11-10 00:55:21,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200365031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:21,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:21,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:21,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6572011] [2024-11-10 00:55:21,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:21,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:21,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:21,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:21,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:21,926 INFO L87 Difference]: Start difference. First operand 3724 states and 7252 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:22,064 INFO L93 Difference]: Finished difference Result 6038 states and 10557 transitions. [2024-11-10 00:55:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:22,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 00:55:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:22,077 INFO L225 Difference]: With dead ends: 6038 [2024-11-10 00:55:22,077 INFO L226 Difference]: Without dead ends: 4786 [2024-11-10 00:55:22,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:22,081 INFO L432 NwaCegarLoop]: 2285 mSDtfsCounter, 2180 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:22,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2359 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:22,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4786 states. [2024-11-10 00:55:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4786 to 4783. [2024-11-10 00:55:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4783 states, 4781 states have (on average 1.82200376490274) internal successors, (8711), 4782 states have internal predecessors, (8711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 8711 transitions. [2024-11-10 00:55:22,214 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 8711 transitions. Word has length 62 [2024-11-10 00:55:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:22,214 INFO L471 AbstractCegarLoop]: Abstraction has 4783 states and 8711 transitions. [2024-11-10 00:55:22,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 8711 transitions. [2024-11-10 00:55:22,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:22,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:22,219 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:22,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:55:22,219 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:22,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:22,220 INFO L85 PathProgramCache]: Analyzing trace with hash 304318565, now seen corresponding path program 1 times [2024-11-10 00:55:22,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:22,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687316150] [2024-11-10 00:55:22,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:22,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:55:22,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687316150] [2024-11-10 00:55:22,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687316150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:22,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:22,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:22,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595058327] [2024-11-10 00:55:22,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:22,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:22,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:22,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:22,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:22,396 INFO L87 Difference]: Start difference. First operand 4783 states and 8711 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-11-10 00:55:22,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:22,793 INFO L93 Difference]: Finished difference Result 21665 states and 32307 transitions. [2024-11-10 00:55:22,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:22,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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 81 [2024-11-10 00:55:22,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:22,832 INFO L225 Difference]: With dead ends: 21665 [2024-11-10 00:55:22,833 INFO L226 Difference]: Without dead ends: 18430 [2024-11-10 00:55:22,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:55:22,845 INFO L432 NwaCegarLoop]: 2303 mSDtfsCounter, 9075 mSDsluCounter, 2756 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9075 SdHoareTripleChecker+Valid, 5059 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:22,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9075 Valid, 5059 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:22,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18430 states. [2024-11-10 00:55:23,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18430 to 8015. [2024-11-10 00:55:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8015 states, 8013 states have (on average 1.6461999251216772) internal successors, (13191), 8014 states have internal predecessors, (13191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8015 states to 8015 states and 13191 transitions. [2024-11-10 00:55:23,151 INFO L78 Accepts]: Start accepts. Automaton has 8015 states and 13191 transitions. Word has length 81 [2024-11-10 00:55:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:23,151 INFO L471 AbstractCegarLoop]: Abstraction has 8015 states and 13191 transitions. [2024-11-10 00:55:23,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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-11-10 00:55:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 8015 states and 13191 transitions. [2024-11-10 00:55:23,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:23,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:23,154 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:23,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:55:23,154 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:23,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:23,155 INFO L85 PathProgramCache]: Analyzing trace with hash -697091163, now seen corresponding path program 1 times [2024-11-10 00:55:23,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:23,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418220044] [2024-11-10 00:55:23,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:23,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:55:23,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:23,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418220044] [2024-11-10 00:55:23,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418220044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:23,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:23,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:23,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576964790] [2024-11-10 00:55:23,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:23,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:23,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:23,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:23,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:23,316 INFO L87 Difference]: Start difference. First operand 8015 states and 13191 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:23,766 INFO L93 Difference]: Finished difference Result 24897 states and 36787 transitions. [2024-11-10 00:55:23,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:23,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 81 [2024-11-10 00:55:23,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:23,809 INFO L225 Difference]: With dead ends: 24897 [2024-11-10 00:55:23,809 INFO L226 Difference]: Without dead ends: 21662 [2024-11-10 00:55:23,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:55:23,824 INFO L432 NwaCegarLoop]: 2299 mSDtfsCounter, 9107 mSDsluCounter, 2651 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9107 SdHoareTripleChecker+Valid, 4950 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:23,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9107 Valid, 4950 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21662 states. [2024-11-10 00:55:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21662 to 12879. [2024-11-10 00:55:24,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12879 states, 12877 states have (on average 1.5437601925914421) internal successors, (19879), 12878 states have internal predecessors, (19879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12879 states to 12879 states and 19879 transitions. [2024-11-10 00:55:24,255 INFO L78 Accepts]: Start accepts. Automaton has 12879 states and 19879 transitions. Word has length 81 [2024-11-10 00:55:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:24,256 INFO L471 AbstractCegarLoop]: Abstraction has 12879 states and 19879 transitions. [2024-11-10 00:55:24,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 12879 states and 19879 transitions. [2024-11-10 00:55:24,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:24,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:24,259 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:24,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:55:24,259 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:24,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:24,260 INFO L85 PathProgramCache]: Analyzing trace with hash -711541019, now seen corresponding path program 1 times [2024-11-10 00:55:24,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:24,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808203943] [2024-11-10 00:55:24,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:24,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-10 00:55:24,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:24,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808203943] [2024-11-10 00:55:24,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808203943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:24,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:24,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:24,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600884701] [2024-11-10 00:55:24,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:24,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:24,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:24,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:24,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:24,436 INFO L87 Difference]: Start difference. First operand 12879 states and 19879 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-11-10 00:55:25,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:25,130 INFO L93 Difference]: Finished difference Result 28129 states and 41267 transitions. [2024-11-10 00:55:25,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:25,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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 81 [2024-11-10 00:55:25,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:25,185 INFO L225 Difference]: With dead ends: 28129 [2024-11-10 00:55:25,185 INFO L226 Difference]: Without dead ends: 24894 [2024-11-10 00:55:25,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:55:25,198 INFO L432 NwaCegarLoop]: 2295 mSDtfsCounter, 9145 mSDsluCounter, 2657 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9145 SdHoareTripleChecker+Valid, 4952 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:25,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9145 Valid, 4952 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:25,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24894 states. [2024-11-10 00:55:25,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24894 to 16111. [2024-11-10 00:55:25,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16111 states, 16109 states have (on average 1.5121360730026694) internal successors, (24359), 16110 states have internal predecessors, (24359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16111 states to 16111 states and 24359 transitions. [2024-11-10 00:55:25,844 INFO L78 Accepts]: Start accepts. Automaton has 16111 states and 24359 transitions. Word has length 81 [2024-11-10 00:55:25,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:25,845 INFO L471 AbstractCegarLoop]: Abstraction has 16111 states and 24359 transitions. [2024-11-10 00:55:25,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-11-10 00:55:25,845 INFO L276 IsEmpty]: Start isEmpty. Operand 16111 states and 24359 transitions. [2024-11-10 00:55:25,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 00:55:25,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:25,847 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:25,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:55:25,848 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:25,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:25,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1380061733, now seen corresponding path program 1 times [2024-11-10 00:55:25,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:25,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981308357] [2024-11-10 00:55:25,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:25,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:26,015 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-10 00:55:26,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:26,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981308357] [2024-11-10 00:55:26,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981308357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:26,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:26,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:26,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238366890] [2024-11-10 00:55:26,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:26,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:26,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:26,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:26,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:26,017 INFO L87 Difference]: Start difference. First operand 16111 states and 24359 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-11-10 00:55:26,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:26,544 INFO L93 Difference]: Finished difference Result 31361 states and 45747 transitions. [2024-11-10 00:55:26,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:26,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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 81 [2024-11-10 00:55:26,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:26,609 INFO L225 Difference]: With dead ends: 31361 [2024-11-10 00:55:26,610 INFO L226 Difference]: Without dead ends: 28126 [2024-11-10 00:55:26,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:55:26,631 INFO L432 NwaCegarLoop]: 2301 mSDtfsCounter, 9090 mSDsluCounter, 2711 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9090 SdHoareTripleChecker+Valid, 5012 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:26,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9090 Valid, 5012 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28126 states. [2024-11-10 00:55:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28126 to 19343. [2024-11-10 00:55:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19343 states, 19341 states have (on average 1.491081123002947) internal successors, (28839), 19342 states have internal predecessors, (28839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19343 states to 19343 states and 28839 transitions. [2024-11-10 00:55:27,308 INFO L78 Accepts]: Start accepts. Automaton has 19343 states and 28839 transitions. Word has length 81 [2024-11-10 00:55:27,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:27,308 INFO L471 AbstractCegarLoop]: Abstraction has 19343 states and 28839 transitions. [2024-11-10 00:55:27,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 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-11-10 00:55:27,308 INFO L276 IsEmpty]: Start isEmpty. Operand 19343 states and 28839 transitions. [2024-11-10 00:55:27,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:55:27,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:27,312 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:27,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:55:27,312 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:27,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:27,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1613241913, now seen corresponding path program 1 times [2024-11-10 00:55:27,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:27,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663088175] [2024-11-10 00:55:27,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:27,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:27,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:27,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663088175] [2024-11-10 00:55:27,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663088175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:27,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:27,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:27,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267615444] [2024-11-10 00:55:27,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:27,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:27,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:27,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:27,434 INFO L87 Difference]: Start difference. First operand 19343 states and 28839 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:27,676 INFO L93 Difference]: Finished difference Result 32043 states and 46642 transitions. [2024-11-10 00:55:27,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:27,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-10 00:55:27,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:27,704 INFO L225 Difference]: With dead ends: 32043 [2024-11-10 00:55:27,704 INFO L226 Difference]: Without dead ends: 14248 [2024-11-10 00:55:27,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:27,725 INFO L432 NwaCegarLoop]: 2273 mSDtfsCounter, 51 mSDsluCounter, 2216 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 4489 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:27,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 4489 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14248 states. [2024-11-10 00:55:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14248 to 14245. [2024-11-10 00:55:28,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14245 states, 14243 states have (on average 1.5309274731447027) internal successors, (21805), 14244 states have internal predecessors, (21805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:28,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14245 states to 14245 states and 21805 transitions. [2024-11-10 00:55:28,056 INFO L78 Accepts]: Start accepts. Automaton has 14245 states and 21805 transitions. Word has length 83 [2024-11-10 00:55:28,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:28,057 INFO L471 AbstractCegarLoop]: Abstraction has 14245 states and 21805 transitions. [2024-11-10 00:55:28,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 14245 states and 21805 transitions. [2024-11-10 00:55:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 00:55:28,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:28,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:28,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:55:28,060 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:28,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:28,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1687926011, now seen corresponding path program 1 times [2024-11-10 00:55:28,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:28,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965467501] [2024-11-10 00:55:28,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:28,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:55:28,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:28,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965467501] [2024-11-10 00:55:28,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965467501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:28,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:28,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 00:55:28,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386304269] [2024-11-10 00:55:28,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:28,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 00:55:28,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:28,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 00:55:28,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:55:28,309 INFO L87 Difference]: Start difference. First operand 14245 states and 21805 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:28,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:28,778 INFO L93 Difference]: Finished difference Result 25783 states and 37977 transitions. [2024-11-10 00:55:28,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:55:28,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 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 83 [2024-11-10 00:55:28,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:28,825 INFO L225 Difference]: With dead ends: 25783 [2024-11-10 00:55:28,826 INFO L226 Difference]: Without dead ends: 23476 [2024-11-10 00:55:28,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 00:55:28,840 INFO L432 NwaCegarLoop]: 2293 mSDtfsCounter, 9089 mSDsluCounter, 2853 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9089 SdHoareTripleChecker+Valid, 5146 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:28,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9089 Valid, 5146 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:55:28,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23476 states. [2024-11-10 00:55:29,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23476 to 16549. [2024-11-10 00:55:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16549 states, 16547 states have (on average 1.5111500574122196) internal successors, (25005), 16548 states have internal predecessors, (25005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16549 states to 16549 states and 25005 transitions. [2024-11-10 00:55:29,241 INFO L78 Accepts]: Start accepts. Automaton has 16549 states and 25005 transitions. Word has length 83 [2024-11-10 00:55:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:29,241 INFO L471 AbstractCegarLoop]: Abstraction has 16549 states and 25005 transitions. [2024-11-10 00:55:29,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 16549 states and 25005 transitions. [2024-11-10 00:55:29,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 00:55:29,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:29,245 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:29,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 00:55:29,246 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:29,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash -604865433, now seen corresponding path program 1 times [2024-11-10 00:55:29,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:29,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526317346] [2024-11-10 00:55:29,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:29,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:29,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:29,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526317346] [2024-11-10 00:55:29,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526317346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:29,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:29,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:29,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919200489] [2024-11-10 00:55:29,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:29,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:29,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:29,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:29,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:29,367 INFO L87 Difference]: Start difference. First operand 16549 states and 25005 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:29,536 INFO L93 Difference]: Finished difference Result 24043 states and 35409 transitions. [2024-11-10 00:55:29,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:29,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-10 00:55:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:29,556 INFO L225 Difference]: With dead ends: 24043 [2024-11-10 00:55:29,557 INFO L226 Difference]: Without dead ends: 9064 [2024-11-10 00:55:29,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:29,574 INFO L432 NwaCegarLoop]: 2266 mSDtfsCounter, 44 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4474 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:29,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4474 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2024-11-10 00:55:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 9061. [2024-11-10 00:55:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9061 states, 9059 states have (on average 1.600728557235898) internal successors, (14501), 9060 states have internal predecessors, (14501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:29,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9061 states to 9061 states and 14501 transitions. [2024-11-10 00:55:29,856 INFO L78 Accepts]: Start accepts. Automaton has 9061 states and 14501 transitions. Word has length 85 [2024-11-10 00:55:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:29,856 INFO L471 AbstractCegarLoop]: Abstraction has 9061 states and 14501 transitions. [2024-11-10 00:55:29,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 9061 states and 14501 transitions. [2024-11-10 00:55:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 00:55:29,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:29,858 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:29,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 00:55:29,859 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:29,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:29,859 INFO L85 PathProgramCache]: Analyzing trace with hash 884605097, now seen corresponding path program 1 times [2024-11-10 00:55:29,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:29,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949061859] [2024-11-10 00:55:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:30,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:30,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949061859] [2024-11-10 00:55:30,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949061859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:30,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:30,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:30,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971913040] [2024-11-10 00:55:30,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:30,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:30,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:30,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:30,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:30,048 INFO L87 Difference]: Start difference. First operand 9061 states and 14501 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:30,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:30,155 INFO L93 Difference]: Finished difference Result 12811 states and 19653 transitions. [2024-11-10 00:55:30,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:30,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-10 00:55:30,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:30,166 INFO L225 Difference]: With dead ends: 12811 [2024-11-10 00:55:30,167 INFO L226 Difference]: Without dead ends: 5320 [2024-11-10 00:55:30,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:30,176 INFO L432 NwaCegarLoop]: 2259 mSDtfsCounter, 39 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 4459 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:30,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 4459 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2024-11-10 00:55:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 5317. [2024-11-10 00:55:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5317 states, 5315 states have (on average 1.7499529633113828) internal successors, (9301), 5316 states have internal predecessors, (9301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 9301 transitions. [2024-11-10 00:55:30,287 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 9301 transitions. Word has length 87 [2024-11-10 00:55:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:30,287 INFO L471 AbstractCegarLoop]: Abstraction has 5317 states and 9301 transitions. [2024-11-10 00:55:30,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 9301 transitions. [2024-11-10 00:55:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 00:55:30,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:30,290 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:30,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 00:55:30,291 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:30,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:30,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1051205944, now seen corresponding path program 1 times [2024-11-10 00:55:30,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:30,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619564007] [2024-11-10 00:55:30,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:30,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:30,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:30,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619564007] [2024-11-10 00:55:30,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619564007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:30,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:30,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:30,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185138847] [2024-11-10 00:55:30,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:30,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:55:30,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:30,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:55:30,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:55:30,447 INFO L87 Difference]: Start difference. First operand 5317 states and 9301 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:37,486 INFO L93 Difference]: Finished difference Result 9080 states and 19597 transitions. [2024-11-10 00:55:37,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:55:37,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-10 00:55:37,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:37,502 INFO L225 Difference]: With dead ends: 9080 [2024-11-10 00:55:37,502 INFO L226 Difference]: Without dead ends: 7573 [2024-11-10 00:55:37,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:55:37,508 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 4437 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 9022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:37,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4437 Valid, 828 Invalid, 9022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-11-10 00:55:37,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2024-11-10 00:55:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2024-11-10 00:55:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7573 states, 7571 states have (on average 1.9116365077268525) internal successors, (14473), 7572 states have internal predecessors, (14473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 14473 transitions. [2024-11-10 00:55:37,752 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 14473 transitions. Word has length 88 [2024-11-10 00:55:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:37,753 INFO L471 AbstractCegarLoop]: Abstraction has 7573 states and 14473 transitions. [2024-11-10 00:55:37,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 14473 transitions. [2024-11-10 00:55:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 00:55:37,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:37,756 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:37,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:55:37,756 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:37,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:37,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2145385200, now seen corresponding path program 1 times [2024-11-10 00:55:37,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:37,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088869675] [2024-11-10 00:55:37,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:37,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:37,878 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:37,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:37,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088869675] [2024-11-10 00:55:37,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088869675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:37,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:37,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:37,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141806455] [2024-11-10 00:55:37,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:37,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:37,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:37,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:37,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:37,881 INFO L87 Difference]: Start difference. First operand 7573 states and 14473 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:37,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:37,991 INFO L93 Difference]: Finished difference Result 9451 states and 17025 transitions. [2024-11-10 00:55:37,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:37,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-11-10 00:55:37,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:38,002 INFO L225 Difference]: With dead ends: 9451 [2024-11-10 00:55:38,002 INFO L226 Difference]: Without dead ends: 5704 [2024-11-10 00:55:38,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:38,009 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 36 mSDsluCounter, 2192 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4444 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:38,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4444 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:38,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5704 states. [2024-11-10 00:55:38,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5704 to 5701. [2024-11-10 00:55:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5701 states, 5699 states have (on average 2.0879101596771363) internal successors, (11899), 5700 states have internal predecessors, (11899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 11899 transitions. [2024-11-10 00:55:38,156 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 11899 transitions. Word has length 89 [2024-11-10 00:55:38,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:38,157 INFO L471 AbstractCegarLoop]: Abstraction has 5701 states and 11899 transitions. [2024-11-10 00:55:38,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 11899 transitions. [2024-11-10 00:55:38,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 00:55:38,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:38,159 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:38,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 00:55:38,160 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:38,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:38,161 INFO L85 PathProgramCache]: Analyzing trace with hash -765808850, now seen corresponding path program 1 times [2024-11-10 00:55:38,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:38,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668933861] [2024-11-10 00:55:38,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:38,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:38,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:38,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668933861] [2024-11-10 00:55:38,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668933861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:38,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:38,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:38,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215030681] [2024-11-10 00:55:38,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:38,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:38,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:38,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:38,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:38,249 INFO L87 Difference]: Start difference. First operand 5701 states and 11899 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:42,121 INFO L93 Difference]: Finished difference Result 12472 states and 29081 transitions. [2024-11-10 00:55:42,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:42,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-10 00:55:42,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:42,135 INFO L225 Difference]: With dead ends: 12472 [2024-11-10 00:55:42,135 INFO L226 Difference]: Without dead ends: 8709 [2024-11-10 00:55:42,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:42,142 INFO L432 NwaCegarLoop]: 1763 mSDtfsCounter, 1455 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 3679 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 4425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 3679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:42,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 1883 Invalid, 4425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 3679 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-10 00:55:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8709 states. [2024-11-10 00:55:42,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8709 to 8709. [2024-11-10 00:55:42,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8709 states, 8707 states have (on average 2.1939818536809463) internal successors, (19103), 8708 states have internal predecessors, (19103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8709 states to 8709 states and 19103 transitions. [2024-11-10 00:55:42,300 INFO L78 Accepts]: Start accepts. Automaton has 8709 states and 19103 transitions. Word has length 90 [2024-11-10 00:55:42,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:42,300 INFO L471 AbstractCegarLoop]: Abstraction has 8709 states and 19103 transitions. [2024-11-10 00:55:42,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:42,301 INFO L276 IsEmpty]: Start isEmpty. Operand 8709 states and 19103 transitions. [2024-11-10 00:55:42,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 00:55:42,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:42,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:42,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 00:55:42,303 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:42,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:42,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2015095447, now seen corresponding path program 1 times [2024-11-10 00:55:42,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:42,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714641588] [2024-11-10 00:55:42,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:42,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:42,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:42,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714641588] [2024-11-10 00:55:42,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714641588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:55:42,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:55:42,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:55:42,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606504835] [2024-11-10 00:55:42,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:55:42,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:55:42,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:42,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:55:42,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:42,404 INFO L87 Difference]: Start difference. First operand 8709 states and 19103 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:42,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:42,472 INFO L93 Difference]: Finished difference Result 9651 states and 20368 transitions. [2024-11-10 00:55:42,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:55:42,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-10 00:55:42,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:42,488 INFO L225 Difference]: With dead ends: 9651 [2024-11-10 00:55:42,489 INFO L226 Difference]: Without dead ends: 7776 [2024-11-10 00:55:42,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:55:42,494 INFO L432 NwaCegarLoop]: 2245 mSDtfsCounter, 33 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4429 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:42,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4429 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:55:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7776 states. [2024-11-10 00:55:42,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7776 to 7773. [2024-11-10 00:55:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7773 states, 7771 states have (on average 2.2942993179770945) internal successors, (17829), 7772 states have internal predecessors, (17829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7773 states to 7773 states and 17829 transitions. [2024-11-10 00:55:42,672 INFO L78 Accepts]: Start accepts. Automaton has 7773 states and 17829 transitions. Word has length 91 [2024-11-10 00:55:42,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:42,672 INFO L471 AbstractCegarLoop]: Abstraction has 7773 states and 17829 transitions. [2024-11-10 00:55:42,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 7773 states and 17829 transitions. [2024-11-10 00:55:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:55:42,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:42,676 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:42,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 00:55:42,677 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:42,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:42,677 INFO L85 PathProgramCache]: Analyzing trace with hash -196861634, now seen corresponding path program 1 times [2024-11-10 00:55:42,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:42,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898421548] [2024-11-10 00:55:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:42,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:43,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:43,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898421548] [2024-11-10 00:55:43,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898421548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:43,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712159384] [2024-11-10 00:55:43,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:43,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:43,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:43,075 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:55:43,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 00:55:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:43,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 00:55:43,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:44,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:46,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712159384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:46,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:46,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 30 [2024-11-10 00:55:46,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964461837] [2024-11-10 00:55:46,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:46,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 00:55:46,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:46,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 00:55:46,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2024-11-10 00:55:46,431 INFO L87 Difference]: Start difference. First operand 7773 states and 17829 transitions. Second operand has 30 states, 30 states have (on average 8.033333333333333) internal successors, (241), 30 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:47,684 INFO L93 Difference]: Finished difference Result 10729 states and 21767 transitions. [2024-11-10 00:55:47,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 00:55:47,685 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.033333333333333) internal successors, (241), 30 states have internal predecessors, (241), 0 states have call successors, (0), 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 93 [2024-11-10 00:55:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:47,768 INFO L225 Difference]: With dead ends: 10729 [2024-11-10 00:55:47,769 INFO L226 Difference]: Without dead ends: 9790 [2024-11-10 00:55:47,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=714, Invalid=2366, Unknown=0, NotChecked=0, Total=3080 [2024-11-10 00:55:47,773 INFO L432 NwaCegarLoop]: 2200 mSDtfsCounter, 14440 mSDsluCounter, 13670 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14440 SdHoareTripleChecker+Valid, 15870 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:47,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14440 Valid, 15870 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:55:47,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9790 states. [2024-11-10 00:55:47,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9790 to 9697. [2024-11-10 00:55:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9697 states, 9695 states have (on average 2.099123259412068) internal successors, (20351), 9696 states have internal predecessors, (20351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9697 states to 9697 states and 20351 transitions. [2024-11-10 00:55:47,906 INFO L78 Accepts]: Start accepts. Automaton has 9697 states and 20351 transitions. Word has length 93 [2024-11-10 00:55:47,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:47,907 INFO L471 AbstractCegarLoop]: Abstraction has 9697 states and 20351 transitions. [2024-11-10 00:55:47,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.033333333333333) internal successors, (241), 30 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 9697 states and 20351 transitions. [2024-11-10 00:55:47,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:55:47,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:47,909 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:47,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 00:55:48,110 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,SelfDestructingSolverStorable23 [2024-11-10 00:55:48,110 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:48,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:48,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1939014882, now seen corresponding path program 1 times [2024-11-10 00:55:48,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:48,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052955151] [2024-11-10 00:55:48,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:48,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:48,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:48,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052955151] [2024-11-10 00:55:48,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052955151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:48,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650926989] [2024-11-10 00:55:48,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:48,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:48,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:48,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:55:48,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 00:55:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:49,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 00:55:49,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:49,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:50,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650926989] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:50,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:50,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2024-11-10 00:55:50,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832257170] [2024-11-10 00:55:50,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:50,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-10 00:55:50,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:50,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-10 00:55:50,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 00:55:50,616 INFO L87 Difference]: Start difference. First operand 9697 states and 20351 transitions. Second operand has 35 states, 35 states have (on average 7.114285714285714) internal successors, (249), 35 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:52,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:52,822 INFO L93 Difference]: Finished difference Result 23579 states and 38658 transitions. [2024-11-10 00:55:52,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-10 00:55:52,822 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.114285714285714) internal successors, (249), 35 states have internal predecessors, (249), 0 states have call successors, (0), 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 93 [2024-11-10 00:55:52,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:52,846 INFO L225 Difference]: With dead ends: 23579 [2024-11-10 00:55:52,846 INFO L226 Difference]: Without dead ends: 20716 [2024-11-10 00:55:52,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=972, Invalid=4430, Unknown=0, NotChecked=0, Total=5402 [2024-11-10 00:55:52,854 INFO L432 NwaCegarLoop]: 2194 mSDtfsCounter, 41039 mSDsluCounter, 18000 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41039 SdHoareTripleChecker+Valid, 20194 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:52,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41039 Valid, 20194 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:55:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20716 states. [2024-11-10 00:55:53,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20716 to 19369. [2024-11-10 00:55:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19369 states, 19367 states have (on average 1.6978881602726288) internal successors, (32883), 19368 states have internal predecessors, (32883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19369 states to 19369 states and 32883 transitions. [2024-11-10 00:55:53,226 INFO L78 Accepts]: Start accepts. Automaton has 19369 states and 32883 transitions. Word has length 93 [2024-11-10 00:55:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:55:53,226 INFO L471 AbstractCegarLoop]: Abstraction has 19369 states and 32883 transitions. [2024-11-10 00:55:53,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.114285714285714) internal successors, (249), 35 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:53,227 INFO L276 IsEmpty]: Start isEmpty. Operand 19369 states and 32883 transitions. [2024-11-10 00:55:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 00:55:53,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:55:53,229 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:55:53,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:55:53,429 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,SelfDestructingSolverStorable24 [2024-11-10 00:55:53,430 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:55:53,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:55:53,430 INFO L85 PathProgramCache]: Analyzing trace with hash -666702594, now seen corresponding path program 1 times [2024-11-10 00:55:53,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:55:53,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675744045] [2024-11-10 00:55:53,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:53,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:55:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:54,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:55:54,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675744045] [2024-11-10 00:55:54,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675744045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:55:54,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698078094] [2024-11-10 00:55:54,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:55:54,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:55:54,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:55:54,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:55:54,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 00:55:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:55:54,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 00:55:54,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:55:54,798 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:54,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:55:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:55:55,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698078094] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:55:55,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:55:55,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2024-11-10 00:55:55,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987584806] [2024-11-10 00:55:55,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:55:55,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 00:55:55,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:55:55,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 00:55:55,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2024-11-10 00:55:55,803 INFO L87 Difference]: Start difference. First operand 19369 states and 32883 transitions. Second operand has 29 states, 29 states have (on average 8.241379310344827) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:55:58,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:55:58,419 INFO L93 Difference]: Finished difference Result 76434 states and 107309 transitions. [2024-11-10 00:55:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-10 00:55:58,420 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.241379310344827) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 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 93 [2024-11-10 00:55:58,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:55:58,490 INFO L225 Difference]: With dead ends: 76434 [2024-11-10 00:55:58,490 INFO L226 Difference]: Without dead ends: 63899 [2024-11-10 00:55:58,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=710, Invalid=2830, Unknown=0, NotChecked=0, Total=3540 [2024-11-10 00:55:58,505 INFO L432 NwaCegarLoop]: 2204 mSDtfsCounter, 27401 mSDsluCounter, 11682 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27401 SdHoareTripleChecker+Valid, 13886 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:55:58,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27401 Valid, 13886 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 00:55:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63899 states. [2024-11-10 00:55:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63899 to 60839. [2024-11-10 00:55:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60839 states, 60837 states have (on average 1.4168351496622122) internal successors, (86196), 60838 states have internal predecessors, (86196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:00,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60839 states to 60839 states and 86196 transitions. [2024-11-10 00:56:00,095 INFO L78 Accepts]: Start accepts. Automaton has 60839 states and 86196 transitions. Word has length 93 [2024-11-10 00:56:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:56:00,095 INFO L471 AbstractCegarLoop]: Abstraction has 60839 states and 86196 transitions. [2024-11-10 00:56:00,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.241379310344827) internal successors, (239), 28 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:56:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 60839 states and 86196 transitions. [2024-11-10 00:56:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 00:56:00,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:56:00,101 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:56:00,115 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-11-10 00:56:00,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:00,302 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:56:00,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:56:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1841642136, now seen corresponding path program 1 times [2024-11-10 00:56:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:56:00,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563669424] [2024-11-10 00:56:00,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:56:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:00,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:56:00,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563669424] [2024-11-10 00:56:00,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563669424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:56:00,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815288654] [2024-11-10 00:56:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:56:00,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:56:00,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:56:00,626 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 00:56:00,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 00:56:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:56:00,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 00:56:00,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:56:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:02,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:56:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:56:03,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815288654] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:56:03,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:56:03,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 36 [2024-11-10 00:56:03,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975919086] [2024-11-10 00:56:03,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:56:03,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-10 00:56:03,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:56:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-10 00:56:03,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1138, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 00:56:03,403 INFO L87 Difference]: Start difference. First operand 60839 states and 86196 transitions. Second operand has 36 states, 36 states have (on average 6.833333333333333) internal successors, (246), 36 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)