./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.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.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 0ace7a09f7f3838d487cff246c419fb4727963d1c82067e9bae91cd3f078ad54 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 17:52:46,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 17:52:46,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 17:52:46,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 17:52:46,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 17:52:46,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 17:52:46,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 17:52:46,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 17:52:46,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 17:52:46,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 17:52:46,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 17:52:46,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 17:52:46,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 17:52:46,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 17:52:46,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 17:52:46,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 17:52:46,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 17:52:46,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 17:52:46,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 17:52:46,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 17:52:46,390 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 17:52:46,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 17:52:46,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 17:52:46,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 17:52:46,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 17:52:46,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 17:52:46,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 17:52:46,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 17:52:46,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 17:52:46,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 17:52:46,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 17:52:46,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 17:52:46,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 17:52:46,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 17:52:46,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 17:52:46,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 17:52:46,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 17:52:46,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 17:52:46,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 17:52:46,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 17:52:46,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 17:52:46,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 17:52:46,403 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:46,417 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 17:52:46,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 17:52:46,417 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 17:52:46,418 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 17:52:46,418 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 17:52:46,418 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 17:52:46,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 17:52:46,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 17:52:46,419 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 17:52:46,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 17:52:46,420 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 17:52:46,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 17:52:46,420 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 17:52:46,420 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 17:52:46,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 17:52:46,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 17:52:46,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 17:52:46,421 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 17:52:46,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 17:52:46,421 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 17:52:46,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 17:52:46,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 17:52:46,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 17:52:46,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 17:52:46,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:52:46,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 17:52:46,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 17:52:46,423 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 17:52:46,423 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 17:52:46,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 17:52:46,423 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 17:52:46,423 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 17:52:46,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 17:52:46,424 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 -> 0ace7a09f7f3838d487cff246c419fb4727963d1c82067e9bae91cd3f078ad54 [2022-07-19 17:52:46,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 17:52:46,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 17:52:46,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 17:52:46,610 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 17:52:46,611 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 17:52:46,611 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.4.ufo.UNBOUNDED.pals.c [2022-07-19 17:52:46,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2a0edb7d/3c8ff808ace14e3c853b143b5e4c83f1/FLAG2ed95fc15 [2022-07-19 17:52:47,113 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 17:52:47,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c [2022-07-19 17:52:47,121 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2a0edb7d/3c8ff808ace14e3c853b143b5e4c83f1/FLAG2ed95fc15 [2022-07-19 17:52:47,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2a0edb7d/3c8ff808ace14e3c853b143b5e4c83f1 [2022-07-19 17:52:47,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 17:52:47,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 17:52:47,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 17:52:47,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 17:52:47,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 17:52:47,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:52:47" (1/1) ... [2022-07-19 17:52:47,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1976d24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:47, skipping insertion in model container [2022-07-19 17:52:47,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:52:47" (1/1) ... [2022-07-19 17:52:47,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 17:52:47,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 17:52:47,417 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.4.ufo.UNBOUNDED.pals.c[31172,31185] [2022-07-19 17:52:47,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:52:47,425 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 17:52:47,478 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.4.ufo.UNBOUNDED.pals.c[31172,31185] [2022-07-19 17:52:47,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:52:47,499 INFO L208 MainTranslator]: Completed translation [2022-07-19 17:52:47,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:47 WrapperNode [2022-07-19 17:52:47,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 17:52:47,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 17:52:47,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 17:52:47,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 17:52:47,507 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:47" (1/1) ... [2022-07-19 17:52:47,524 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:47" (1/1) ... [2022-07-19 17:52:47,560 INFO L137 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 1008 [2022-07-19 17:52:47,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 17:52:47,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 17:52:47,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 17:52:47,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 17:52:47,566 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:47" (1/1) ... [2022-07-19 17:52:47,567 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:47" (1/1) ... [2022-07-19 17:52:47,569 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:47" (1/1) ... [2022-07-19 17:52:47,569 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:47" (1/1) ... [2022-07-19 17:52:47,580 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:47" (1/1) ... [2022-07-19 17:52:47,590 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:47" (1/1) ... [2022-07-19 17:52:47,603 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:47" (1/1) ... [2022-07-19 17:52:47,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 17:52:47,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 17:52:47,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 17:52:47,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 17:52:47,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:47" (1/1) ... [2022-07-19 17:52:47,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:52:47,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:52:47,643 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:47,679 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:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 17:52:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 17:52:47,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 17:52:47,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 17:52:47,823 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 17:52:47,825 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 17:52:48,536 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 17:52:48,543 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 17:52:48,555 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 17:52:48,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:52:48 BoogieIcfgContainer [2022-07-19 17:52:48,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 17:52:48,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 17:52:48,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 17:52:48,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 17:52:48,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 05:52:47" (1/3) ... [2022-07-19 17:52:48,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4714254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:52:48, skipping insertion in model container [2022-07-19 17:52:48,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:52:47" (2/3) ... [2022-07-19 17:52:48,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4714254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:52:48, skipping insertion in model container [2022-07-19 17:52:48,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:52:48" (3/3) ... [2022-07-19 17:52:48,566 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c [2022-07-19 17:52:48,576 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 17:52:48,576 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 17:52:48,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 17:52:48,656 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@675581bd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3046472 [2022-07-19 17:52:48,656 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 17:52:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 332 states, 330 states have (on average 1.8) internal successors, (594), 331 states have internal predecessors, (594), 0 states have call successors, (0), 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:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 17:52:48,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:48,690 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:48,691 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:48,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:48,696 INFO L85 PathProgramCache]: Analyzing trace with hash -196336848, now seen corresponding path program 1 times [2022-07-19 17:52:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:48,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742528002] [2022-07-19 17:52:48,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:48,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:48,981 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:48,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:48,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742528002] [2022-07-19 17:52:48,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742528002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:48,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:48,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 17:52:48,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204635657] [2022-07-19 17:52:48,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:48,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 17:52:48,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:49,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 17:52:49,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 17:52:49,014 INFO L87 Difference]: Start difference. First operand has 332 states, 330 states have (on average 1.8) internal successors, (594), 331 states have internal predecessors, (594), 0 states have call successors, (0), 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:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:49,059 INFO L93 Difference]: Finished difference Result 465 states and 823 transitions. [2022-07-19 17:52:49,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 17:52:49,061 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:49,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:49,075 INFO L225 Difference]: With dead ends: 465 [2022-07-19 17:52:49,075 INFO L226 Difference]: Without dead ends: 328 [2022-07-19 17:52:49,079 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:49,081 INFO L413 NwaCegarLoop]: 587 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, 587 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:49,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 587 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:49,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-07-19 17:52:49,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2022-07-19 17:52:49,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.7951070336391437) internal successors, (587), 327 states have internal predecessors, (587), 0 states have call successors, (0), 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:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 587 transitions. [2022-07-19 17:52:49,118 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 587 transitions. Word has length 77 [2022-07-19 17:52:49,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:49,118 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 587 transitions. [2022-07-19 17:52:49,118 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:49,119 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 587 transitions. [2022-07-19 17:52:49,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 17:52:49,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:49,120 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:49,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 17:52:49,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:49,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:49,122 INFO L85 PathProgramCache]: Analyzing trace with hash -330350354, now seen corresponding path program 1 times [2022-07-19 17:52:49,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:49,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741648150] [2022-07-19 17:52:49,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:49,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:49,230 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:49,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:49,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741648150] [2022-07-19 17:52:49,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741648150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:49,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:49,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:52:49,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701550585] [2022-07-19 17:52:49,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:49,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:52:49,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:49,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:52:49,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:52:49,235 INFO L87 Difference]: Start difference. First operand 328 states and 587 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:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:49,325 INFO L93 Difference]: Finished difference Result 464 states and 816 transitions. [2022-07-19 17:52:49,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:52:49,325 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:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:49,326 INFO L225 Difference]: With dead ends: 464 [2022-07-19 17:52:49,326 INFO L226 Difference]: Without dead ends: 328 [2022-07-19 17:52:49,327 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:49,328 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 3 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2291 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:49,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2291 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:49,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-07-19 17:52:49,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2022-07-19 17:52:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.654434250764526) internal successors, (541), 327 states have internal predecessors, (541), 0 states have call successors, (0), 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:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 541 transitions. [2022-07-19 17:52:49,352 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 541 transitions. Word has length 77 [2022-07-19 17:52:49,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:49,354 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 541 transitions. [2022-07-19 17:52:49,354 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:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 541 transitions. [2022-07-19 17:52:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-19 17:52:49,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:49,357 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:49,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 17:52:49,357 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:49,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:49,358 INFO L85 PathProgramCache]: Analyzing trace with hash -550758364, now seen corresponding path program 1 times [2022-07-19 17:52:49,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:49,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654423195] [2022-07-19 17:52:49,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:49,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:49,522 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:49,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:49,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654423195] [2022-07-19 17:52:49,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654423195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:49,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:49,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:52:49,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135549290] [2022-07-19 17:52:49,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:49,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:52:49,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:49,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:52:49,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:52:49,526 INFO L87 Difference]: Start difference. First operand 328 states and 541 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:49,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:49,565 INFO L93 Difference]: Finished difference Result 580 states and 969 transitions. [2022-07-19 17:52:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:52:49,566 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:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:49,569 INFO L225 Difference]: With dead ends: 580 [2022-07-19 17:52:49,569 INFO L226 Difference]: Without dead ends: 448 [2022-07-19 17:52:49,572 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:49,573 INFO L413 NwaCegarLoop]: 534 mSDtfsCounter, 194 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1018 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:49,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1018 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:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2022-07-19 17:52:49,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 445. [2022-07-19 17:52:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.6576576576576576) internal successors, (736), 444 states have internal predecessors, (736), 0 states have call successors, (0), 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:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 736 transitions. [2022-07-19 17:52:49,593 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 736 transitions. Word has length 122 [2022-07-19 17:52:49,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:49,594 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 736 transitions. [2022-07-19 17:52:49,594 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:49,594 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 736 transitions. [2022-07-19 17:52:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-19 17:52:49,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:49,596 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:49,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 17:52:49,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:49,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:49,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1222100528, now seen corresponding path program 1 times [2022-07-19 17:52:49,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:49,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602973544] [2022-07-19 17:52:49,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:49,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:49,671 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:49,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:49,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602973544] [2022-07-19 17:52:49,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602973544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:49,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:49,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:52:49,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766241888] [2022-07-19 17:52:49,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:49,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:52:49,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:49,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:52:49,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:52:49,675 INFO L87 Difference]: Start difference. First operand 445 states and 736 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:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:49,704 INFO L93 Difference]: Finished difference Result 923 states and 1540 transitions. [2022-07-19 17:52:49,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:52:49,705 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:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:49,721 INFO L225 Difference]: With dead ends: 923 [2022-07-19 17:52:49,722 INFO L226 Difference]: Without dead ends: 674 [2022-07-19 17:52:49,724 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:49,727 INFO L413 NwaCegarLoop]: 538 mSDtfsCounter, 195 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1031 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:49,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1031 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:49,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-07-19 17:52:49,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 670. [2022-07-19 17:52:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 1.663677130044843) internal successors, (1113), 669 states have internal predecessors, (1113), 0 states have call successors, (0), 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:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1113 transitions. [2022-07-19 17:52:49,768 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1113 transitions. Word has length 125 [2022-07-19 17:52:49,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:49,769 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 1113 transitions. [2022-07-19 17:52:49,770 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:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1113 transitions. [2022-07-19 17:52:49,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-19 17:52:49,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:49,772 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:49,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 17:52:49,773 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:49,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:49,773 INFO L85 PathProgramCache]: Analyzing trace with hash -116041787, now seen corresponding path program 1 times [2022-07-19 17:52:49,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:49,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914623646] [2022-07-19 17:52:49,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:49,859 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:49,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:49,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914623646] [2022-07-19 17:52:49,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914623646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:49,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:49,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:52:49,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109561572] [2022-07-19 17:52:49,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:49,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:52:49,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:49,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:52:49,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:52:49,861 INFO L87 Difference]: Start difference. First operand 670 states and 1113 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:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:49,898 INFO L93 Difference]: Finished difference Result 1578 states and 2635 transitions. [2022-07-19 17:52:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:52:49,899 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:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:49,904 INFO L225 Difference]: With dead ends: 1578 [2022-07-19 17:52:49,904 INFO L226 Difference]: Without dead ends: 1104 [2022-07-19 17:52:49,905 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:49,907 INFO L413 NwaCegarLoop]: 538 mSDtfsCounter, 188 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1032 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:49,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1032 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:49,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2022-07-19 17:52:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1098. [2022-07-19 17:52:49,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 1097 states have (on average 1.6636280765724705) internal successors, (1825), 1097 states have internal predecessors, (1825), 0 states have call successors, (0), 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:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1825 transitions. [2022-07-19 17:52:49,935 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1825 transitions. Word has length 128 [2022-07-19 17:52:49,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:49,936 INFO L495 AbstractCegarLoop]: Abstraction has 1098 states and 1825 transitions. [2022-07-19 17:52:49,937 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:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1825 transitions. [2022-07-19 17:52:49,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-19 17:52:49,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:49,940 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:49,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 17:52:49,940 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:49,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:49,941 INFO L85 PathProgramCache]: Analyzing trace with hash 655173041, now seen corresponding path program 1 times [2022-07-19 17:52:49,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:49,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166239605] [2022-07-19 17:52:49,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:49,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:50,029 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:50,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:50,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166239605] [2022-07-19 17:52:50,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166239605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:50,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:50,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:52:50,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784052565] [2022-07-19 17:52:50,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:50,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:52:50,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:50,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:52:50,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:52:50,032 INFO L87 Difference]: Start difference. First operand 1098 states and 1825 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:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:50,071 INFO L93 Difference]: Finished difference Result 2822 states and 4699 transitions. [2022-07-19 17:52:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:52:50,072 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:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:50,079 INFO L225 Difference]: With dead ends: 2822 [2022-07-19 17:52:50,079 INFO L226 Difference]: Without dead ends: 1920 [2022-07-19 17:52:50,081 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:50,082 INFO L413 NwaCegarLoop]: 538 mSDtfsCounter, 181 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1033 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:50,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1033 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:50,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2022-07-19 17:52:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1910. [2022-07-19 17:52:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1909 states have (on average 1.6579360921948665) internal successors, (3165), 1909 states have internal predecessors, (3165), 0 states have call successors, (0), 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:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 3165 transitions. [2022-07-19 17:52:50,131 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 3165 transitions. Word has length 131 [2022-07-19 17:52:50,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:50,132 INFO L495 AbstractCegarLoop]: Abstraction has 1910 states and 3165 transitions. [2022-07-19 17:52:50,132 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:50,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 3165 transitions. [2022-07-19 17:52:50,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-19 17:52:50,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:50,134 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:50,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 17:52:50,143 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:50,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:50,144 INFO L85 PathProgramCache]: Analyzing trace with hash 455457894, now seen corresponding path program 1 times [2022-07-19 17:52:50,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:50,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427489147] [2022-07-19 17:52:50,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:50,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:50,221 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:50,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:50,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427489147] [2022-07-19 17:52:50,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427489147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:50,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:50,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:52:50,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264818460] [2022-07-19 17:52:50,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:50,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:52:50,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:50,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:52:50,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:52:50,223 INFO L87 Difference]: Start difference. First operand 1910 states and 3165 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:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:50,470 INFO L93 Difference]: Finished difference Result 9906 states and 16581 transitions. [2022-07-19 17:52:50,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 17:52:50,470 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:50,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:50,495 INFO L225 Difference]: With dead ends: 9906 [2022-07-19 17:52:50,495 INFO L226 Difference]: Without dead ends: 8192 [2022-07-19 17:52:50,501 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:50,502 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 2412 mSDsluCounter, 3213 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2412 SdHoareTripleChecker+Valid, 3741 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:52:50,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2412 Valid, 3741 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:52:50,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8192 states. [2022-07-19 17:52:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8192 to 3510. [2022-07-19 17:52:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3510 states, 3509 states have (on average 1.6591621544599602) internal successors, (5822), 3509 states have internal predecessors, (5822), 0 states have call successors, (0), 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:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 3510 states and 5822 transitions. [2022-07-19 17:52:50,636 INFO L78 Accepts]: Start accepts. Automaton has 3510 states and 5822 transitions. Word has length 134 [2022-07-19 17:52:50,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:50,636 INFO L495 AbstractCegarLoop]: Abstraction has 3510 states and 5822 transitions. [2022-07-19 17:52:50,636 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:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3510 states and 5822 transitions. [2022-07-19 17:52:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-19 17:52:50,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:50,638 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:50,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 17:52:50,639 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:50,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:50,639 INFO L85 PathProgramCache]: Analyzing trace with hash -860313711, now seen corresponding path program 1 times [2022-07-19 17:52:50,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:50,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809645843] [2022-07-19 17:52:50,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:50,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:50,699 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:50,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:50,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809645843] [2022-07-19 17:52:50,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809645843] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:50,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:50,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:52:50,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605234367] [2022-07-19 17:52:50,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:50,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:52:50,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:50,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:52:50,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:52:50,702 INFO L87 Difference]: Start difference. First operand 3510 states and 5822 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:50,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:50,868 INFO L93 Difference]: Finished difference Result 10266 states and 17136 transitions. [2022-07-19 17:52:50,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:52:50,869 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:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:50,890 INFO L225 Difference]: With dead ends: 10266 [2022-07-19 17:52:50,890 INFO L226 Difference]: Without dead ends: 6952 [2022-07-19 17:52:50,895 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:50,896 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 655 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1607 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:50,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1607 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:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6952 states. [2022-07-19 17:52:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6952 to 5214. [2022-07-19 17:52:51,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5214 states, 5213 states have (on average 1.6621906771532706) internal successors, (8665), 5213 states have internal predecessors, (8665), 0 states have call successors, (0), 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:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5214 states to 5214 states and 8665 transitions. [2022-07-19 17:52:51,076 INFO L78 Accepts]: Start accepts. Automaton has 5214 states and 8665 transitions. Word has length 135 [2022-07-19 17:52:51,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:51,077 INFO L495 AbstractCegarLoop]: Abstraction has 5214 states and 8665 transitions. [2022-07-19 17:52:51,077 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:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 5214 states and 8665 transitions. [2022-07-19 17:52:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-19 17:52:51,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:51,080 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:51,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 17:52:51,080 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:51,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:51,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1469443837, now seen corresponding path program 1 times [2022-07-19 17:52:51,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:51,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040039461] [2022-07-19 17:52:51,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:51,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:51,127 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:51,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:51,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040039461] [2022-07-19 17:52:51,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040039461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:51,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:51,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:52:51,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244595837] [2022-07-19 17:52:51,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:51,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:52:51,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:51,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:52:51,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:52:51,129 INFO L87 Difference]: Start difference. First operand 5214 states and 8665 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:51,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:51,384 INFO L93 Difference]: Finished difference Result 15296 states and 25500 transitions. [2022-07-19 17:52:51,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:52:51,385 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:51,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:51,417 INFO L225 Difference]: With dead ends: 15296 [2022-07-19 17:52:51,418 INFO L226 Difference]: Without dead ends: 10278 [2022-07-19 17:52:51,426 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:51,428 INFO L413 NwaCegarLoop]: 531 mSDtfsCounter, 653 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1654 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:51,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1654 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:51,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10278 states. [2022-07-19 17:52:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10278 to 7722. [2022-07-19 17:52:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7722 states, 7721 states have (on average 1.6602771661701852) internal successors, (12819), 7721 states have internal predecessors, (12819), 0 states have call successors, (0), 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:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7722 states to 7722 states and 12819 transitions. [2022-07-19 17:52:51,689 INFO L78 Accepts]: Start accepts. Automaton has 7722 states and 12819 transitions. Word has length 136 [2022-07-19 17:52:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:51,689 INFO L495 AbstractCegarLoop]: Abstraction has 7722 states and 12819 transitions. [2022-07-19 17:52:51,690 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:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 7722 states and 12819 transitions. [2022-07-19 17:52:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-19 17:52:51,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:51,693 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:51,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 17:52:51,693 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash 846488136, now seen corresponding path program 1 times [2022-07-19 17:52:51,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:51,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798242252] [2022-07-19 17:52:51,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:51,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:51,773 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:51,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:51,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798242252] [2022-07-19 17:52:51,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798242252] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:51,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:51,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:52:51,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329609584] [2022-07-19 17:52:51,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:51,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:52:51,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:51,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:52:51,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:52:51,775 INFO L87 Difference]: Start difference. First operand 7722 states and 12819 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:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:52,092 INFO L93 Difference]: Finished difference Result 22712 states and 37812 transitions. [2022-07-19 17:52:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:52:52,092 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:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:52,120 INFO L225 Difference]: With dead ends: 22712 [2022-07-19 17:52:52,120 INFO L226 Difference]: Without dead ends: 15186 [2022-07-19 17:52:52,133 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:52,134 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 651 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1765 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:52,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1765 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:52,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15186 states. [2022-07-19 17:52:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15186 to 11420. [2022-07-19 17:52:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11420 states, 11419 states have (on average 1.658201243541466) internal successors, (18935), 11419 states have internal predecessors, (18935), 0 states have call successors, (0), 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:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11420 states to 11420 states and 18935 transitions. [2022-07-19 17:52:52,492 INFO L78 Accepts]: Start accepts. Automaton has 11420 states and 18935 transitions. Word has length 137 [2022-07-19 17:52:52,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:52,492 INFO L495 AbstractCegarLoop]: Abstraction has 11420 states and 18935 transitions. [2022-07-19 17:52:52,492 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:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 11420 states and 18935 transitions. [2022-07-19 17:52:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 17:52:52,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:52,495 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:52,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 17:52:52,496 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:52,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:52,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1116265068, now seen corresponding path program 1 times [2022-07-19 17:52:52,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:52,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023110503] [2022-07-19 17:52:52,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:52,538 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:52,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:52,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023110503] [2022-07-19 17:52:52,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023110503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:52,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:52,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:52:52,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931781529] [2022-07-19 17:52:52,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:52,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:52:52,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:52,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:52:52,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:52:52,540 INFO L87 Difference]: Start difference. First operand 11420 states and 18935 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:52:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:52,918 INFO L93 Difference]: Finished difference Result 33504 states and 55700 transitions. [2022-07-19 17:52:52,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:52:52,919 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:52:52,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:52,954 INFO L225 Difference]: With dead ends: 33504 [2022-07-19 17:52:52,955 INFO L226 Difference]: Without dead ends: 22280 [2022-07-19 17:52:52,973 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:52,974 INFO L413 NwaCegarLoop]: 539 mSDtfsCounter, 649 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 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:52,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [649 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:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22280 states. [2022-07-19 17:52:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22280 to 16802. [2022-07-19 17:52:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16802 states, 16801 states have (on average 1.656032379025058) internal successors, (27823), 16801 states have internal predecessors, (27823), 0 states have call successors, (0), 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:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 27823 transitions. [2022-07-19 17:52:53,485 INFO L78 Accepts]: Start accepts. Automaton has 16802 states and 27823 transitions. Word has length 138 [2022-07-19 17:52:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:53,486 INFO L495 AbstractCegarLoop]: Abstraction has 16802 states and 27823 transitions. [2022-07-19 17:52:53,486 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:52:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 16802 states and 27823 transitions. [2022-07-19 17:52:53,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 17:52:53,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:53,490 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:53,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 17:52:53,491 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:53,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:53,492 INFO L85 PathProgramCache]: Analyzing trace with hash -397139727, now seen corresponding path program 1 times [2022-07-19 17:52:53,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:53,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769534215] [2022-07-19 17:52:53,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:53,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:53,533 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:53,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:53,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769534215] [2022-07-19 17:52:53,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769534215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:53,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:53,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:52:53,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358853393] [2022-07-19 17:52:53,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:53,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:52:53,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:53,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:52:53,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:52:53,536 INFO L87 Difference]: Start difference. First operand 16802 states and 27823 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:52:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:53,950 INFO L93 Difference]: Finished difference Result 38312 states and 63393 transitions. [2022-07-19 17:52:53,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:52:53,951 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:52:53,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:53,997 INFO L225 Difference]: With dead ends: 38312 [2022-07-19 17:52:53,997 INFO L226 Difference]: Without dead ends: 26582 [2022-07-19 17:52:54,015 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:54,016 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 180 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1081 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:52:54,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1081 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:52:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26582 states. [2022-07-19 17:52:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26582 to 26580. [2022-07-19 17:52:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26580 states, 26579 states have (on average 1.646149215546108) internal successors, (43753), 26579 states have internal predecessors, (43753), 0 states have call successors, (0), 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,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26580 states to 26580 states and 43753 transitions. [2022-07-19 17:52:54,621 INFO L78 Accepts]: Start accepts. Automaton has 26580 states and 43753 transitions. Word has length 138 [2022-07-19 17:52:54,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:54,621 INFO L495 AbstractCegarLoop]: Abstraction has 26580 states and 43753 transitions. [2022-07-19 17:52:54,621 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:52:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 26580 states and 43753 transitions. [2022-07-19 17:52:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 17:52:54,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:54,625 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:54,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 17:52:54,625 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:54,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:54,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1906561851, now seen corresponding path program 1 times [2022-07-19 17:52:54,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:54,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649337533] [2022-07-19 17:52:54,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:54,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:54,774 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,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:54,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649337533] [2022-07-19 17:52:54,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649337533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:54,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:54,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:52:54,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058209458] [2022-07-19 17:52:54,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:54,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:52:54,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:54,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:52:54,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:52:54,776 INFO L87 Difference]: Start difference. First operand 26580 states and 43753 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:52:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:55,485 INFO L93 Difference]: Finished difference Result 58514 states and 96423 transitions. [2022-07-19 17:52:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:52:55,485 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:52:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:55,541 INFO L225 Difference]: With dead ends: 58514 [2022-07-19 17:52:55,541 INFO L226 Difference]: Without dead ends: 40152 [2022-07-19 17:52:55,563 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,564 INFO L413 NwaCegarLoop]: 624 mSDtfsCounter, 187 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1126 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:52:55,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1126 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:52:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40152 states. [2022-07-19 17:52:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40152 to 40150. [2022-07-19 17:52:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40150 states, 40149 states have (on average 1.6399163117387732) internal successors, (65841), 40149 states have internal predecessors, (65841), 0 states have call successors, (0), 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,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40150 states to 40150 states and 65841 transitions. [2022-07-19 17:52:56,522 INFO L78 Accepts]: Start accepts. Automaton has 40150 states and 65841 transitions. Word has length 138 [2022-07-19 17:52:56,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:56,522 INFO L495 AbstractCegarLoop]: Abstraction has 40150 states and 65841 transitions. [2022-07-19 17:52:56,522 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:52:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 40150 states and 65841 transitions. [2022-07-19 17:52:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 17:52:56,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:56,524 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:56,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 17:52:56,525 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:56,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:56,525 INFO L85 PathProgramCache]: Analyzing trace with hash 968808881, now seen corresponding path program 1 times [2022-07-19 17:52:56,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:56,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668492154] [2022-07-19 17:52:56,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:56,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:56,566 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,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:56,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668492154] [2022-07-19 17:52:56,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668492154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:56,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:56,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:52:56,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082224521] [2022-07-19 17:52:56,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:56,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:52:56,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:56,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:52:56,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:52:56,568 INFO L87 Difference]: Start difference. First operand 40150 states and 65841 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:52:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:52:57,655 INFO L93 Difference]: Finished difference Result 88686 states and 145453 transitions. [2022-07-19 17:52:57,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:52:57,656 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:52:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:52:57,758 INFO L225 Difference]: With dead ends: 88686 [2022-07-19 17:52:57,758 INFO L226 Difference]: Without dead ends: 60584 [2022-07-19 17:52:57,798 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:57,798 INFO L413 NwaCegarLoop]: 670 mSDtfsCounter, 194 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1171 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:52:57,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1171 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:52:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60584 states. [2022-07-19 17:52:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60584 to 60582. [2022-07-19 17:52:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60582 states, 60581 states have (on average 1.6307258051204172) internal successors, (98791), 60581 states have internal predecessors, (98791), 0 states have call successors, (0), 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,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60582 states to 60582 states and 98791 transitions. [2022-07-19 17:52:59,487 INFO L78 Accepts]: Start accepts. Automaton has 60582 states and 98791 transitions. Word has length 138 [2022-07-19 17:52:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:52:59,487 INFO L495 AbstractCegarLoop]: Abstraction has 60582 states and 98791 transitions. [2022-07-19 17:52:59,488 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:52:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 60582 states and 98791 transitions. [2022-07-19 17:52:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 17:52:59,489 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:52:59,489 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,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 17:52:59,490 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:52:59,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:52:59,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1444659835, now seen corresponding path program 1 times [2022-07-19 17:52:59,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:52:59,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490693748] [2022-07-19 17:52:59,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:52:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:52:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:52:59,531 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,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:52:59,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490693748] [2022-07-19 17:52:59,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490693748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:52:59,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:52:59,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:52:59,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768355657] [2022-07-19 17:52:59,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:52:59,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:52:59,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:52:59,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:52:59,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:52:59,533 INFO L87 Difference]: Start difference. First operand 60582 states and 98791 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,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:53:01,568 INFO L93 Difference]: Finished difference Result 134697 states and 220608 transitions. [2022-07-19 17:53:01,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:53:01,569 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,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:53:01,692 INFO L225 Difference]: With dead ends: 134697 [2022-07-19 17:53:01,692 INFO L226 Difference]: Without dead ends: 91486 [2022-07-19 17:53:01,719 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,720 INFO L413 NwaCegarLoop]: 708 mSDtfsCounter, 201 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1208 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,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1208 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,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91486 states. [2022-07-19 17:53:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91486 to 91484. [2022-07-19 17:53:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91484 states, 91483 states have (on average 1.6246406436168468) internal successors, (148627), 91483 states have internal predecessors, (148627), 0 states have call successors, (0), 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,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91484 states to 91484 states and 148627 transitions. [2022-07-19 17:53:04,222 INFO L78 Accepts]: Start accepts. Automaton has 91484 states and 148627 transitions. Word has length 138 [2022-07-19 17:53:04,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:53:04,223 INFO L495 AbstractCegarLoop]: Abstraction has 91484 states and 148627 transitions. [2022-07-19 17:53:04,223 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,223 INFO L276 IsEmpty]: Start isEmpty. Operand 91484 states and 148627 transitions. [2022-07-19 17:53:04,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-19 17:53:04,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:53:04,224 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:04,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 17:53:04,225 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:53:04,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:53:04,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1205053460, now seen corresponding path program 1 times [2022-07-19 17:53:04,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:53:04,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707100283] [2022-07-19 17:53:04,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:53:04,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:53:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:53:04,345 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,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:53:04,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707100283] [2022-07-19 17:53:04,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707100283] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:53:04,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:53:04,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:53:04,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185884961] [2022-07-19 17:53:04,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:53:04,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:53:04,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:53:04,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:53:04,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:53:04,349 INFO L87 Difference]: Start difference. First operand 91484 states and 148627 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:06,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:53:06,825 INFO L93 Difference]: Finished difference Result 182724 states and 296862 transitions. [2022-07-19 17:53:06,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:53:06,825 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:06,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:53:06,955 INFO L225 Difference]: With dead ends: 182724 [2022-07-19 17:53:06,955 INFO L226 Difference]: Without dead ends: 91486 [2022-07-19 17:53:07,003 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:07,003 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 342 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 2541 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:53:07,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 2541 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:53:07,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91486 states. [2022-07-19 17:53:09,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91486 to 91484. [2022-07-19 17:53:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91484 states, 91483 states have (on average 1.6178087732146955) internal successors, (148002), 91483 states have internal predecessors, (148002), 0 states have call successors, (0), 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:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91484 states to 91484 states and 148002 transitions. [2022-07-19 17:53:09,748 INFO L78 Accepts]: Start accepts. Automaton has 91484 states and 148002 transitions. Word has length 140 [2022-07-19 17:53:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:53:09,749 INFO L495 AbstractCegarLoop]: Abstraction has 91484 states and 148002 transitions. [2022-07-19 17:53:09,749 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:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 91484 states and 148002 transitions. [2022-07-19 17:53:09,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-19 17:53:09,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:53:09,752 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:09,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 17:53:09,753 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:53:09,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:53:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash 836779979, now seen corresponding path program 1 times [2022-07-19 17:53:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:53:09,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4427619] [2022-07-19 17:53:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:53:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:53:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:53:10,068 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:10,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:53:10,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4427619] [2022-07-19 17:53:10,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4427619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:53:10,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:53:10,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:53:10,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793265044] [2022-07-19 17:53:10,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:53:10,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:53:10,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:53:10,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:53:10,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:53:10,070 INFO L87 Difference]: Start difference. First operand 91484 states and 148002 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:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:53:14,261 INFO L93 Difference]: Finished difference Result 267490 states and 433186 transitions. [2022-07-19 17:53:14,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:53:14,262 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:14,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:53:14,553 INFO L225 Difference]: With dead ends: 267490 [2022-07-19 17:53:14,553 INFO L226 Difference]: Without dead ends: 176252 [2022-07-19 17:53:14,608 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:14,609 INFO L413 NwaCegarLoop]: 530 mSDtfsCounter, 699 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:53:14,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 2051 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:53:14,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176252 states.