./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d72d7c845292578ad4711d5954bbaa34eac8266f0504ea14ab2c6e0b02bee46d --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 17:52:51,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 17:52:51,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 17:52:51,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 17:52:51,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 17:52:51,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 17:52:51,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 17:52:51,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 17:52:51,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 17:52:51,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 17:52:51,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 17:52:51,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 17:52:51,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 17:52:51,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 17:52:51,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 17:52:51,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 17:52:51,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 17:52:51,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 17:52:51,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 17:52:51,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 17:52:51,321 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 17:52:51,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 17:52:51,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 17:52:51,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 17:52:51,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 17:52:51,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 17:52:51,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 17:52:51,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 17:52:51,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 17:52:51,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 17:52:51,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 17:52:51,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 17:52:51,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 17:52:51,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 17:52:51,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 17:52:51,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 17:52:51,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 17:52:51,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 17:52:51,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 17:52:51,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 17:52:51,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 17:52:51,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 17:52:51,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 17:52:51,375 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 17:52:51,376 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 17:52:51,376 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 17:52:51,376 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 17:52:51,377 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 17:52:51,377 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 17:52:51,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 17:52:51,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 17:52:51,378 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 17:52:51,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 17:52:51,379 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 17:52:51,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 17:52:51,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 17:52:51,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 17:52:51,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 17:52:51,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 17:52:51,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 17:52:51,381 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 17:52:51,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 17:52:51,381 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 17:52:51,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 17:52:51,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 17:52:51,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 17:52:51,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 17:52:51,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:52:51,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 17:52:51,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 17:52:51,382 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 17:52:51,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 17:52:51,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 17:52:51,383 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 17:52:51,383 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 17:52:51,383 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 17:52:51,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d72d7c845292578ad4711d5954bbaa34eac8266f0504ea14ab2c6e0b02bee46d [2022-07-19 17:52:51,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 17:52:51,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 17:52:51,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 17:52:51,631 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 17:52:51,632 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 17:52:51,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c [2022-07-19 17:52:51,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd9e8ccb8/e1ea2d999dc64ce4be069e8339712df1/FLAGa1bb95a90 [2022-07-19 17:52:52,102 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 17:52:52,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c [2022-07-19 17:52:52,115 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd9e8ccb8/e1ea2d999dc64ce4be069e8339712df1/FLAGa1bb95a90 [2022-07-19 17:52:52,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd9e8ccb8/e1ea2d999dc64ce4be069e8339712df1 [2022-07-19 17:52:52,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 17:52:52,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 17:52:52,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 17:52:52,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 17:52:52,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 17:52:52,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:52:52" (1/1) ... [2022-07-19 17:52:52,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c18fd02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:52, skipping insertion in model container [2022-07-19 17:52:52,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:52:52" (1/1) ... [2022-07-19 17:52:52,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 17:52:52,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 17:52:52,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c[31211,31224] [2022-07-19 17:52:52,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:52:52,832 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 17:52:52,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c[31211,31224] [2022-07-19 17:52:52,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:52:52,948 INFO L208 MainTranslator]: Completed translation [2022-07-19 17:52:52,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:52 WrapperNode [2022-07-19 17:52:52,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 17:52:52,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 17:52:52,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 17:52:52,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 17:52:52,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:52" (1/1) ... [2022-07-19 17:52:52,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:52" (1/1) ... [2022-07-19 17:52:53,031 INFO L137 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 1010 [2022-07-19 17:52:53,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 17:52:53,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 17:52:53,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 17:52:53,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 17:52:53,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:52" (1/1) ... [2022-07-19 17:52:53,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:52" (1/1) ... [2022-07-19 17:52:53,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:52" (1/1) ... [2022-07-19 17:52:53,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:52" (1/1) ... [2022-07-19 17:52:53,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:52" (1/1) ... [2022-07-19 17:52:53,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:52" (1/1) ... [2022-07-19 17:52:53,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:52" (1/1) ... [2022-07-19 17:52:53,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 17:52:53,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 17:52:53,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 17:52:53,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 17:52:53,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:52" (1/1) ... [2022-07-19 17:52:53,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:52:53,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:52:53,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 17:52:53,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 17:52:53,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 17:52:53,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 17:52:53,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 17:52:53,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 17:52:53,349 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 17:52:53,351 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 17:52:54,113 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 17:52:54,123 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 17:52:54,123 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 17:52:54,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:52:54 BoogieIcfgContainer [2022-07-19 17:52:54,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 17:52:54,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 17:52:54,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 17:52:54,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 17:52:54,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 05:52:52" (1/3) ... [2022-07-19 17:52:54,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a60ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:52:54, skipping insertion in model container [2022-07-19 17:52:54,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:52" (2/3) ... [2022-07-19 17:52:54,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a60ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:52:54, skipping insertion in model container [2022-07-19 17:52:54,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:52:54" (3/3) ... [2022-07-19 17:52:54,135 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.UNBOUNDED.pals.c [2022-07-19 17:52:54,149 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 17:52:54,150 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 17:52:54,199 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 17:52:54,207 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@27f0798d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@358763e9 [2022-07-19 17:52:54,207 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 17:52:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 333 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 332 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 17:52:54,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:54,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:52:54,232 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:54,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:54,237 INFO L85 PathProgramCache]: Analyzing trace with hash 623353910, now seen corresponding path program 1 times [2022-07-19 17:52:54,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:54,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279248855] [2022-07-19 17:52:54,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:54,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:54,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:52:54,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:54,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279248855] [2022-07-19 17:52:54,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279248855] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:54,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:54,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 17:52:54,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308042514] [2022-07-19 17:52:54,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:54,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 17:52:54,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:54,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 17:52:54,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 17:52:54,637 INFO L87 Difference]: Start difference. First operand has 333 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 332 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:54,701 INFO L93 Difference]: Finished difference Result 467 states and 827 transitions. [2022-07-19 17:52:54,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 17:52:54,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-19 17:52:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:54,725 INFO L225 Difference]: With dead ends: 467 [2022-07-19 17:52:54,726 INFO L226 Difference]: Without dead ends: 329 [2022-07-19 17:52:54,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 17:52:54,739 INFO L413 NwaCegarLoop]: 589 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:52:54,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:52:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-19 17:52:54,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2022-07-19 17:52:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.795731707317073) internal successors, (589), 328 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 589 transitions. [2022-07-19 17:52:54,819 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 589 transitions. Word has length 77 [2022-07-19 17:52:54,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:54,821 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 589 transitions. [2022-07-19 17:52:54,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 589 transitions. [2022-07-19 17:52:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 17:52:54,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:54,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:52:54,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 17:52:54,831 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:54,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash 489340404, now seen corresponding path program 1 times [2022-07-19 17:52:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:54,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718227772] [2022-07-19 17:52:54,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:52:55,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:55,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718227772] [2022-07-19 17:52:55,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718227772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:55,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:55,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:52:55,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613124579] [2022-07-19 17:52:55,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:55,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:52:55,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:55,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:52:55,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:52:55,021 INFO L87 Difference]: Start difference. First operand 329 states and 589 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:55,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:55,146 INFO L93 Difference]: Finished difference Result 466 states and 820 transitions. [2022-07-19 17:52:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:52:55,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-19 17:52:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:55,150 INFO L225 Difference]: With dead ends: 466 [2022-07-19 17:52:55,150 INFO L226 Difference]: Without dead ends: 329 [2022-07-19 17:52:55,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:52:55,154 INFO L413 NwaCegarLoop]: 587 mSDtfsCounter, 3 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:52:55,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2299 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:52:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-19 17:52:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2022-07-19 17:52:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.6554878048780488) internal successors, (543), 328 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 543 transitions. [2022-07-19 17:52:55,164 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 543 transitions. Word has length 77 [2022-07-19 17:52:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:55,164 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 543 transitions. [2022-07-19 17:52:55,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 543 transitions. [2022-07-19 17:52:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-19 17:52:55,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:55,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:52:55,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 17:52:55,166 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:55,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash 268932394, now seen corresponding path program 1 times [2022-07-19 17:52:55,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:55,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918353790] [2022-07-19 17:52:55,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:55,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:52:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:55,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918353790] [2022-07-19 17:52:55,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918353790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:55,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:55,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:52:55,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703300734] [2022-07-19 17:52:55,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:55,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:52:55,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:55,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:52:55,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:52:55,390 INFO L87 Difference]: Start difference. First operand 329 states and 543 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:55,432 INFO L93 Difference]: Finished difference Result 583 states and 975 transitions. [2022-07-19 17:52:55,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:52:55,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2022-07-19 17:52:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:55,435 INFO L225 Difference]: With dead ends: 583 [2022-07-19 17:52:55,435 INFO L226 Difference]: Without dead ends: 450 [2022-07-19 17:52:55,436 INFO L412 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 [2022-07-19 17:52:55,437 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 196 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:52:55,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1022 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:52:55,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-07-19 17:52:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2022-07-19 17:52:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.6591928251121075) internal successors, (740), 446 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 740 transitions. [2022-07-19 17:52:55,451 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 740 transitions. Word has length 122 [2022-07-19 17:52:55,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:55,452 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 740 transitions. [2022-07-19 17:52:55,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:55,452 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 740 transitions. [2022-07-19 17:52:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-19 17:52:55,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:55,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:52:55,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 17:52:55,454 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:55,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:55,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2041791286, now seen corresponding path program 1 times [2022-07-19 17:52:55,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:55,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644709804] [2022-07-19 17:52:55,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:55,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:52:55,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:55,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644709804] [2022-07-19 17:52:55,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644709804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:55,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:55,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:52:55,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382449414] [2022-07-19 17:52:55,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:55,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:52:55,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:55,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:52:55,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:52:55,558 INFO L87 Difference]: Start difference. First operand 447 states and 740 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:55,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:55,589 INFO L93 Difference]: Finished difference Result 929 states and 1552 transitions. [2022-07-19 17:52:55,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:52:55,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2022-07-19 17:52:55,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:55,593 INFO L225 Difference]: With dead ends: 929 [2022-07-19 17:52:55,593 INFO L226 Difference]: Without dead ends: 678 [2022-07-19 17:52:55,594 INFO L412 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 [2022-07-19 17:52:55,595 INFO L413 NwaCegarLoop]: 540 mSDtfsCounter, 197 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:52:55,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1035 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:52:55,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-07-19 17:52:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 674. [2022-07-19 17:52:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 673 states have (on average 1.6656760772659733) internal successors, (1121), 673 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1121 transitions. [2022-07-19 17:52:55,634 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1121 transitions. Word has length 125 [2022-07-19 17:52:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:55,634 INFO L495 AbstractCegarLoop]: Abstraction has 674 states and 1121 transitions. [2022-07-19 17:52:55,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1121 transitions. [2022-07-19 17:52:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-19 17:52:55,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:55,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:52:55,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 17:52:55,636 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:55,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash 703648971, now seen corresponding path program 1 times [2022-07-19 17:52:55,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:55,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69936907] [2022-07-19 17:52:55,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:55,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:52:55,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:55,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69936907] [2022-07-19 17:52:55,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69936907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:55,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:55,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:52:55,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627236795] [2022-07-19 17:52:55,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:55,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:52:55,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:55,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:52:55,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:52:55,773 INFO L87 Difference]: Start difference. First operand 674 states and 1121 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:55,817 INFO L93 Difference]: Finished difference Result 1590 states and 2659 transitions. [2022-07-19 17:52:55,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:52:55,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2022-07-19 17:52:55,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:55,823 INFO L225 Difference]: With dead ends: 1590 [2022-07-19 17:52:55,824 INFO L226 Difference]: Without dead ends: 1112 [2022-07-19 17:52:55,825 INFO L412 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 [2022-07-19 17:52:55,827 INFO L413 NwaCegarLoop]: 540 mSDtfsCounter, 190 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:52:55,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1036 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:52:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2022-07-19 17:52:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1106. [2022-07-19 17:52:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1105 states have (on average 1.6660633484162897) internal successors, (1841), 1105 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1841 transitions. [2022-07-19 17:52:55,864 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1841 transitions. Word has length 128 [2022-07-19 17:52:55,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:55,865 INFO L495 AbstractCegarLoop]: Abstraction has 1106 states and 1841 transitions. [2022-07-19 17:52:55,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1841 transitions. [2022-07-19 17:52:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-19 17:52:55,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:55,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:52:55,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 17:52:55,871 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:55,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:55,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1474863799, now seen corresponding path program 1 times [2022-07-19 17:52:55,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:55,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159105331] [2022-07-19 17:52:55,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:55,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:52:55,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:55,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159105331] [2022-07-19 17:52:55,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159105331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:55,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:55,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:52:55,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156105235] [2022-07-19 17:52:55,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:55,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:52:55,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:55,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:52:55,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:52:55,989 INFO L87 Difference]: Start difference. First operand 1106 states and 1841 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:56,053 INFO L93 Difference]: Finished difference Result 2846 states and 4747 transitions. [2022-07-19 17:52:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:52:56,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2022-07-19 17:52:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:56,061 INFO L225 Difference]: With dead ends: 2846 [2022-07-19 17:52:56,062 INFO L226 Difference]: Without dead ends: 1936 [2022-07-19 17:52:56,064 INFO L412 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 [2022-07-19 17:52:56,067 INFO L413 NwaCegarLoop]: 539 mSDtfsCounter, 182 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:52:56,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1034 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:52:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2022-07-19 17:52:56,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1926. [2022-07-19 17:52:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1925 states have (on average 1.6566233766233767) internal successors, (3189), 1925 states have internal predecessors, (3189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 3189 transitions. [2022-07-19 17:52:56,128 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 3189 transitions. Word has length 131 [2022-07-19 17:52:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:56,129 INFO L495 AbstractCegarLoop]: Abstraction has 1926 states and 3189 transitions. [2022-07-19 17:52:56,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 3189 transitions. [2022-07-19 17:52:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-19 17:52:56,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:56,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:52:56,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 17:52:56,132 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:56,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1321209626, now seen corresponding path program 1 times [2022-07-19 17:52:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:56,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059397789] [2022-07-19 17:52:56,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:52:56,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:56,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059397789] [2022-07-19 17:52:56,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059397789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:56,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:56,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:52:56,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497818106] [2022-07-19 17:52:56,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:56,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:52:56,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:56,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:52:56,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:52:56,237 INFO L87 Difference]: Start difference. First operand 1926 states and 3189 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:56,641 INFO L93 Difference]: Finished difference Result 9994 states and 16717 transitions. [2022-07-19 17:52:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 17:52:56,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2022-07-19 17:52:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:56,672 INFO L225 Difference]: With dead ends: 9994 [2022-07-19 17:52:56,673 INFO L226 Difference]: Without dead ends: 8264 [2022-07-19 17:52:56,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-19 17:52:56,679 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 2132 mSDsluCounter, 3384 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 3917 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:52:56,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 3917 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:52:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8264 states. [2022-07-19 17:52:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8264 to 3541. [2022-07-19 17:52:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3541 states, 3540 states have (on average 1.657909604519774) internal successors, (5869), 3540 states have internal predecessors, (5869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 5869 transitions. [2022-07-19 17:52:56,903 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 5869 transitions. Word has length 134 [2022-07-19 17:52:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:56,904 INFO L495 AbstractCegarLoop]: Abstraction has 3541 states and 5869 transitions. [2022-07-19 17:52:56,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 5869 transitions. [2022-07-19 17:52:56,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-19 17:52:56,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:56,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:52:56,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 17:52:56,907 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:56,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:56,907 INFO L85 PathProgramCache]: Analyzing trace with hash -102431977, now seen corresponding path program 1 times [2022-07-19 17:52:56,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:56,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236734851] [2022-07-19 17:52:56,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:56,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:52:56,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:56,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236734851] [2022-07-19 17:52:56,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236734851] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:56,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:56,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:52:56,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573392523] [2022-07-19 17:52:56,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:56,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:52:56,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:56,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:52:56,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:52:56,975 INFO L87 Difference]: Start difference. First operand 3541 states and 5869 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:57,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:57,252 INFO L93 Difference]: Finished difference Result 10358 states and 17276 transitions. [2022-07-19 17:52:57,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:52:57,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2022-07-19 17:52:57,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:57,281 INFO L225 Difference]: With dead ends: 10358 [2022-07-19 17:52:57,281 INFO L226 Difference]: Without dead ends: 7013 [2022-07-19 17:52:57,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:52:57,289 INFO L413 NwaCegarLoop]: 534 mSDtfsCounter, 661 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:52:57,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1614 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:52:57,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7013 states. [2022-07-19 17:52:57,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7013 to 5260. [2022-07-19 17:52:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5260 states, 5259 states have (on average 1.6609621601064841) internal successors, (8735), 5259 states have internal predecessors, (8735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:57,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 8735 transitions. [2022-07-19 17:52:57,540 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 8735 transitions. Word has length 135 [2022-07-19 17:52:57,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:57,541 INFO L495 AbstractCegarLoop]: Abstraction has 5260 states and 8735 transitions. [2022-07-19 17:52:57,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 8735 transitions. [2022-07-19 17:52:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 17:52:57,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:57,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:52:57,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 17:52:57,546 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:57,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:57,546 INFO L85 PathProgramCache]: Analyzing trace with hash -806026179, now seen corresponding path program 1 times [2022-07-19 17:52:57,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:57,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599168743] [2022-07-19 17:52:57,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:57,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:52:57,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:57,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599168743] [2022-07-19 17:52:57,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599168743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:57,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:57,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:52:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596127798] [2022-07-19 17:52:57,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:57,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:52:57,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:57,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:52:57,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:52:57,620 INFO L87 Difference]: Start difference. First operand 5260 states and 8735 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:57,949 INFO L93 Difference]: Finished difference Result 15432 states and 25708 transitions. [2022-07-19 17:52:57,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:52:57,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2022-07-19 17:52:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:57,992 INFO L225 Difference]: With dead ends: 15432 [2022-07-19 17:52:57,992 INFO L226 Difference]: Without dead ends: 10368 [2022-07-19 17:52:58,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:52:58,003 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 659 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:52:58,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1661 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:52:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10368 states. [2022-07-19 17:52:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10368 to 7790. [2022-07-19 17:52:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7790 states, 7789 states have (on average 1.6591346771087432) internal successors, (12923), 7789 states have internal predecessors, (12923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:58,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7790 states to 7790 states and 12923 transitions. [2022-07-19 17:52:58,348 INFO L78 Accepts]: Start accepts. Automaton has 7790 states and 12923 transitions. Word has length 136 [2022-07-19 17:52:58,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:58,349 INFO L495 AbstractCegarLoop]: Abstraction has 7790 states and 12923 transitions. [2022-07-19 17:52:58,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 7790 states and 12923 transitions. [2022-07-19 17:52:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-19 17:52:58,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:58,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:52:58,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 17:52:58,354 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:58,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:58,355 INFO L85 PathProgramCache]: Analyzing trace with hash -973605618, now seen corresponding path program 1 times [2022-07-19 17:52:58,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:58,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130002751] [2022-07-19 17:52:58,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:58,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:52:58,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:58,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130002751] [2022-07-19 17:52:58,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130002751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:58,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:58,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:52:58,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698916406] [2022-07-19 17:52:58,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:58,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:52:58,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:58,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:52:58,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:52:58,420 INFO L87 Difference]: Start difference. First operand 7790 states and 12923 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:58,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:58,859 INFO L93 Difference]: Finished difference Result 22912 states and 38120 transitions. [2022-07-19 17:52:58,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:52:58,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2022-07-19 17:52:58,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:58,897 INFO L225 Difference]: With dead ends: 22912 [2022-07-19 17:52:58,898 INFO L226 Difference]: Without dead ends: 15318 [2022-07-19 17:52:58,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:52:58,915 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 657 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:52:58,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1774 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:52:58,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15318 states. [2022-07-19 17:52:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15318 to 11520. [2022-07-19 17:52:59,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11520 states, 11519 states have (on average 1.6571751020053824) internal successors, (19089), 11519 states have internal predecessors, (19089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11520 states to 11520 states and 19089 transitions. [2022-07-19 17:52:59,388 INFO L78 Accepts]: Start accepts. Automaton has 11520 states and 19089 transitions. Word has length 137 [2022-07-19 17:52:59,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:59,388 INFO L495 AbstractCegarLoop]: Abstraction has 11520 states and 19089 transitions. [2022-07-19 17:52:59,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:52:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 11520 states and 19089 transitions. [2022-07-19 17:52:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 17:52:59,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:59,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:52:59,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 17:52:59,395 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:59,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:59,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1704596588, now seen corresponding path program 1 times [2022-07-19 17:52:59,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:59,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282239290] [2022-07-19 17:52:59,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:59,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:52:59,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:59,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282239290] [2022-07-19 17:52:59,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282239290] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:59,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:59,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:52:59,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872663181] [2022-07-19 17:52:59,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:59,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:52:59,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:59,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:52:59,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:52:59,519 INFO L87 Difference]: Start difference. First operand 11520 states and 19089 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:00,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:53:00,102 INFO L93 Difference]: Finished difference Result 33796 states and 56192 transitions. [2022-07-19 17:53:00,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:53:00,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2022-07-19 17:53:00,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:53:00,157 INFO L225 Difference]: With dead ends: 33796 [2022-07-19 17:53:00,158 INFO L226 Difference]: Without dead ends: 22472 [2022-07-19 17:53:00,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:53:00,181 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 655 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:53:00,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1776 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:53:00,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22472 states. [2022-07-19 17:53:00,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22472 to 16948. [2022-07-19 17:53:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16948 states, 16947 states have (on average 1.6562813477311618) internal successors, (28069), 16947 states have internal predecessors, (28069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16948 states to 16948 states and 28069 transitions. [2022-07-19 17:53:00,831 INFO L78 Accepts]: Start accepts. Automaton has 16948 states and 28069 transitions. Word has length 138 [2022-07-19 17:53:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:53:00,832 INFO L495 AbstractCegarLoop]: Abstraction has 16948 states and 28069 transitions. [2022-07-19 17:53:00,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:00,832 INFO L276 IsEmpty]: Start isEmpty. Operand 16948 states and 28069 transitions. [2022-07-19 17:53:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 17:53:00,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:53:00,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:53:00,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 17:53:00,838 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:53:00,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:53:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash 129894331, now seen corresponding path program 1 times [2022-07-19 17:53:00,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:53:00,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587388487] [2022-07-19 17:53:00,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:53:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:53:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:53:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:53:00,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:53:00,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587388487] [2022-07-19 17:53:00,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587388487] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:53:00,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:53:00,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:53:00,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624058109] [2022-07-19 17:53:00,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:53:00,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:53:00,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:53:00,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:53:00,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:53:00,897 INFO L87 Difference]: Start difference. First operand 16948 states and 28069 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:53:01,547 INFO L93 Difference]: Finished difference Result 38152 states and 63185 transitions. [2022-07-19 17:53:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:53:01,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2022-07-19 17:53:01,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:53:01,616 INFO L225 Difference]: With dead ends: 38152 [2022-07-19 17:53:01,616 INFO L226 Difference]: Without dead ends: 26354 [2022-07-19 17:53:01,637 INFO L412 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 [2022-07-19 17:53:01,638 INFO L413 NwaCegarLoop]: 628 mSDtfsCounter, 189 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:53:01,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1132 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:53:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26354 states. [2022-07-19 17:53:02,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26354 to 26352. [2022-07-19 17:53:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26352 states, 26351 states have (on average 1.6485522371067511) internal successors, (43441), 26351 states have internal predecessors, (43441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26352 states to 26352 states and 43441 transitions. [2022-07-19 17:53:02,479 INFO L78 Accepts]: Start accepts. Automaton has 26352 states and 43441 transitions. Word has length 138 [2022-07-19 17:53:02,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:53:02,479 INFO L495 AbstractCegarLoop]: Abstraction has 26352 states and 43441 transitions. [2022-07-19 17:53:02,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:02,480 INFO L276 IsEmpty]: Start isEmpty. Operand 26352 states and 43441 transitions. [2022-07-19 17:53:02,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 17:53:02,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:53:02,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:53:02,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 17:53:02,483 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:53:02,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:53:02,484 INFO L85 PathProgramCache]: Analyzing trace with hash -807858639, now seen corresponding path program 1 times [2022-07-19 17:53:02,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:53:02,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208011991] [2022-07-19 17:53:02,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:53:02,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:53:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:53:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:53:02,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:53:02,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208011991] [2022-07-19 17:53:02,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208011991] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:53:02,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:53:02,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:53:02,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054677766] [2022-07-19 17:53:02,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:53:02,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:53:02,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:53:02,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:53:02,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:53:02,546 INFO L87 Difference]: Start difference. First operand 26352 states and 43441 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:03,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:53:03,543 INFO L93 Difference]: Finished difference Result 58622 states and 96675 transitions. [2022-07-19 17:53:03,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:53:03,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2022-07-19 17:53:03,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:53:03,641 INFO L225 Difference]: With dead ends: 58622 [2022-07-19 17:53:03,641 INFO L226 Difference]: Without dead ends: 40268 [2022-07-19 17:53:03,670 INFO L412 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 [2022-07-19 17:53:03,671 INFO L413 NwaCegarLoop]: 674 mSDtfsCounter, 196 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:53:03,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:53:03,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40268 states. [2022-07-19 17:53:04,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40268 to 40266. [2022-07-19 17:53:04,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40266 states, 40265 states have (on average 1.641053023717869) internal successors, (66077), 40265 states have internal predecessors, (66077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40266 states to 40266 states and 66077 transitions. [2022-07-19 17:53:04,808 INFO L78 Accepts]: Start accepts. Automaton has 40266 states and 66077 transitions. Word has length 138 [2022-07-19 17:53:04,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:53:04,809 INFO L495 AbstractCegarLoop]: Abstraction has 40266 states and 66077 transitions. [2022-07-19 17:53:04,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:04,809 INFO L276 IsEmpty]: Start isEmpty. Operand 40266 states and 66077 transitions. [2022-07-19 17:53:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 17:53:04,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:53:04,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:53:04,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 17:53:04,812 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:53:04,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:53:04,813 INFO L85 PathProgramCache]: Analyzing trace with hash -332007685, now seen corresponding path program 1 times [2022-07-19 17:53:04,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:53:04,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180277829] [2022-07-19 17:53:04,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:53:04,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:53:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:53:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:53:04,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:53:04,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180277829] [2022-07-19 17:53:04,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180277829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:53:04,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:53:04,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:53:04,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665975959] [2022-07-19 17:53:04,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:53:04,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:53:04,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:53:04,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:53:04,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:53:04,879 INFO L87 Difference]: Start difference. First operand 40266 states and 66077 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:53:06,335 INFO L93 Difference]: Finished difference Result 90058 states and 148401 transitions. [2022-07-19 17:53:06,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:53:06,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2022-07-19 17:53:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:53:06,473 INFO L225 Difference]: With dead ends: 90058 [2022-07-19 17:53:06,473 INFO L226 Difference]: Without dead ends: 61494 [2022-07-19 17:53:06,510 INFO L412 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 [2022-07-19 17:53:06,511 INFO L413 NwaCegarLoop]: 712 mSDtfsCounter, 203 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:53:06,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1214 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:53:06,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61494 states. [2022-07-19 17:53:08,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61494 to 61492. [2022-07-19 17:53:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61492 states, 61491 states have (on average 1.6366460132377096) internal successors, (100639), 61491 states have internal predecessors, (100639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61492 states to 61492 states and 100639 transitions. [2022-07-19 17:53:08,533 INFO L78 Accepts]: Start accepts. Automaton has 61492 states and 100639 transitions. Word has length 138 [2022-07-19 17:53:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:53:08,534 INFO L495 AbstractCegarLoop]: Abstraction has 61492 states and 100639 transitions. [2022-07-19 17:53:08,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:08,534 INFO L276 IsEmpty]: Start isEmpty. Operand 61492 states and 100639 transitions. [2022-07-19 17:53:08,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-19 17:53:08,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:53:08,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:53:08,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 17:53:08,536 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:53:08,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:53:08,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1686527611, now seen corresponding path program 1 times [2022-07-19 17:53:08,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:53:08,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547787429] [2022-07-19 17:53:08,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:53:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:53:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:53:08,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:53:08,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:53:08,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547787429] [2022-07-19 17:53:08,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547787429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:53:08,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:53:08,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:53:08,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743803894] [2022-07-19 17:53:08,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:53:08,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:53:08,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:53:08,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:53:08,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:53:08,592 INFO L87 Difference]: Start difference. First operand 61492 states and 100639 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:10,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:53:10,855 INFO L93 Difference]: Finished difference Result 135406 states and 221664 transitions. [2022-07-19 17:53:10,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:53:10,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-19 17:53:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:53:11,163 INFO L225 Difference]: With dead ends: 135406 [2022-07-19 17:53:11,163 INFO L226 Difference]: Without dead ends: 92182 [2022-07-19 17:53:11,210 INFO L412 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 [2022-07-19 17:53:11,211 INFO L413 NwaCegarLoop]: 643 mSDtfsCounter, 180 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:53:11,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1148 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:53:11,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92182 states. [2022-07-19 17:53:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92182 to 92180. [2022-07-19 17:53:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92180 states, 92179 states have (on average 1.625055598346695) internal successors, (149796), 92179 states have internal predecessors, (149796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92180 states to 92180 states and 149796 transitions. [2022-07-19 17:53:14,093 INFO L78 Accepts]: Start accepts. Automaton has 92180 states and 149796 transitions. Word has length 139 [2022-07-19 17:53:14,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:53:14,094 INFO L495 AbstractCegarLoop]: Abstraction has 92180 states and 149796 transitions. [2022-07-19 17:53:14,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 92180 states and 149796 transitions. [2022-07-19 17:53:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-19 17:53:14,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:53:14,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:53:14,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 17:53:14,097 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:53:14,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:53:14,098 INFO L85 PathProgramCache]: Analyzing trace with hash 344039084, now seen corresponding path program 1 times [2022-07-19 17:53:14,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:53:14,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305291772] [2022-07-19 17:53:14,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:53:14,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:53:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:53:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:53:14,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:53:14,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305291772] [2022-07-19 17:53:14,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305291772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:53:14,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:53:14,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:53:14,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521562642] [2022-07-19 17:53:14,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:53:14,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:53:14,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:53:14,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:53:14,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:53:14,496 INFO L87 Difference]: Start difference. First operand 92180 states and 149796 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:53:17,141 INFO L93 Difference]: Finished difference Result 184116 states and 299200 transitions. [2022-07-19 17:53:17,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:53:17,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2022-07-19 17:53:17,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:53:17,326 INFO L225 Difference]: With dead ends: 184116 [2022-07-19 17:53:17,326 INFO L226 Difference]: Without dead ends: 92182 [2022-07-19 17:53:17,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-19 17:53:17,397 INFO L413 NwaCegarLoop]: 540 mSDtfsCounter, 529 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:53:17,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 2049 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:53:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92182 states. [2022-07-19 17:53:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92182 to 92180. [2022-07-19 17:53:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92180 states, 92179 states have (on average 1.6182753121643758) internal successors, (149171), 92179 states have internal predecessors, (149171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92180 states to 92180 states and 149171 transitions. [2022-07-19 17:53:20,370 INFO L78 Accepts]: Start accepts. Automaton has 92180 states and 149171 transitions. Word has length 140 [2022-07-19 17:53:20,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:53:20,371 INFO L495 AbstractCegarLoop]: Abstraction has 92180 states and 149171 transitions. [2022-07-19 17:53:20,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:20,371 INFO L276 IsEmpty]: Start isEmpty. Operand 92180 states and 149171 transitions. [2022-07-19 17:53:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-19 17:53:20,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:53:20,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:53:20,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 17:53:20,373 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:53:20,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:53:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash 429168721, now seen corresponding path program 1 times [2022-07-19 17:53:20,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:53:20,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529176048] [2022-07-19 17:53:20,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:53:20,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:53:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:53:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:53:20,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:53:20,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529176048] [2022-07-19 17:53:20,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529176048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:53:20,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:53:20,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:53:20,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374760272] [2022-07-19 17:53:20,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:53:20,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:53:20,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:53:20,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:53:20,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:53:20,713 INFO L87 Difference]: Start difference. First operand 92180 states and 149171 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:25,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:53:25,743 INFO L93 Difference]: Finished difference Result 269524 states and 436612 transitions. [2022-07-19 17:53:25,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:53:25,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-07-19 17:53:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:53:26,094 INFO L225 Difference]: With dead ends: 269524 [2022-07-19 17:53:26,095 INFO L226 Difference]: Without dead ends: 177590 [2022-07-19 17:53:26,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-19 17:53:26,166 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 705 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:53:26,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 2059 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:53:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177590 states. [2022-07-19 17:53:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177590 to 177588. [2022-07-19 17:53:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177588 states, 177587 states have (on average 1.609442132588534) internal successors, (285816), 177587 states have internal predecessors, (285816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177588 states to 177588 states and 285816 transitions. [2022-07-19 17:53:32,164 INFO L78 Accepts]: Start accepts. Automaton has 177588 states and 285816 transitions. Word has length 143 [2022-07-19 17:53:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:53:32,165 INFO L495 AbstractCegarLoop]: Abstraction has 177588 states and 285816 transitions. [2022-07-19 17:53:32,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:53:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 177588 states and 285816 transitions. [2022-07-19 17:53:32,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-19 17:53:32,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:53:32,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:53:32,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 17:53:32,166 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:53:32,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:53:32,167 INFO L85 PathProgramCache]: Analyzing trace with hash -12016747, now seen corresponding path program 1 times [2022-07-19 17:53:32,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:53:32,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380119429] [2022-07-19 17:53:32,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:53:32,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:53:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:53:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:53:32,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:53:32,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380119429] [2022-07-19 17:53:32,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380119429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:53:32,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:53:32,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 17:53:32,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012422045] [2022-07-19 17:53:32,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:53:32,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 17:53:32,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:53:32,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 17:53:32,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 17:53:32,304 INFO L87 Difference]: Start difference. First operand 177588 states and 285816 transitions. Second operand has 8 states, 8 states have (on average 18.0) internal successors, (144), 8 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)