./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p07.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p07.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d4a5712020ec411b26b222aa2e78595cdb24e1f443506a64eda3410a2987f6a8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:57:15,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:57:15,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 00:57:15,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:57:15,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:57:15,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:57:15,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:57:15,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:57:15,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:57:15,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:57:15,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:57:15,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:57:15,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:57:15,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:57:15,795 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:57:15,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:57:15,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:57:15,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 00:57:15,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:57:15,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:57:15,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:57:15,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:57:15,797 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:57:15,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:57:15,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:57:15,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:57:15,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:57:15,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:57:15,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:57:15,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:57:15,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:57:15,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:57:15,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:57:15,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 00:57:15,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 00:57:15,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:57:15,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:57:15,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:57:15,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:57:15,802 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d4a5712020ec411b26b222aa2e78595cdb24e1f443506a64eda3410a2987f6a8 [2024-11-12 00:57:16,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:57:16,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:57:16,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:57:16,120 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:57:16,122 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:57:16,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p07.c [2024-11-12 00:57:17,496 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:57:17,745 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:57:17,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p07.c [2024-11-12 00:57:17,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/871ebf8c6/403449a1b1e04f2eaeff22df1cfd0d8a/FLAGc8ed67aaf [2024-11-12 00:57:18,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/871ebf8c6/403449a1b1e04f2eaeff22df1cfd0d8a [2024-11-12 00:57:18,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:57:18,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:57:18,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:57:18,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:57:18,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:57:18,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:18" (1/1) ... [2024-11-12 00:57:18,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319ef1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:18, skipping insertion in model container [2024-11-12 00:57:18,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:18" (1/1) ... [2024-11-12 00:57:18,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:57:18,350 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p07.c[1259,1272] [2024-11-12 00:57:18,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:57:18,674 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:57:18,684 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p07.c[1259,1272] [2024-11-12 00:57:18,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:57:18,823 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:57:18,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:18 WrapperNode [2024-11-12 00:57:18,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:57:18,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:57:18,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:57:18,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:57:18,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:18" (1/1) ... [2024-11-12 00:57:18,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:18" (1/1) ... [2024-11-12 00:57:19,141 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2163 [2024-11-12 00:57:19,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:57:19,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:57:19,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:57:19,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:57:19,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:18" (1/1) ... [2024-11-12 00:57:19,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:18" (1/1) ... [2024-11-12 00:57:19,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:18" (1/1) ... [2024-11-12 00:57:19,282 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-12 00:57:19,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:18" (1/1) ... [2024-11-12 00:57:19,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:18" (1/1) ... [2024-11-12 00:57:19,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:18" (1/1) ... [2024-11-12 00:57:19,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:18" (1/1) ... [2024-11-12 00:57:19,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:18" (1/1) ... [2024-11-12 00:57:19,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:18" (1/1) ... [2024-11-12 00:57:19,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:57:19,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:57:19,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:57:19,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:57:19,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:18" (1/1) ... [2024-11-12 00:57:19,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:57:19,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:57:19,536 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-12 00:57:19,539 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-12 00:57:19,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:57:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 00:57:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:57:19,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:57:20,055 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:57:20,057 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:57:22,431 INFO L? ?]: Removed 1355 outVars from TransFormulas that were not future-live. [2024-11-12 00:57:22,431 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:57:22,461 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:57:22,461 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:57:22,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:22 BoogieIcfgContainer [2024-11-12 00:57:22,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:57:22,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:57:22,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:57:22,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:57:22,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:57:18" (1/3) ... [2024-11-12 00:57:22,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da6b570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:22, skipping insertion in model container [2024-11-12 00:57:22,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:18" (2/3) ... [2024-11-12 00:57:22,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da6b570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:22, skipping insertion in model container [2024-11-12 00:57:22,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:22" (3/3) ... [2024-11-12 00:57:22,472 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p07.c [2024-11-12 00:57:22,489 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:57:22,490 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:57:22,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:57:22,589 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;@66f8638c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:57:22,590 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:57:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 547 states, 545 states have (on average 1.4990825688073395) internal successors, (817), 546 states have internal predecessors, (817), 0 states have call successors, (0), 0 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-12 00:57:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 00:57:22,605 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:22,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:22,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:22,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:22,614 INFO L85 PathProgramCache]: Analyzing trace with hash -725709712, now seen corresponding path program 1 times [2024-11-12 00:57:22,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:22,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851482147] [2024-11-12 00:57:22,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:22,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:23,801 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-12 00:57:23,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:23,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851482147] [2024-11-12 00:57:23,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851482147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:23,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:23,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:57:23,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932641219] [2024-11-12 00:57:23,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:23,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:57:23,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:23,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:57:23,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:57:23,840 INFO L87 Difference]: Start difference. First operand has 547 states, 545 states have (on average 1.4990825688073395) internal successors, (817), 546 states have internal predecessors, (817), 0 states have call successors, (0), 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 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:24,097 INFO L93 Difference]: Finished difference Result 1235 states and 1849 transitions. [2024-11-12 00:57:24,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:57:24,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-12 00:57:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:24,121 INFO L225 Difference]: With dead ends: 1235 [2024-11-12 00:57:24,122 INFO L226 Difference]: Without dead ends: 742 [2024-11-12 00:57:24,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:57:24,135 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 1363 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:24,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 2382 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:57:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-11-12 00:57:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 570. [2024-11-12 00:57:24,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.4956063268892794) internal successors, (851), 569 states have internal predecessors, (851), 0 states have call successors, (0), 0 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-12 00:57:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 851 transitions. [2024-11-12 00:57:24,226 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 851 transitions. Word has length 51 [2024-11-12 00:57:24,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:24,227 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 851 transitions. [2024-11-12 00:57:24,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 851 transitions. [2024-11-12 00:57:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-12 00:57:24,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:24,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:24,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 00:57:24,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:24,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:24,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1411244223, now seen corresponding path program 1 times [2024-11-12 00:57:24,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:24,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835809714] [2024-11-12 00:57:24,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:24,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:24,546 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-12 00:57:24,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:24,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835809714] [2024-11-12 00:57:24,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835809714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:24,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:24,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:57:24,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801634825] [2024-11-12 00:57:24,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:24,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:57:24,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:24,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:57:24,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:57:24,552 INFO L87 Difference]: Start difference. First operand 570 states and 851 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:24,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:24,585 INFO L93 Difference]: Finished difference Result 574 states and 855 transitions. [2024-11-12 00:57:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:57:24,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-12 00:57:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:24,588 INFO L225 Difference]: With dead ends: 574 [2024-11-12 00:57:24,588 INFO L226 Difference]: Without dead ends: 572 [2024-11-12 00:57:24,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:57:24,591 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 0 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:24,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2427 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:57:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-12 00:57:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2024-11-12 00:57:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 1.4938704028021015) internal successors, (853), 571 states have internal predecessors, (853), 0 states have call successors, (0), 0 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-12 00:57:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 853 transitions. [2024-11-12 00:57:24,608 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 853 transitions. Word has length 52 [2024-11-12 00:57:24,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:24,609 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 853 transitions. [2024-11-12 00:57:24,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:24,609 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 853 transitions. [2024-11-12 00:57:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 00:57:24,611 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:24,611 INFO L218 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] [2024-11-12 00:57:24,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 00:57:24,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:24,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:24,612 INFO L85 PathProgramCache]: Analyzing trace with hash -797202501, now seen corresponding path program 1 times [2024-11-12 00:57:24,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:24,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852866651] [2024-11-12 00:57:24,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:24,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:24,767 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-12 00:57:24,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:24,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852866651] [2024-11-12 00:57:24,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852866651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:24,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:24,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:57:24,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411148190] [2024-11-12 00:57:24,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:24,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:57:24,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:24,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:57:24,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:57:24,771 INFO L87 Difference]: Start difference. First operand 572 states and 853 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-12 00:57:24,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:24,813 INFO L93 Difference]: Finished difference Result 1066 states and 1591 transitions. [2024-11-12 00:57:24,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:57:24,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-11-12 00:57:24,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:24,816 INFO L225 Difference]: With dead ends: 1066 [2024-11-12 00:57:24,816 INFO L226 Difference]: Without dead ends: 574 [2024-11-12 00:57:24,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:57:24,818 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 0 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2423 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:24,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2423 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:57:24,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-12 00:57:24,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2024-11-12 00:57:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.4921465968586387) internal successors, (855), 573 states have internal predecessors, (855), 0 states have call successors, (0), 0 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-12 00:57:24,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 855 transitions. [2024-11-12 00:57:24,834 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 855 transitions. Word has length 53 [2024-11-12 00:57:24,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:24,835 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 855 transitions. [2024-11-12 00:57:24,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-12 00:57:24,835 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 855 transitions. [2024-11-12 00:57:24,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-12 00:57:24,837 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:24,837 INFO L218 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] [2024-11-12 00:57:24,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 00:57:24,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:24,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:24,838 INFO L85 PathProgramCache]: Analyzing trace with hash -41439398, now seen corresponding path program 1 times [2024-11-12 00:57:24,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:24,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756579190] [2024-11-12 00:57:24,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:24,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:25,250 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-12 00:57:25,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:25,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756579190] [2024-11-12 00:57:25,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756579190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:25,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:25,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:57:25,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858734330] [2024-11-12 00:57:25,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:25,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:57:25,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:25,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:57:25,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:57:25,252 INFO L87 Difference]: Start difference. First operand 574 states and 855 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 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-12 00:57:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:25,350 INFO L93 Difference]: Finished difference Result 1080 states and 1609 transitions. [2024-11-12 00:57:25,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:57:25,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-11-12 00:57:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:25,354 INFO L225 Difference]: With dead ends: 1080 [2024-11-12 00:57:25,354 INFO L226 Difference]: Without dead ends: 586 [2024-11-12 00:57:25,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:57:25,358 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 5 mSDsluCounter, 4010 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4815 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:25,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4815 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:57:25,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-11-12 00:57:25,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 585. [2024-11-12 00:57:25,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.4897260273972603) internal successors, (870), 584 states have internal predecessors, (870), 0 states have call successors, (0), 0 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-12 00:57:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 870 transitions. [2024-11-12 00:57:25,372 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 870 transitions. Word has length 54 [2024-11-12 00:57:25,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:25,372 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 870 transitions. [2024-11-12 00:57:25,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 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-12 00:57:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 870 transitions. [2024-11-12 00:57:25,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-12 00:57:25,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:25,378 INFO L218 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] [2024-11-12 00:57:25,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 00:57:25,379 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:25,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:25,379 INFO L85 PathProgramCache]: Analyzing trace with hash -499616062, now seen corresponding path program 1 times [2024-11-12 00:57:25,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:25,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713126245] [2024-11-12 00:57:25,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:25,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:25,578 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-12 00:57:25,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:25,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713126245] [2024-11-12 00:57:25,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713126245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:25,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:25,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:57:25,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730846391] [2024-11-12 00:57:25,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:25,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:57:25,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:25,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:57:25,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:57:25,582 INFO L87 Difference]: Start difference. First operand 585 states and 870 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-12 00:57:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:25,630 INFO L93 Difference]: Finished difference Result 1112 states and 1655 transitions. [2024-11-12 00:57:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:57:25,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-11-12 00:57:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:25,633 INFO L225 Difference]: With dead ends: 1112 [2024-11-12 00:57:25,633 INFO L226 Difference]: Without dead ends: 605 [2024-11-12 00:57:25,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:57:25,637 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 8 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3228 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:25,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3228 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:57:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-12 00:57:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2024-11-12 00:57:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 1.4867549668874172) internal successors, (898), 604 states have internal predecessors, (898), 0 states have call successors, (0), 0 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-12 00:57:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 898 transitions. [2024-11-12 00:57:25,648 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 898 transitions. Word has length 55 [2024-11-12 00:57:25,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:25,648 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 898 transitions. [2024-11-12 00:57:25,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-12 00:57:25,648 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 898 transitions. [2024-11-12 00:57:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 00:57:25,651 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:25,651 INFO L218 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-12 00:57:25,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 00:57:25,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:25,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:25,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1556487095, now seen corresponding path program 1 times [2024-11-12 00:57:25,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:25,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014060273] [2024-11-12 00:57:25,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:25,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:26,275 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-12 00:57:26,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:26,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014060273] [2024-11-12 00:57:26,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014060273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:26,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:26,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 00:57:26,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731911526] [2024-11-12 00:57:26,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:26,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 00:57:26,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:26,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 00:57:26,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:57:26,279 INFO L87 Difference]: Start difference. First operand 605 states and 898 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 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-12 00:57:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:26,475 INFO L93 Difference]: Finished difference Result 1125 states and 1671 transitions. [2024-11-12 00:57:26,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 00:57:26,475 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 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-12 00:57:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:26,479 INFO L225 Difference]: With dead ends: 1125 [2024-11-12 00:57:26,479 INFO L226 Difference]: Without dead ends: 612 [2024-11-12 00:57:26,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-12 00:57:26,481 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 788 mSDsluCounter, 4782 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 5582 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:26,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 5582 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:57:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-12 00:57:26,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 609. [2024-11-12 00:57:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 608 states have (on average 1.4851973684210527) internal successors, (903), 608 states have internal predecessors, (903), 0 states have call successors, (0), 0 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-12 00:57:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 903 transitions. [2024-11-12 00:57:26,495 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 903 transitions. Word has length 56 [2024-11-12 00:57:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:26,496 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 903 transitions. [2024-11-12 00:57:26,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 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-12 00:57:26,499 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 903 transitions. [2024-11-12 00:57:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-12 00:57:26,499 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:26,499 INFO L218 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-12 00:57:26,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 00:57:26,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:26,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:26,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1131234223, now seen corresponding path program 1 times [2024-11-12 00:57:26,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:26,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431991453] [2024-11-12 00:57:26,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:26,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:26,892 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-12 00:57:26,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:26,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431991453] [2024-11-12 00:57:26,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431991453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:26,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:26,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:57:26,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705730749] [2024-11-12 00:57:26,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:26,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:57:26,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:26,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:57:26,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:57:26,895 INFO L87 Difference]: Start difference. First operand 609 states and 903 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-12 00:57:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:27,056 INFO L93 Difference]: Finished difference Result 1358 states and 2009 transitions. [2024-11-12 00:57:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:57:27,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-12 00:57:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:27,060 INFO L225 Difference]: With dead ends: 1358 [2024-11-12 00:57:27,061 INFO L226 Difference]: Without dead ends: 823 [2024-11-12 00:57:27,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:57:27,062 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 1340 mSDsluCounter, 2387 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 3186 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:27,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 3186 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:57:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2024-11-12 00:57:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 621. [2024-11-12 00:57:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 620 states have (on average 1.482258064516129) internal successors, (919), 620 states have internal predecessors, (919), 0 states have call successors, (0), 0 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-12 00:57:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 919 transitions. [2024-11-12 00:57:27,081 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 919 transitions. Word has length 56 [2024-11-12 00:57:27,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:27,081 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 919 transitions. [2024-11-12 00:57:27,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 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-12 00:57:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 919 transitions. [2024-11-12 00:57:27,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-12 00:57:27,083 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:27,083 INFO L218 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] [2024-11-12 00:57:27,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 00:57:27,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:27,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:27,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1723962207, now seen corresponding path program 1 times [2024-11-12 00:57:27,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:27,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211909333] [2024-11-12 00:57:27,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:27,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:27,461 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-12 00:57:27,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:27,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211909333] [2024-11-12 00:57:27,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211909333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:27,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:27,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:57:27,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167162869] [2024-11-12 00:57:27,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:27,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:57:27,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:27,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:57:27,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:57:27,464 INFO L87 Difference]: Start difference. First operand 621 states and 919 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:27,594 INFO L93 Difference]: Finished difference Result 1331 states and 1971 transitions. [2024-11-12 00:57:27,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:57:27,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-12 00:57:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:27,598 INFO L225 Difference]: With dead ends: 1331 [2024-11-12 00:57:27,598 INFO L226 Difference]: Without dead ends: 808 [2024-11-12 00:57:27,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:57:27,599 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 1067 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:27,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 2395 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:57:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-12 00:57:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 623. [2024-11-12 00:57:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 622 states have (on average 1.4807073954983923) internal successors, (921), 622 states have internal predecessors, (921), 0 states have call successors, (0), 0 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-12 00:57:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 921 transitions. [2024-11-12 00:57:27,611 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 921 transitions. Word has length 57 [2024-11-12 00:57:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:27,611 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 921 transitions. [2024-11-12 00:57:27,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 921 transitions. [2024-11-12 00:57:27,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 00:57:27,612 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:27,612 INFO L218 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-12 00:57:27,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 00:57:27,613 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:27,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash -713745035, now seen corresponding path program 1 times [2024-11-12 00:57:27,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:27,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246704786] [2024-11-12 00:57:27,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:27,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:28,450 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-12 00:57:28,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:28,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246704786] [2024-11-12 00:57:28,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246704786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:28,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:28,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 00:57:28,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749692939] [2024-11-12 00:57:28,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:28,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 00:57:28,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:28,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 00:57:28,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:57:28,454 INFO L87 Difference]: Start difference. First operand 623 states and 921 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 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-12 00:57:28,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:28,796 INFO L93 Difference]: Finished difference Result 1327 states and 1964 transitions. [2024-11-12 00:57:28,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 00:57:28,797 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 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-12 00:57:28,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:28,800 INFO L225 Difference]: With dead ends: 1327 [2024-11-12 00:57:28,800 INFO L226 Difference]: Without dead ends: 804 [2024-11-12 00:57:28,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-12 00:57:28,802 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 1375 mSDsluCounter, 4214 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 5005 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:28,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 5005 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:57:28,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-11-12 00:57:28,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 627. [2024-11-12 00:57:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 626 states have (on average 1.4792332268370607) internal successors, (926), 626 states have internal predecessors, (926), 0 states have call successors, (0), 0 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-12 00:57:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 926 transitions. [2024-11-12 00:57:28,818 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 926 transitions. Word has length 58 [2024-11-12 00:57:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:28,818 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 926 transitions. [2024-11-12 00:57:28,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 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-12 00:57:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 926 transitions. [2024-11-12 00:57:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 00:57:28,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:28,819 INFO L218 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-12 00:57:28,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 00:57:28,820 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:28,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:28,821 INFO L85 PathProgramCache]: Analyzing trace with hash -965086644, now seen corresponding path program 1 times [2024-11-12 00:57:28,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:28,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182521516] [2024-11-12 00:57:28,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:28,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:29,182 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-12 00:57:29,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:29,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182521516] [2024-11-12 00:57:29,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182521516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:29,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:29,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 00:57:29,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016895434] [2024-11-12 00:57:29,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:29,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:57:29,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:29,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:57:29,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:57:29,185 INFO L87 Difference]: Start difference. First operand 627 states and 926 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 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-12 00:57:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:29,377 INFO L93 Difference]: Finished difference Result 1182 states and 1745 transitions. [2024-11-12 00:57:29,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:57:29,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 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-12 00:57:29,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:29,380 INFO L225 Difference]: With dead ends: 1182 [2024-11-12 00:57:29,380 INFO L226 Difference]: Without dead ends: 635 [2024-11-12 00:57:29,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-12 00:57:29,381 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 804 mSDsluCounter, 3965 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 4762 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:29,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 4762 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:57:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-12 00:57:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 627. [2024-11-12 00:57:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 626 states have (on average 1.4792332268370607) internal successors, (926), 626 states have internal predecessors, (926), 0 states have call successors, (0), 0 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-12 00:57:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 926 transitions. [2024-11-12 00:57:29,392 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 926 transitions. Word has length 58 [2024-11-12 00:57:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:29,392 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 926 transitions. [2024-11-12 00:57:29,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 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-12 00:57:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 926 transitions. [2024-11-12 00:57:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 00:57:29,393 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:29,393 INFO L218 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-12 00:57:29,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 00:57:29,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:29,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:29,394 INFO L85 PathProgramCache]: Analyzing trace with hash -734874646, now seen corresponding path program 1 times [2024-11-12 00:57:29,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:29,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793550047] [2024-11-12 00:57:29,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:29,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:29,816 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-12 00:57:29,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:29,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793550047] [2024-11-12 00:57:29,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793550047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:29,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:29,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 00:57:29,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241999516] [2024-11-12 00:57:29,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:29,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 00:57:29,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:29,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 00:57:29,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:57:29,819 INFO L87 Difference]: Start difference. First operand 627 states and 926 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 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-12 00:57:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:30,440 INFO L93 Difference]: Finished difference Result 1397 states and 2057 transitions. [2024-11-12 00:57:30,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 00:57:30,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 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-12 00:57:30,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:30,444 INFO L225 Difference]: With dead ends: 1397 [2024-11-12 00:57:30,444 INFO L226 Difference]: Without dead ends: 850 [2024-11-12 00:57:30,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2024-11-12 00:57:30,446 INFO L435 NwaCegarLoop]: 1020 mSDtfsCounter, 1081 mSDsluCounter, 5824 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 6844 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:30,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 6844 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 00:57:30,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-11-12 00:57:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 627. [2024-11-12 00:57:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 626 states have (on average 1.4792332268370607) internal successors, (926), 626 states have internal predecessors, (926), 0 states have call successors, (0), 0 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-12 00:57:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 926 transitions. [2024-11-12 00:57:30,458 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 926 transitions. Word has length 59 [2024-11-12 00:57:30,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:30,458 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 926 transitions. [2024-11-12 00:57:30,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 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-12 00:57:30,458 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 926 transitions. [2024-11-12 00:57:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 00:57:30,459 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:30,459 INFO L218 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-12 00:57:30,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 00:57:30,460 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:30,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:30,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1503738792, now seen corresponding path program 1 times [2024-11-12 00:57:30,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:30,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053018854] [2024-11-12 00:57:30,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:30,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:30,736 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-12 00:57:30,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:30,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053018854] [2024-11-12 00:57:30,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053018854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:30,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:30,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:57:30,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471700401] [2024-11-12 00:57:30,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:30,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:57:30,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:30,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:57:30,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:57:30,738 INFO L87 Difference]: Start difference. First operand 627 states and 926 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-12 00:57:30,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:30,855 INFO L93 Difference]: Finished difference Result 1277 states and 1886 transitions. [2024-11-12 00:57:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:57:30,856 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-12 00:57:30,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:30,859 INFO L225 Difference]: With dead ends: 1277 [2024-11-12 00:57:30,859 INFO L226 Difference]: Without dead ends: 706 [2024-11-12 00:57:30,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:57:30,861 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 236 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:30,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 3107 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:57:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-12 00:57:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 602. [2024-11-12 00:57:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 1.4792013311148087) internal successors, (889), 601 states have internal predecessors, (889), 0 states have call successors, (0), 0 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-12 00:57:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 889 transitions. [2024-11-12 00:57:30,873 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 889 transitions. Word has length 60 [2024-11-12 00:57:30,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:30,874 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 889 transitions. [2024-11-12 00:57:30,874 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-12 00:57:30,874 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 889 transitions. [2024-11-12 00:57:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2024-11-12 00:57:30,879 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:30,879 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:57:30,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 00:57:30,880 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:30,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:30,881 INFO L85 PathProgramCache]: Analyzing trace with hash -116639019, now seen corresponding path program 1 times [2024-11-12 00:57:30,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:30,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727269563] [2024-11-12 00:57:30,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:30,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:37,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:37,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727269563] [2024-11-12 00:57:37,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727269563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:37,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:37,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:57:37,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162229531] [2024-11-12 00:57:37,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:37,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:57:37,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:37,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:57:37,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:57:37,177 INFO L87 Difference]: Start difference. First operand 602 states and 889 transitions. Second operand has 6 states, 6 states have (on average 50.5) internal successors, (303), 6 states have internal predecessors, (303), 0 states have call successors, (0), 0 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-12 00:57:37,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:37,387 INFO L93 Difference]: Finished difference Result 1948 states and 2893 transitions. [2024-11-12 00:57:37,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:57:37,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 50.5) internal successors, (303), 6 states have internal predecessors, (303), 0 states have call successors, (0), 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 303 [2024-11-12 00:57:37,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:37,394 INFO L225 Difference]: With dead ends: 1948 [2024-11-12 00:57:37,395 INFO L226 Difference]: Without dead ends: 1425 [2024-11-12 00:57:37,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:57:37,398 INFO L435 NwaCegarLoop]: 1075 mSDtfsCounter, 949 mSDsluCounter, 4008 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 5083 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:37,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 5083 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:57:37,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2024-11-12 00:57:37,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1088. [2024-11-12 00:57:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.484820607175713) internal successors, (1614), 1087 states have internal predecessors, (1614), 0 states have call successors, (0), 0 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-12 00:57:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1614 transitions. [2024-11-12 00:57:37,426 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1614 transitions. Word has length 303 [2024-11-12 00:57:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:37,427 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1614 transitions. [2024-11-12 00:57:37,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.5) internal successors, (303), 6 states have internal predecessors, (303), 0 states have call successors, (0), 0 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-12 00:57:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1614 transitions. [2024-11-12 00:57:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-12 00:57:37,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:37,432 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:57:37,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 00:57:37,432 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:37,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1720053578, now seen corresponding path program 1 times [2024-11-12 00:57:37,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:37,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864083041] [2024-11-12 00:57:37,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:37,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-12 00:57:41,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:41,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864083041] [2024-11-12 00:57:41,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864083041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:41,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:41,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 00:57:41,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765616443] [2024-11-12 00:57:41,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:41,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 00:57:41,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:41,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 00:57:41,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 00:57:41,660 INFO L87 Difference]: Start difference. First operand 1088 states and 1614 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 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-12 00:57:41,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:41,690 INFO L93 Difference]: Finished difference Result 2097 states and 3116 transitions. [2024-11-12 00:57:41,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 00:57:41,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 304 [2024-11-12 00:57:41,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:41,696 INFO L225 Difference]: With dead ends: 2097 [2024-11-12 00:57:41,696 INFO L226 Difference]: Without dead ends: 1088 [2024-11-12 00:57:41,697 INFO L434 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-12 00:57:41,698 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 2 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:41,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1613 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:57:41,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-11-12 00:57:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 602. [2024-11-12 00:57:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 1.475873544093178) internal successors, (887), 601 states have internal predecessors, (887), 0 states have call successors, (0), 0 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-12 00:57:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 887 transitions. [2024-11-12 00:57:41,716 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 887 transitions. Word has length 304 [2024-11-12 00:57:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:41,717 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 887 transitions. [2024-11-12 00:57:41,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 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-12 00:57:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 887 transitions. [2024-11-12 00:57:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-12 00:57:41,721 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:41,721 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:57:41,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 00:57:41,721 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:41,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:41,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1640945406, now seen corresponding path program 1 times [2024-11-12 00:57:41,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:41,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276263399] [2024-11-12 00:57:41,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:41,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:47,860 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:47,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:47,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276263399] [2024-11-12 00:57:47,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276263399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:47,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:47,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:57:47,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59053585] [2024-11-12 00:57:47,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:47,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:57:47,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:47,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:57:47,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:57:47,864 INFO L87 Difference]: Start difference. First operand 602 states and 887 transitions. Second operand has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 0 states have call successors, (0), 0 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-12 00:57:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:48,166 INFO L93 Difference]: Finished difference Result 1285 states and 1899 transitions. [2024-11-12 00:57:48,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:57:48,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 0 states have call successors, (0), 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 304 [2024-11-12 00:57:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:48,170 INFO L225 Difference]: With dead ends: 1285 [2024-11-12 00:57:48,170 INFO L226 Difference]: Without dead ends: 762 [2024-11-12 00:57:48,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:57:48,172 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 1299 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:48,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 2256 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:57:48,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-12 00:57:48,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 610. [2024-11-12 00:57:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 609 states have (on average 1.4696223316912973) internal successors, (895), 609 states have internal predecessors, (895), 0 states have call successors, (0), 0 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-12 00:57:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 895 transitions. [2024-11-12 00:57:48,186 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 895 transitions. Word has length 304 [2024-11-12 00:57:48,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:48,187 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 895 transitions. [2024-11-12 00:57:48,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 0 states have call successors, (0), 0 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-12 00:57:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 895 transitions. [2024-11-12 00:57:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-11-12 00:57:48,191 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:48,191 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:57:48,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 00:57:48,192 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:48,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash -820265667, now seen corresponding path program 1 times [2024-11-12 00:57:48,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:48,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263226057] [2024-11-12 00:57:48,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:48,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:52,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:52,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263226057] [2024-11-12 00:57:52,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263226057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:52,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:52,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:57:52,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210995845] [2024-11-12 00:57:52,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:52,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:57:52,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:52,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:57:52,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:57:52,764 INFO L87 Difference]: Start difference. First operand 610 states and 895 transitions. Second operand has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 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-12 00:57:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:52,976 INFO L93 Difference]: Finished difference Result 1285 states and 1898 transitions. [2024-11-12 00:57:52,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:57:52,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 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 305 [2024-11-12 00:57:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:52,979 INFO L225 Difference]: With dead ends: 1285 [2024-11-12 00:57:52,979 INFO L226 Difference]: Without dead ends: 762 [2024-11-12 00:57:52,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:57:52,981 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 1270 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:52,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 2267 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:57:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2024-11-12 00:57:52,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 611. [2024-11-12 00:57:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 610 states have (on average 1.4688524590163934) internal successors, (896), 610 states have internal predecessors, (896), 0 states have call successors, (0), 0 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-12 00:57:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 896 transitions. [2024-11-12 00:57:52,992 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 896 transitions. Word has length 305 [2024-11-12 00:57:52,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:52,993 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 896 transitions. [2024-11-12 00:57:52,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 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-12 00:57:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 896 transitions. [2024-11-12 00:57:52,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-12 00:57:52,997 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:52,997 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:57:52,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 00:57:52,997 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:52,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash -929940191, now seen corresponding path program 1 times [2024-11-12 00:57:52,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:52,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22014125] [2024-11-12 00:57:52,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:52,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22014125] [2024-11-12 00:57:58,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22014125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:57:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995128237] [2024-11-12 00:57:58,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:58,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:57:58,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:57:58,505 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-12 00:57:58,507 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-12 00:58:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:00,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 2514 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 00:58:00,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:58:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:01,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:58:03,243 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:03,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995128237] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:58:03,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 00:58:03,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 18 [2024-11-12 00:58:03,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382865392] [2024-11-12 00:58:03,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 00:58:03,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 00:58:03,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:03,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 00:58:03,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-11-12 00:58:03,248 INFO L87 Difference]: Start difference. First operand 611 states and 896 transitions. Second operand has 18 states, 18 states have (on average 49.888888888888886) internal successors, (898), 18 states have internal predecessors, (898), 0 states have call successors, (0), 0 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-12 00:58:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:04,438 INFO L93 Difference]: Finished difference Result 1851 states and 2736 transitions. [2024-11-12 00:58:04,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 00:58:04,439 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 49.888888888888886) internal successors, (898), 18 states have internal predecessors, (898), 0 states have call successors, (0), 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 306 [2024-11-12 00:58:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:04,444 INFO L225 Difference]: With dead ends: 1851 [2024-11-12 00:58:04,444 INFO L226 Difference]: Without dead ends: 1328 [2024-11-12 00:58:04,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2024-11-12 00:58:04,446 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 3755 mSDsluCounter, 4759 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3755 SdHoareTripleChecker+Valid, 5380 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:04,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3755 Valid, 5380 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 00:58:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2024-11-12 00:58:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1046. [2024-11-12 00:58:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1045 states have (on average 1.476555023923445) internal successors, (1543), 1045 states have internal predecessors, (1543), 0 states have call successors, (0), 0 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-12 00:58:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1543 transitions. [2024-11-12 00:58:04,469 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1543 transitions. Word has length 306 [2024-11-12 00:58:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:04,470 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1543 transitions. [2024-11-12 00:58:04,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 49.888888888888886) internal successors, (898), 18 states have internal predecessors, (898), 0 states have call successors, (0), 0 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-12 00:58:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1543 transitions. [2024-11-12 00:58:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-12 00:58:04,474 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:04,475 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:58:04,503 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-12 00:58:04,675 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,SelfDestructingSolverStorable16 [2024-11-12 00:58:04,676 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:04,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1868866315, now seen corresponding path program 1 times [2024-11-12 00:58:04,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:04,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771961192] [2024-11-12 00:58:04,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:04,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:11,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:58:11,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771961192] [2024-11-12 00:58:11,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771961192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:58:11,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043667313] [2024-11-12 00:58:11,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:11,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:58:11,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:58:11,378 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-12 00:58:11,380 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-12 00:58:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:13,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 2515 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-12 00:58:13,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:58:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:13,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 00:58:13,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043667313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:13,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 00:58:13,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2024-11-12 00:58:13,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049642970] [2024-11-12 00:58:13,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:13,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:58:13,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:13,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:58:13,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-12 00:58:13,942 INFO L87 Difference]: Start difference. First operand 1046 states and 1543 transitions. Second operand has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 0 states have call successors, (0), 0 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-12 00:58:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:14,708 INFO L93 Difference]: Finished difference Result 2183 states and 3221 transitions. [2024-11-12 00:58:14,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 00:58:14,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 0 states have call successors, (0), 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 307 [2024-11-12 00:58:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:14,713 INFO L225 Difference]: With dead ends: 2183 [2024-11-12 00:58:14,713 INFO L226 Difference]: Without dead ends: 1225 [2024-11-12 00:58:14,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-12 00:58:14,715 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 1078 mSDsluCounter, 3057 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 3675 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:14,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 3675 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 00:58:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2024-11-12 00:58:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1115. [2024-11-12 00:58:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.4676840215439857) internal successors, (1635), 1114 states have internal predecessors, (1635), 0 states have call successors, (0), 0 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-12 00:58:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1635 transitions. [2024-11-12 00:58:14,755 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1635 transitions. Word has length 307 [2024-11-12 00:58:14,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:14,755 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1635 transitions. [2024-11-12 00:58:14,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.375) internal successors, (307), 8 states have internal predecessors, (307), 0 states have call successors, (0), 0 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-12 00:58:14,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1635 transitions. [2024-11-12 00:58:14,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-12 00:58:14,761 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:14,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:58:14,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 00:58:14,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 00:58:14,963 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:14,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:14,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1822976622, now seen corresponding path program 1 times [2024-11-12 00:58:14,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:14,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410414090] [2024-11-12 00:58:14,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:14,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:58:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:17,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:58:17,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410414090] [2024-11-12 00:58:17,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410414090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:17,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:17,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 00:58:17,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512731967] [2024-11-12 00:58:17,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:17,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 00:58:17,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:58:17,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 00:58:17,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-12 00:58:17,523 INFO L87 Difference]: Start difference. First operand 1115 states and 1635 transitions. Second operand has 9 states, 9 states have (on average 34.22222222222222) internal successors, (308), 9 states have internal predecessors, (308), 0 states have call successors, (0), 0 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-12 00:58:18,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:18,197 INFO L93 Difference]: Finished difference Result 2255 states and 3314 transitions. [2024-11-12 00:58:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 00:58:18,198 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 34.22222222222222) internal successors, (308), 9 states have internal predecessors, (308), 0 states have call successors, (0), 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 308 [2024-11-12 00:58:18,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:18,204 INFO L225 Difference]: With dead ends: 2255 [2024-11-12 00:58:18,205 INFO L226 Difference]: Without dead ends: 1225 [2024-11-12 00:58:18,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-12 00:58:18,207 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 1089 mSDsluCounter, 4057 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 4852 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:18,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 4852 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 00:58:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2024-11-12 00:58:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1115. [2024-11-12 00:58:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.466786355475763) internal successors, (1634), 1114 states have internal predecessors, (1634), 0 states have call successors, (0), 0 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-12 00:58:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1634 transitions. [2024-11-12 00:58:18,228 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1634 transitions. Word has length 308 [2024-11-12 00:58:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:18,228 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1634 transitions. [2024-11-12 00:58:18,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.22222222222222) internal successors, (308), 9 states have internal predecessors, (308), 0 states have call successors, (0), 0 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-12 00:58:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1634 transitions. [2024-11-12 00:58:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-12 00:58:18,231 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:18,232 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:58:18,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 00:58:18,232 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:18,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:18,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1469327982, now seen corresponding path program 1 times [2024-11-12 00:58:18,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:58:18,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964529030] [2024-11-12 00:58:18,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:18,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms