./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.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/bitvector/soft_float_4-2a.c.cil.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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:51:31,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:51:31,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:51:31,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:51:31,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:51:31,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:51:31,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:51:31,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:51:31,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:51:31,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:51:31,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:51:31,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:51:31,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:51:31,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:51:31,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:51:31,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:51:31,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:51:31,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:51:31,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:51:31,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:51:31,479 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:51:31,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:51:31,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:51:31,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:51:31,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:51:31,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:51:31,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:51:31,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:51:31,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:51:31,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:51:31,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:51:31,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:51:31,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:51:31,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:51:31,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:51:31,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:51:31,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:51:31,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:51:31,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:51:31,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:51:31,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:51:31,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:51:31,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:51:31,525 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:51:31,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:51:31,526 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:51:31,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:51:31,526 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:51:31,527 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:51:31,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:51:31,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:51:31,528 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:51:31,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:51:31,529 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:51:31,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:51:31,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:51:31,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:51:31,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:51:31,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:51:31,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:51:31,530 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:51:31,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:51:31,530 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:51:31,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:51:31,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:51:31,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:51:31,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:51:31,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:51:31,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:51:31,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:51:31,533 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:51:31,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:51:31,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:51:31,533 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:51:31,533 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:51:31,534 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:51:31,534 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2022-07-19 10:51:31,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:51:31,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:51:31,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:51:31,750 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:51:31,751 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:51:31,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2022-07-19 10:51:31,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3b750a8/8672d04745014a07bf78d0f07ac52a66/FLAG1fcefbc7f [2022-07-19 10:51:32,162 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:51:32,162 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2022-07-19 10:51:32,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3b750a8/8672d04745014a07bf78d0f07ac52a66/FLAG1fcefbc7f [2022-07-19 10:51:32,184 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3b750a8/8672d04745014a07bf78d0f07ac52a66 [2022-07-19 10:51:32,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:51:32,187 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:51:32,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:51:32,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:51:32,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:51:32,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:51:32" (1/1) ... [2022-07-19 10:51:32,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56fce681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:32, skipping insertion in model container [2022-07-19 10:51:32,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:51:32" (1/1) ... [2022-07-19 10:51:32,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:51:32,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:51:32,352 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/bitvector/soft_float_4-2a.c.cil.c[755,768] [2022-07-19 10:51:32,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:51:32,408 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:51:32,421 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/bitvector/soft_float_4-2a.c.cil.c[755,768] [2022-07-19 10:51:32,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:51:32,470 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:51:32,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:32 WrapperNode [2022-07-19 10:51:32,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:51:32,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:51:32,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:51:32,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:51:32,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:32" (1/1) ... [2022-07-19 10:51:32,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:32" (1/1) ... [2022-07-19 10:51:32,500 INFO L137 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-07-19 10:51:32,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:51:32,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:51:32,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:51:32,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:51:32,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:32" (1/1) ... [2022-07-19 10:51:32,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:32" (1/1) ... [2022-07-19 10:51:32,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:32" (1/1) ... [2022-07-19 10:51:32,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:32" (1/1) ... [2022-07-19 10:51:32,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:32" (1/1) ... [2022-07-19 10:51:32,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:32" (1/1) ... [2022-07-19 10:51:32,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:32" (1/1) ... [2022-07-19 10:51:32,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:51:32,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:51:32,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:51:32,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:51:32,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:32" (1/1) ... [2022-07-19 10:51:32,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:51:32,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:32,578 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 10:51:32,592 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 10:51:32,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:51:32,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:51:32,615 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-19 10:51:32,615 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-19 10:51:32,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:51:32,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:51:32,616 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-19 10:51:32,616 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-19 10:51:32,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 10:51:32,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 10:51:32,675 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:51:32,676 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:51:32,958 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:51:32,975 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:51:32,975 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 10:51:32,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:51:32 BoogieIcfgContainer [2022-07-19 10:51:32,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:51:32,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:51:32,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:51:32,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:51:32,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:51:32" (1/3) ... [2022-07-19 10:51:32,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f71b109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:51:32, skipping insertion in model container [2022-07-19 10:51:32,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:51:32" (2/3) ... [2022-07-19 10:51:32,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f71b109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:51:32, skipping insertion in model container [2022-07-19 10:51:32,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:51:32" (3/3) ... [2022-07-19 10:51:32,988 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2022-07-19 10:51:33,003 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:51:33,004 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:51:33,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:51:33,056 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@5439fdcd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@59aa6842 [2022-07-19 10:51:33,056 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:51:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 76 states have internal predecessors, (127), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-19 10:51:33,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 10:51:33,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:33,070 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 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 10:51:33,070 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:33,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:33,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1197400178, now seen corresponding path program 1 times [2022-07-19 10:51:33,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:33,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756731800] [2022-07-19 10:51:33,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:33,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:33,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:33,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:33,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:33,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:33,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756731800] [2022-07-19 10:51:33,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756731800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:33,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:33,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:51:33,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378898275] [2022-07-19 10:51:33,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:33,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:51:33,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:33,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:51:33,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:51:33,408 INFO L87 Difference]: Start difference. First operand has 88 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 76 states have internal predecessors, (127), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:33,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:33,501 INFO L93 Difference]: Finished difference Result 181 states and 304 transitions. [2022-07-19 10:51:33,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:51:33,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-07-19 10:51:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:33,512 INFO L225 Difference]: With dead ends: 181 [2022-07-19 10:51:33,513 INFO L226 Difference]: Without dead ends: 92 [2022-07-19 10:51:33,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 10:51:33,519 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 91 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:33,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 147 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:51:33,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-19 10:51:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2022-07-19 10:51:33,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 73 states have internal predecessors, (105), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-19 10:51:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2022-07-19 10:51:33,556 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 37 [2022-07-19 10:51:33,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:33,557 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2022-07-19 10:51:33,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2022-07-19 10:51:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:51:33,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:33,560 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:33,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:51:33,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:33,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:33,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1825768574, now seen corresponding path program 1 times [2022-07-19 10:51:33,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:33,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827154092] [2022-07-19 10:51:33,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:33,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:33,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:33,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:33,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:33,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:51:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:33,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 10:51:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:33,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:33,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827154092] [2022-07-19 10:51:33,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827154092] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:33,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115726756] [2022-07-19 10:51:33,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:33,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:33,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:33,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:34,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 10:51:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:34,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 10:51:34,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:51:34,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:34,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115726756] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:34,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:34,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 24 [2022-07-19 10:51:34,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435581706] [2022-07-19 10:51:34,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:34,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 10:51:34,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:34,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 10:51:34,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2022-07-19 10:51:34,555 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 24 states, 20 states have (on average 2.6) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-19 10:51:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:37,136 INFO L93 Difference]: Finished difference Result 419 states and 662 transitions. [2022-07-19 10:51:37,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-19 10:51:37,137 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.6) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 44 [2022-07-19 10:51:37,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:37,141 INFO L225 Difference]: With dead ends: 419 [2022-07-19 10:51:37,141 INFO L226 Difference]: Without dead ends: 338 [2022-07-19 10:51:37,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=244, Invalid=1562, Unknown=0, NotChecked=0, Total=1806 [2022-07-19 10:51:37,146 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 1123 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 3610 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 3745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 3610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:37,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 527 Invalid, 3745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 3610 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-19 10:51:37,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-19 10:51:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 116. [2022-07-19 10:51:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 99 states have internal predecessors, (133), 13 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (21), 12 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-19 10:51:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2022-07-19 10:51:37,187 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 44 [2022-07-19 10:51:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:37,187 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2022-07-19 10:51:37,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.6) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-19 10:51:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2022-07-19 10:51:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 10:51:37,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:37,190 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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 10:51:37,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 10:51:37,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:37,408 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:37,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:37,408 INFO L85 PathProgramCache]: Analyzing trace with hash 48277341, now seen corresponding path program 1 times [2022-07-19 10:51:37,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:37,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233396851] [2022-07-19 10:51:37,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:37,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:37,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:37,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:37,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:37,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:37,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233396851] [2022-07-19 10:51:37,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233396851] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:37,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:37,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:51:37,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356986006] [2022-07-19 10:51:37,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:37,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:51:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:51:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:37,472 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:37,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:37,570 INFO L93 Difference]: Finished difference Result 212 states and 304 transitions. [2022-07-19 10:51:37,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:51:37,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-19 10:51:37,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:37,572 INFO L225 Difference]: With dead ends: 212 [2022-07-19 10:51:37,572 INFO L226 Difference]: Without dead ends: 132 [2022-07-19 10:51:37,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 10:51:37,576 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 113 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:37,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 192 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:37,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-19 10:51:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 117. [2022-07-19 10:51:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 100 states have internal predecessors, (132), 13 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (21), 12 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-19 10:51:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2022-07-19 10:51:37,592 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 43 [2022-07-19 10:51:37,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:37,592 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2022-07-19 10:51:37,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2022-07-19 10:51:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:51:37,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:37,595 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:37,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:51:37,595 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:37,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:37,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1481319558, now seen corresponding path program 1 times [2022-07-19 10:51:37,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:37,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871503858] [2022-07-19 10:51:37,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:37,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:37,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:37,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:37,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:51:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:37,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 10:51:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:37,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:37,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871503858] [2022-07-19 10:51:37,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871503858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:37,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:37,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-19 10:51:37,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463213708] [2022-07-19 10:51:37,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:37,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:51:37,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:37,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:51:37,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:51:37,822 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-19 10:51:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:39,230 INFO L93 Difference]: Finished difference Result 250 states and 358 transitions. [2022-07-19 10:51:39,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 10:51:39,234 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2022-07-19 10:51:39,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:39,236 INFO L225 Difference]: With dead ends: 250 [2022-07-19 10:51:39,236 INFO L226 Difference]: Without dead ends: 242 [2022-07-19 10:51:39,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2022-07-19 10:51:39,237 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 309 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:39,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 416 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 10:51:39,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-19 10:51:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 122. [2022-07-19 10:51:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 103 states have internal predecessors, (136), 14 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (22), 14 states have call predecessors, (22), 13 states have call successors, (22) [2022-07-19 10:51:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2022-07-19 10:51:39,252 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 44 [2022-07-19 10:51:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:39,253 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2022-07-19 10:51:39,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-19 10:51:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2022-07-19 10:51:39,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 10:51:39,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:39,255 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:39,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 10:51:39,255 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:39,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:39,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2095142826, now seen corresponding path program 1 times [2022-07-19 10:51:39,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:39,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645110974] [2022-07-19 10:51:39,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:39,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:51:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 10:51:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 10:51:39,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:39,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645110974] [2022-07-19 10:51:39,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645110974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:39,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:39,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:51:39,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404305377] [2022-07-19 10:51:39,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:39,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:51:39,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:39,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:51:39,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:51:39,331 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 10:51:39,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:39,736 INFO L93 Difference]: Finished difference Result 179 states and 251 transitions. [2022-07-19 10:51:39,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:51:39,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-07-19 10:51:39,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:39,739 INFO L225 Difference]: With dead ends: 179 [2022-07-19 10:51:39,739 INFO L226 Difference]: Without dead ends: 168 [2022-07-19 10:51:39,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:51:39,740 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 218 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:39,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 225 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:51:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-19 10:51:39,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2022-07-19 10:51:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 98 states have (on average 1.346938775510204) internal successors, (132), 101 states have internal predecessors, (132), 14 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (21), 13 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-19 10:51:39,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2022-07-19 10:51:39,753 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 46 [2022-07-19 10:51:39,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:39,753 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2022-07-19 10:51:39,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 10:51:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2022-07-19 10:51:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 10:51:39,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:39,755 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:51:39,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 10:51:39,755 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:39,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:39,756 INFO L85 PathProgramCache]: Analyzing trace with hash -937140365, now seen corresponding path program 1 times [2022-07-19 10:51:39,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:39,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358540570] [2022-07-19 10:51:39,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:39,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:51:39,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:39,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358540570] [2022-07-19 10:51:39,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358540570] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:39,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:39,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 10:51:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771847615] [2022-07-19 10:51:39,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:39,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:51:39,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:39,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:51:39,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:51:39,856 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:40,236 INFO L93 Difference]: Finished difference Result 222 states and 310 transitions. [2022-07-19 10:51:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:51:40,236 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2022-07-19 10:51:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:40,238 INFO L225 Difference]: With dead ends: 222 [2022-07-19 10:51:40,238 INFO L226 Difference]: Without dead ends: 166 [2022-07-19 10:51:40,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:51:40,239 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 160 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:40,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 488 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:51:40,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-19 10:51:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 125. [2022-07-19 10:51:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 106 states have internal predecessors, (137), 14 states have call successors, (14), 5 states have call predecessors, (14), 7 states have return successors, (21), 13 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-19 10:51:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 172 transitions. [2022-07-19 10:51:40,252 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 172 transitions. Word has length 46 [2022-07-19 10:51:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:40,252 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 172 transitions. [2022-07-19 10:51:40,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 172 transitions. [2022-07-19 10:51:40,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:51:40,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:40,253 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:40,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:51:40,254 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:40,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:40,254 INFO L85 PathProgramCache]: Analyzing trace with hash -783122765, now seen corresponding path program 1 times [2022-07-19 10:51:40,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:40,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941926182] [2022-07-19 10:51:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:40,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:51:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:51:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:51:40,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:40,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941926182] [2022-07-19 10:51:40,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941926182] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:40,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156312957] [2022-07-19 10:51:40,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:40,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:40,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:40,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:40,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 10:51:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:40,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-19 10:51:40,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:40,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:51:41,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156312957] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:41,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:41,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13] total 34 [2022-07-19 10:51:41,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425908477] [2022-07-19 10:51:41,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:41,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 10:51:41,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:41,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 10:51:41,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2022-07-19 10:51:41,168 INFO L87 Difference]: Start difference. First operand 125 states and 172 transitions. Second operand has 34 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 25 states have internal predecessors, (53), 6 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 10:51:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:47,204 INFO L93 Difference]: Finished difference Result 483 states and 761 transitions. [2022-07-19 10:51:47,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-19 10:51:47,205 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 25 states have internal predecessors, (53), 6 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2022-07-19 10:51:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:47,208 INFO L225 Difference]: With dead ends: 483 [2022-07-19 10:51:47,208 INFO L226 Difference]: Without dead ends: 472 [2022-07-19 10:51:47,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=739, Invalid=6233, Unknown=0, NotChecked=0, Total=6972 [2022-07-19 10:51:47,212 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 874 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 9013 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 9206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 9013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:47,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 741 Invalid, 9206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 9013 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-19 10:51:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-07-19 10:51:47,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 164. [2022-07-19 10:51:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 131 states have (on average 1.282442748091603) internal successors, (168), 137 states have internal predecessors, (168), 21 states have call successors, (21), 5 states have call predecessors, (21), 11 states have return successors, (58), 21 states have call predecessors, (58), 19 states have call successors, (58) [2022-07-19 10:51:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 247 transitions. [2022-07-19 10:51:47,238 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 247 transitions. Word has length 48 [2022-07-19 10:51:47,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:47,239 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 247 transitions. [2022-07-19 10:51:47,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 25 states have internal predecessors, (53), 6 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 10:51:47,239 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 247 transitions. [2022-07-19 10:51:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:51:47,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:47,247 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:47,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:47,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-19 10:51:47,470 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:47,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1231057781, now seen corresponding path program 2 times [2022-07-19 10:51:47,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:47,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965040567] [2022-07-19 10:51:47,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:47,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:47,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:47,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:47,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:47,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:51:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:47,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:51:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:51:47,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:47,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965040567] [2022-07-19 10:51:47,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965040567] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:47,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659078268] [2022-07-19 10:51:47,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:51:47,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:47,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:47,687 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:47,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 10:51:47,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:51:47,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:51:47,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 10:51:47,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:47,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:48,175 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:48,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659078268] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:48,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:48,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2022-07-19 10:51:48,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023510204] [2022-07-19 10:51:48,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:48,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-19 10:51:48,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:48,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-19 10:51:48,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2022-07-19 10:51:48,176 INFO L87 Difference]: Start difference. First operand 164 states and 247 transitions. Second operand has 30 states, 29 states have (on average 2.0) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-19 10:51:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:51,222 INFO L93 Difference]: Finished difference Result 348 states and 666 transitions. [2022-07-19 10:51:51,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-19 10:51:51,222 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) Word has length 48 [2022-07-19 10:51:51,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:51,225 INFO L225 Difference]: With dead ends: 348 [2022-07-19 10:51:51,225 INFO L226 Difference]: Without dead ends: 341 [2022-07-19 10:51:51,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=378, Invalid=3282, Unknown=0, NotChecked=0, Total=3660 [2022-07-19 10:51:51,227 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 784 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 5160 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 5352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 5160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:51,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 466 Invalid, 5352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 5160 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 10:51:51,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-19 10:51:51,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 172. [2022-07-19 10:51:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.2740740740740741) internal successors, (172), 141 states have internal predecessors, (172), 25 states have call successors, (25), 5 states have call predecessors, (25), 11 states have return successors, (73), 25 states have call predecessors, (73), 23 states have call successors, (73) [2022-07-19 10:51:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 270 transitions. [2022-07-19 10:51:51,261 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 270 transitions. Word has length 48 [2022-07-19 10:51:51,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:51,262 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 270 transitions. [2022-07-19 10:51:51,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-19 10:51:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 270 transitions. [2022-07-19 10:51:51,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 10:51:51,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:51,264 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:51,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:51,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:51,479 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:51,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:51,480 INFO L85 PathProgramCache]: Analyzing trace with hash -415034277, now seen corresponding path program 1 times [2022-07-19 10:51:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:51,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369671880] [2022-07-19 10:51:51,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:51,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:51,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:51,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:51,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:51,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:51:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:51,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:51:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:51,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:51,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369671880] [2022-07-19 10:51:51,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369671880] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:51,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10549895] [2022-07-19 10:51:51,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:51,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:51,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:51,643 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:51,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 10:51:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:51,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-19 10:51:51,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 10:51:51,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:52,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10549895] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:52,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:52,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 24 [2022-07-19 10:51:52,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910766032] [2022-07-19 10:51:52,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:52,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 10:51:52,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:52,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 10:51:52,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-19 10:51:52,012 INFO L87 Difference]: Start difference. First operand 172 states and 270 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 18 states have internal predecessors, (56), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 10:51:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:53,854 INFO L93 Difference]: Finished difference Result 342 states and 587 transitions. [2022-07-19 10:51:53,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-19 10:51:53,854 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 18 states have internal predecessors, (56), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) Word has length 50 [2022-07-19 10:51:53,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:53,856 INFO L225 Difference]: With dead ends: 342 [2022-07-19 10:51:53,856 INFO L226 Difference]: Without dead ends: 331 [2022-07-19 10:51:53,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 101 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1648, Unknown=0, NotChecked=0, Total=1892 [2022-07-19 10:51:53,858 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 384 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 3821 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 3883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:53,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 536 Invalid, 3883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 3821 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 10:51:53,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-19 10:51:53,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 172. [2022-07-19 10:51:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.2740740740740741) internal successors, (172), 141 states have internal predecessors, (172), 25 states have call successors, (25), 5 states have call predecessors, (25), 11 states have return successors, (73), 25 states have call predecessors, (73), 23 states have call successors, (73) [2022-07-19 10:51:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 270 transitions. [2022-07-19 10:51:53,878 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 270 transitions. Word has length 50 [2022-07-19 10:51:53,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:53,878 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 270 transitions. [2022-07-19 10:51:53,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 18 states have internal predecessors, (56), 6 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (10), 9 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 10:51:53,879 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 270 transitions. [2022-07-19 10:51:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 10:51:53,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:53,880 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:53,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-19 10:51:54,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:54,095 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:54,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:54,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2054485403, now seen corresponding path program 1 times [2022-07-19 10:51:54,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:54,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774952826] [2022-07-19 10:51:54,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:54,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:54,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:54,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:54,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:51:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:54,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:51:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:54,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:51:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:51:54,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:54,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774952826] [2022-07-19 10:51:54,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774952826] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:54,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602703302] [2022-07-19 10:51:54,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:54,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:54,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:54,292 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:54,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 10:51:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:54,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 10:51:54,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:54,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:54,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602703302] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:54,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:54,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 31 [2022-07-19 10:51:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173276578] [2022-07-19 10:51:54,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:54,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-19 10:51:54,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:54,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-19 10:51:54,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=861, Unknown=0, NotChecked=0, Total=930 [2022-07-19 10:51:54,758 INFO L87 Difference]: Start difference. First operand 172 states and 270 transitions. Second operand has 31 states, 30 states have (on average 2.066666666666667) internal successors, (62), 23 states have internal predecessors, (62), 5 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 9 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-19 10:51:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:57,656 INFO L93 Difference]: Finished difference Result 343 states and 632 transitions. [2022-07-19 10:51:57,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-19 10:51:57,657 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.066666666666667) internal successors, (62), 23 states have internal predecessors, (62), 5 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 9 states have call predecessors, (13), 4 states have call successors, (13) Word has length 50 [2022-07-19 10:51:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:57,659 INFO L225 Difference]: With dead ends: 343 [2022-07-19 10:51:57,660 INFO L226 Difference]: Without dead ends: 320 [2022-07-19 10:51:57,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=449, Invalid=4107, Unknown=0, NotChecked=0, Total=4556 [2022-07-19 10:51:57,662 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 760 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 4450 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 4582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 4450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:57,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 457 Invalid, 4582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 4450 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-19 10:51:57,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-07-19 10:51:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 180. [2022-07-19 10:51:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 140 states have (on average 1.2642857142857142) internal successors, (177), 145 states have internal predecessors, (177), 28 states have call successors, (28), 5 states have call predecessors, (28), 11 states have return successors, (82), 29 states have call predecessors, (82), 26 states have call successors, (82) [2022-07-19 10:51:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 287 transitions. [2022-07-19 10:51:57,686 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 287 transitions. Word has length 50 [2022-07-19 10:51:57,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:57,687 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 287 transitions. [2022-07-19 10:51:57,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.066666666666667) internal successors, (62), 23 states have internal predecessors, (62), 5 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (13), 9 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-19 10:51:57,687 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 287 transitions. [2022-07-19 10:51:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 10:51:57,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:57,689 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:57,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 10:51:57,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-19 10:51:57,903 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash 904908130, now seen corresponding path program 1 times [2022-07-19 10:51:57,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:57,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134317539] [2022-07-19 10:51:57,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:57,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:57,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:57,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:57,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:57,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:57,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134317539] [2022-07-19 10:51:57,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134317539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:57,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:57,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:51:57,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502593426] [2022-07-19 10:51:57,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:57,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:51:57,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:57,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:51:57,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:51:57,957 INFO L87 Difference]: Start difference. First operand 180 states and 287 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:58,036 INFO L93 Difference]: Finished difference Result 304 states and 499 transitions. [2022-07-19 10:51:58,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:51:58,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-19 10:51:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:58,038 INFO L225 Difference]: With dead ends: 304 [2022-07-19 10:51:58,038 INFO L226 Difference]: Without dead ends: 188 [2022-07-19 10:51:58,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 10:51:58,040 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 94 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:58,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 191 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:51:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-19 10:51:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2022-07-19 10:51:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 140 states have (on average 1.2571428571428571) internal successors, (176), 145 states have internal predecessors, (176), 28 states have call successors, (28), 5 states have call predecessors, (28), 11 states have return successors, (82), 29 states have call predecessors, (82), 26 states have call successors, (82) [2022-07-19 10:51:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 286 transitions. [2022-07-19 10:51:58,056 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 286 transitions. Word has length 50 [2022-07-19 10:51:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:58,057 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 286 transitions. [2022-07-19 10:51:58,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:51:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 286 transitions. [2022-07-19 10:51:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 10:51:58,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:58,059 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:58,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 10:51:58,059 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:58,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:58,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1570607968, now seen corresponding path program 1 times [2022-07-19 10:51:58,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:58,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254222295] [2022-07-19 10:51:58,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:58,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:58,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:58,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:58,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 10:51:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:58,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 10:51:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:51:58,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:58,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254222295] [2022-07-19 10:51:58,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254222295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:51:58,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:51:58,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:51:58,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139056534] [2022-07-19 10:51:58,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:51:58,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:51:58,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:58,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:51:58,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:51:58,107 INFO L87 Difference]: Start difference. First operand 180 states and 286 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:51:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:51:58,328 INFO L93 Difference]: Finished difference Result 426 states and 699 transitions. [2022-07-19 10:51:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:51:58,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-07-19 10:51:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:51:58,330 INFO L225 Difference]: With dead ends: 426 [2022-07-19 10:51:58,330 INFO L226 Difference]: Without dead ends: 263 [2022-07-19 10:51:58,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:51:58,333 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 226 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:51:58,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 183 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:51:58,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-19 10:51:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 181. [2022-07-19 10:51:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 146 states have internal predecessors, (177), 28 states have call successors, (28), 5 states have call predecessors, (28), 11 states have return successors, (82), 29 states have call predecessors, (82), 26 states have call successors, (82) [2022-07-19 10:51:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 287 transitions. [2022-07-19 10:51:58,361 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 287 transitions. Word has length 52 [2022-07-19 10:51:58,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:51:58,361 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 287 transitions. [2022-07-19 10:51:58,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:51:58,361 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 287 transitions. [2022-07-19 10:51:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 10:51:58,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:51:58,363 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:51:58,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 10:51:58,364 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:51:58,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:51:58,364 INFO L85 PathProgramCache]: Analyzing trace with hash -258774659, now seen corresponding path program 1 times [2022-07-19 10:51:58,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:51:58,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860819403] [2022-07-19 10:51:58,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:58,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:51:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:58,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:51:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:58,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:51:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:58,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:51:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:58,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 10:51:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:58,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 10:51:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:51:58,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:51:58,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860819403] [2022-07-19 10:51:58,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860819403] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:51:58,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965266288] [2022-07-19 10:51:58,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:51:58,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:51:58,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:51:58,537 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:51:58,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 10:51:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:51:58,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-19 10:51:58,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:51:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:51:58,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:51:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:51:59,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965266288] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:51:59,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:51:59,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2022-07-19 10:51:59,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450294299] [2022-07-19 10:51:59,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:51:59,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-19 10:51:59,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:51:59,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-19 10:51:59,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2022-07-19 10:51:59,090 INFO L87 Difference]: Start difference. First operand 181 states and 287 transitions. Second operand has 36 states, 32 states have (on average 2.21875) internal successors, (71), 28 states have internal predecessors, (71), 6 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-07-19 10:52:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:05,393 INFO L93 Difference]: Finished difference Result 673 states and 1211 transitions. [2022-07-19 10:52:05,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-19 10:52:05,393 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 2.21875) internal successors, (71), 28 states have internal predecessors, (71), 6 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 53 [2022-07-19 10:52:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:05,397 INFO L225 Difference]: With dead ends: 673 [2022-07-19 10:52:05,397 INFO L226 Difference]: Without dead ends: 553 [2022-07-19 10:52:05,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=836, Invalid=8284, Unknown=0, NotChecked=0, Total=9120 [2022-07-19 10:52:05,402 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 1227 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 9109 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 9365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 9109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:05,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 833 Invalid, 9365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 9109 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-19 10:52:05,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-07-19 10:52:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 226. [2022-07-19 10:52:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 171 states have (on average 1.2514619883040936) internal successors, (214), 179 states have internal predecessors, (214), 40 states have call successors, (40), 5 states have call predecessors, (40), 14 states have return successors, (153), 41 states have call predecessors, (153), 38 states have call successors, (153) [2022-07-19 10:52:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 407 transitions. [2022-07-19 10:52:05,445 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 407 transitions. Word has length 53 [2022-07-19 10:52:05,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:05,445 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 407 transitions. [2022-07-19 10:52:05,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 2.21875) internal successors, (71), 28 states have internal predecessors, (71), 6 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-07-19 10:52:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 407 transitions. [2022-07-19 10:52:05,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 10:52:05,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:05,447 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:05,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:05,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:05,671 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:05,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:05,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1119045026, now seen corresponding path program 1 times [2022-07-19 10:52:05,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:05,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319234195] [2022-07-19 10:52:05,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:05,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:05,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:05,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:05,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:52:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:05,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 10:52:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:05,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 10:52:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:52:05,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:05,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319234195] [2022-07-19 10:52:05,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319234195] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:05,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947670804] [2022-07-19 10:52:05,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:05,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:05,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:05,744 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:05,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 10:52:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:05,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 10:52:05,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:52:05,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:52:06,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947670804] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:06,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:52:06,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 20 [2022-07-19 10:52:06,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009979761] [2022-07-19 10:52:06,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:06,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 10:52:06,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:06,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 10:52:06,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-07-19 10:52:06,055 INFO L87 Difference]: Start difference. First operand 226 states and 407 transitions. Second operand has 20 states, 20 states have (on average 3.35) internal successors, (67), 16 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-19 10:52:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:07,761 INFO L93 Difference]: Finished difference Result 607 states and 1262 transitions. [2022-07-19 10:52:07,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 10:52:07,762 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 16 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 53 [2022-07-19 10:52:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:07,765 INFO L225 Difference]: With dead ends: 607 [2022-07-19 10:52:07,765 INFO L226 Difference]: Without dead ends: 396 [2022-07-19 10:52:07,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2022-07-19 10:52:07,770 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 535 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 3169 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:07,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 529 Invalid, 3249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3169 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-19 10:52:07,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-19 10:52:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 257. [2022-07-19 10:52:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 192 states have (on average 1.2395833333333333) internal successors, (238), 201 states have internal predecessors, (238), 49 states have call successors, (49), 5 states have call predecessors, (49), 15 states have return successors, (206), 50 states have call predecessors, (206), 47 states have call successors, (206) [2022-07-19 10:52:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 493 transitions. [2022-07-19 10:52:07,804 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 493 transitions. Word has length 53 [2022-07-19 10:52:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:07,805 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 493 transitions. [2022-07-19 10:52:07,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 16 states have internal predecessors, (67), 4 states have call successors, (14), 4 states have call predecessors, (14), 5 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-19 10:52:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 493 transitions. [2022-07-19 10:52:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 10:52:07,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:07,807 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:07,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:08,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:08,024 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:08,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash 960202435, now seen corresponding path program 1 times [2022-07-19 10:52:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:08,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260843524] [2022-07-19 10:52:08,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:08,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:08,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:08,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:52:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:08,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:08,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260843524] [2022-07-19 10:52:08,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260843524] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:08,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273414849] [2022-07-19 10:52:08,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:08,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:08,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:08,096 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:08,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 10:52:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:08,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:52:08,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:08,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:08,329 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:08,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273414849] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:08,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:52:08,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2022-07-19 10:52:08,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193491585] [2022-07-19 10:52:08,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:08,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 10:52:08,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:08,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 10:52:08,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:52:08,332 INFO L87 Difference]: Start difference. First operand 257 states and 493 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:52:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:09,108 INFO L93 Difference]: Finished difference Result 612 states and 1340 transitions. [2022-07-19 10:52:09,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:52:09,108 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2022-07-19 10:52:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:09,113 INFO L225 Difference]: With dead ends: 612 [2022-07-19 10:52:09,113 INFO L226 Difference]: Without dead ends: 495 [2022-07-19 10:52:09,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2022-07-19 10:52:09,115 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 237 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:09,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 848 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 10:52:09,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-07-19 10:52:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 269. [2022-07-19 10:52:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 203 states have (on average 1.2315270935960592) internal successors, (250), 213 states have internal predecessors, (250), 47 states have call successors, (47), 7 states have call predecessors, (47), 18 states have return successors, (196), 48 states have call predecessors, (196), 45 states have call successors, (196) [2022-07-19 10:52:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 493 transitions. [2022-07-19 10:52:09,173 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 493 transitions. Word has length 53 [2022-07-19 10:52:09,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:09,174 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 493 transitions. [2022-07-19 10:52:09,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 13 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:52:09,174 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 493 transitions. [2022-07-19 10:52:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-19 10:52:09,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:09,182 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:09,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-19 10:52:09,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 10:52:09,395 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:09,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:09,396 INFO L85 PathProgramCache]: Analyzing trace with hash 896532657, now seen corresponding path program 1 times [2022-07-19 10:52:09,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:09,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386098952] [2022-07-19 10:52:09,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:09,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 10:52:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 10:52:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 10:52:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 10:52:09,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:09,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386098952] [2022-07-19 10:52:09,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386098952] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:09,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43577302] [2022-07-19 10:52:09,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:09,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:09,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:09,441 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:09,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 10:52:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 10:52:09,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 10:52:09,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:09,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43577302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:09,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:52:09,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-07-19 10:52:09,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767206566] [2022-07-19 10:52:09,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:09,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:52:09,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:09,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:52:09,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:52:09,513 INFO L87 Difference]: Start difference. First operand 269 states and 493 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:52:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:09,569 INFO L93 Difference]: Finished difference Result 496 states and 883 transitions. [2022-07-19 10:52:09,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:52:09,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-07-19 10:52:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:09,572 INFO L225 Difference]: With dead ends: 496 [2022-07-19 10:52:09,572 INFO L226 Difference]: Without dead ends: 276 [2022-07-19 10:52:09,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:52:09,575 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 14 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:09,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 334 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:52:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-19 10:52:09,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 270. [2022-07-19 10:52:09,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 204 states have (on average 1.2352941176470589) internal successors, (252), 214 states have internal predecessors, (252), 47 states have call successors, (47), 7 states have call predecessors, (47), 18 states have return successors, (196), 48 states have call predecessors, (196), 45 states have call successors, (196) [2022-07-19 10:52:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 495 transitions. [2022-07-19 10:52:09,606 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 495 transitions. Word has length 54 [2022-07-19 10:52:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:09,607 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 495 transitions. [2022-07-19 10:52:09,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:52:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 495 transitions. [2022-07-19 10:52:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-19 10:52:09,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:09,610 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:09,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:09,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-19 10:52:09,835 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1591568488, now seen corresponding path program 1 times [2022-07-19 10:52:09,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:09,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941576224] [2022-07-19 10:52:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:09,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:09,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 10:52:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:10,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 10:52:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:10,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 10:52:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:52:10,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:10,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941576224] [2022-07-19 10:52:10,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941576224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:10,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:10,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-19 10:52:10,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638728248] [2022-07-19 10:52:10,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:10,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 10:52:10,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:10,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 10:52:10,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:52:10,137 INFO L87 Difference]: Start difference. First operand 270 states and 495 transitions. Second operand has 18 states, 16 states have (on average 2.5) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:52:11,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:11,440 INFO L93 Difference]: Finished difference Result 399 states and 824 transitions. [2022-07-19 10:52:11,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 10:52:11,441 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.5) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2022-07-19 10:52:11,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:11,443 INFO L225 Difference]: With dead ends: 399 [2022-07-19 10:52:11,443 INFO L226 Difference]: Without dead ends: 388 [2022-07-19 10:52:11,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2022-07-19 10:52:11,444 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 328 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:11,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 297 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 10:52:11,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-07-19 10:52:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 268. [2022-07-19 10:52:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 203 states have (on average 1.2364532019704433) internal successors, (251), 213 states have internal predecessors, (251), 46 states have call successors, (46), 7 states have call predecessors, (46), 18 states have return successors, (195), 47 states have call predecessors, (195), 44 states have call successors, (195) [2022-07-19 10:52:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 492 transitions. [2022-07-19 10:52:11,483 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 492 transitions. Word has length 55 [2022-07-19 10:52:11,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:11,483 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 492 transitions. [2022-07-19 10:52:11,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.5) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:52:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 492 transitions. [2022-07-19 10:52:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:52:11,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:11,486 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:11,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 10:52:11,486 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:11,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1366808055, now seen corresponding path program 1 times [2022-07-19 10:52:11,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:11,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600689806] [2022-07-19 10:52:11,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:11,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:11,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:11,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:11,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:52:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:11,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:52:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:11,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:11,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600689806] [2022-07-19 10:52:11,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600689806] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:11,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148754653] [2022-07-19 10:52:11,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:11,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:11,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:11,573 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:11,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 10:52:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:11,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:52:11,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:11,747 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:11,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:11,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148754653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:11,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:52:11,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-07-19 10:52:11,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250736263] [2022-07-19 10:52:11,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:11,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:52:11,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:11,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:52:11,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:52:11,749 INFO L87 Difference]: Start difference. First operand 268 states and 492 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:11,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:11,962 INFO L93 Difference]: Finished difference Result 713 states and 1456 transitions. [2022-07-19 10:52:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 10:52:11,962 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-19 10:52:11,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:11,967 INFO L225 Difference]: With dead ends: 713 [2022-07-19 10:52:11,967 INFO L226 Difference]: Without dead ends: 656 [2022-07-19 10:52:11,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-07-19 10:52:11,969 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 447 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:11,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1209 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:52:11,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-07-19 10:52:12,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 367. [2022-07-19 10:52:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 289 states have (on average 1.245674740484429) internal successors, (360), 303 states have internal predecessors, (360), 54 states have call successors, (54), 8 states have call predecessors, (54), 23 states have return successors, (208), 55 states have call predecessors, (208), 51 states have call successors, (208) [2022-07-19 10:52:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 622 transitions. [2022-07-19 10:52:12,033 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 622 transitions. Word has length 57 [2022-07-19 10:52:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:12,033 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 622 transitions. [2022-07-19 10:52:12,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 622 transitions. [2022-07-19 10:52:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:52:12,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:12,036 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:12,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:12,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 10:52:12,251 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:12,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:12,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1759835065, now seen corresponding path program 1 times [2022-07-19 10:52:12,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:12,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498606280] [2022-07-19 10:52:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:12,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:12,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:12,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:12,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:52:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:12,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:52:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:12,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:12,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498606280] [2022-07-19 10:52:12,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498606280] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:12,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117843529] [2022-07-19 10:52:12,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:12,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:12,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:12,336 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:12,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 10:52:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:12,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:52:12,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:12,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:12,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117843529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:12,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:52:12,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-07-19 10:52:12,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756760543] [2022-07-19 10:52:12,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:12,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:52:12,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:12,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:52:12,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:52:12,478 INFO L87 Difference]: Start difference. First operand 367 states and 622 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:12,706 INFO L93 Difference]: Finished difference Result 940 states and 1800 transitions. [2022-07-19 10:52:12,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:52:12,706 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-19 10:52:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:12,711 INFO L225 Difference]: With dead ends: 940 [2022-07-19 10:52:12,711 INFO L226 Difference]: Without dead ends: 759 [2022-07-19 10:52:12,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:52:12,714 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 376 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:12,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1123 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:52:12,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2022-07-19 10:52:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 429. [2022-07-19 10:52:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 339 states have (on average 1.247787610619469) internal successors, (423), 355 states have internal predecessors, (423), 63 states have call successors, (63), 9 states have call predecessors, (63), 26 states have return successors, (223), 64 states have call predecessors, (223), 59 states have call successors, (223) [2022-07-19 10:52:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 709 transitions. [2022-07-19 10:52:12,779 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 709 transitions. Word has length 57 [2022-07-19 10:52:12,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:12,779 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 709 transitions. [2022-07-19 10:52:12,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:12,779 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 709 transitions. [2022-07-19 10:52:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:52:12,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:12,782 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:12,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:13,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:13,004 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:13,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:13,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1500821561, now seen corresponding path program 1 times [2022-07-19 10:52:13,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:13,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649784979] [2022-07-19 10:52:13,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:13,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:13,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:13,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:13,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:52:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:13,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:52:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:13,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:13,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:13,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649784979] [2022-07-19 10:52:13,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649784979] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:13,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871011695] [2022-07-19 10:52:13,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:13,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:13,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:13,087 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:13,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 10:52:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:13,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:52:13,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:13,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:13,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871011695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:13,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:52:13,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2022-07-19 10:52:13,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267989084] [2022-07-19 10:52:13,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:13,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:52:13,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:13,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:52:13,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:52:13,234 INFO L87 Difference]: Start difference. First operand 429 states and 709 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:13,328 INFO L93 Difference]: Finished difference Result 567 states and 1011 transitions. [2022-07-19 10:52:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:52:13,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-19 10:52:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:13,332 INFO L225 Difference]: With dead ends: 567 [2022-07-19 10:52:13,332 INFO L226 Difference]: Without dead ends: 476 [2022-07-19 10:52:13,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-07-19 10:52:13,333 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 53 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:13,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1163 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:52:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-07-19 10:52:13,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 353. [2022-07-19 10:52:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 278 states have (on average 1.2625899280575539) internal successors, (351), 292 states have internal predecessors, (351), 53 states have call successors, (53), 6 states have call predecessors, (53), 21 states have return successors, (201), 54 states have call predecessors, (201), 50 states have call successors, (201) [2022-07-19 10:52:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 605 transitions. [2022-07-19 10:52:13,379 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 605 transitions. Word has length 57 [2022-07-19 10:52:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:13,379 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 605 transitions. [2022-07-19 10:52:13,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 605 transitions. [2022-07-19 10:52:13,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:52:13,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:13,381 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:13,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:13,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:13,595 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:13,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:13,596 INFO L85 PathProgramCache]: Analyzing trace with hash -267239054, now seen corresponding path program 2 times [2022-07-19 10:52:13,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:13,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832274129] [2022-07-19 10:52:13,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:13,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:13,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:13,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:13,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:52:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:52:13,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:13,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832274129] [2022-07-19 10:52:13,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832274129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:13,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:13,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:52:13,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668780342] [2022-07-19 10:52:13,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:13,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:52:13,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:13,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:52:13,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:52:13,686 INFO L87 Difference]: Start difference. First operand 353 states and 605 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:14,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:14,226 INFO L93 Difference]: Finished difference Result 797 states and 1460 transitions. [2022-07-19 10:52:14,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:52:14,227 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2022-07-19 10:52:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:14,229 INFO L225 Difference]: With dead ends: 797 [2022-07-19 10:52:14,229 INFO L226 Difference]: Without dead ends: 548 [2022-07-19 10:52:14,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:52:14,232 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 432 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:14,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 593 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:52:14,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-19 10:52:14,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 454. [2022-07-19 10:52:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 371 states have (on average 1.2425876010781671) internal successors, (461), 388 states have internal predecessors, (461), 56 states have call successors, (56), 8 states have call predecessors, (56), 26 states have return successors, (191), 57 states have call predecessors, (191), 53 states have call successors, (191) [2022-07-19 10:52:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 708 transitions. [2022-07-19 10:52:14,289 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 708 transitions. Word has length 57 [2022-07-19 10:52:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:14,289 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 708 transitions. [2022-07-19 10:52:14,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 708 transitions. [2022-07-19 10:52:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:52:14,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:14,292 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:14,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 10:52:14,292 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:14,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:14,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1278356304, now seen corresponding path program 1 times [2022-07-19 10:52:14,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:14,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000993880] [2022-07-19 10:52:14,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:14,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:14,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:14,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:14,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:52:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:52:14,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:14,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000993880] [2022-07-19 10:52:14,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000993880] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:14,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620900031] [2022-07-19 10:52:14,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:14,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:14,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:14,372 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:14,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 10:52:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:14,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 10:52:14,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:52:14,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:52:14,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620900031] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:14,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:52:14,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11, 10] total 12 [2022-07-19 10:52:14,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464737486] [2022-07-19 10:52:14,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:14,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:52:14,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:14,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:52:14,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:52:14,530 INFO L87 Difference]: Start difference. First operand 454 states and 708 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:14,588 INFO L93 Difference]: Finished difference Result 773 states and 1323 transitions. [2022-07-19 10:52:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:52:14,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2022-07-19 10:52:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:14,591 INFO L225 Difference]: With dead ends: 773 [2022-07-19 10:52:14,591 INFO L226 Difference]: Without dead ends: 474 [2022-07-19 10:52:14,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:52:14,595 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:14,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:52:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-19 10:52:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-07-19 10:52:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 391 states have (on average 1.225063938618926) internal successors, (479), 408 states have internal predecessors, (479), 56 states have call successors, (56), 8 states have call predecessors, (56), 26 states have return successors, (191), 57 states have call predecessors, (191), 53 states have call successors, (191) [2022-07-19 10:52:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 726 transitions. [2022-07-19 10:52:14,645 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 726 transitions. Word has length 57 [2022-07-19 10:52:14,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:14,645 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 726 transitions. [2022-07-19 10:52:14,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:14,646 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 726 transitions. [2022-07-19 10:52:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:52:14,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:14,648 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:14,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:14,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-19 10:52:14,867 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:14,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:14,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1276509262, now seen corresponding path program 1 times [2022-07-19 10:52:14,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:14,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812584529] [2022-07-19 10:52:14,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:14,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:14,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:15,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:52:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:52:15,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:15,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812584529] [2022-07-19 10:52:15,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812584529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:15,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:15,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:52:15,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509174335] [2022-07-19 10:52:15,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:15,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:52:15,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:15,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:52:15,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:52:15,018 INFO L87 Difference]: Start difference. First operand 474 states and 726 transitions. Second operand has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:52:15,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:15,630 INFO L93 Difference]: Finished difference Result 788 states and 1126 transitions. [2022-07-19 10:52:15,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:52:15,630 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2022-07-19 10:52:15,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:15,633 INFO L225 Difference]: With dead ends: 788 [2022-07-19 10:52:15,633 INFO L226 Difference]: Without dead ends: 614 [2022-07-19 10:52:15,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:52:15,634 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 210 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:15,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 684 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:52:15,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-07-19 10:52:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 576. [2022-07-19 10:52:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 484 states have (on average 1.225206611570248) internal successors, (593), 503 states have internal predecessors, (593), 61 states have call successors, (61), 10 states have call predecessors, (61), 30 states have return successors, (192), 62 states have call predecessors, (192), 58 states have call successors, (192) [2022-07-19 10:52:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 846 transitions. [2022-07-19 10:52:15,699 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 846 transitions. Word has length 57 [2022-07-19 10:52:15,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:15,699 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 846 transitions. [2022-07-19 10:52:15,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:52:15,699 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 846 transitions. [2022-07-19 10:52:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:52:15,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:15,702 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:15,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 10:52:15,702 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:15,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:15,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1410522768, now seen corresponding path program 1 times [2022-07-19 10:52:15,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:15,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392141719] [2022-07-19 10:52:15,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:15,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:15,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:15,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:15,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:52:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:15,905 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:52:15,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:15,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392141719] [2022-07-19 10:52:15,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392141719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:15,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:15,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-19 10:52:15,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919480550] [2022-07-19 10:52:15,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:15,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 10:52:15,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:15,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 10:52:15,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:52:15,907 INFO L87 Difference]: Start difference. First operand 576 states and 846 transitions. Second operand has 15 states, 13 states have (on average 3.076923076923077) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:52:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:16,634 INFO L93 Difference]: Finished difference Result 715 states and 1031 transitions. [2022-07-19 10:52:16,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:52:16,634 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.076923076923077) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2022-07-19 10:52:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:16,636 INFO L225 Difference]: With dead ends: 715 [2022-07-19 10:52:16,636 INFO L226 Difference]: Without dead ends: 608 [2022-07-19 10:52:16,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2022-07-19 10:52:16,637 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 268 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:16,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 860 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:52:16,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-19 10:52:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 570. [2022-07-19 10:52:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 477 states have (on average 1.220125786163522) internal successors, (582), 496 states have internal predecessors, (582), 61 states have call successors, (61), 11 states have call predecessors, (61), 31 states have return successors, (192), 62 states have call predecessors, (192), 58 states have call successors, (192) [2022-07-19 10:52:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 835 transitions. [2022-07-19 10:52:16,706 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 835 transitions. Word has length 57 [2022-07-19 10:52:16,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:16,706 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 835 transitions. [2022-07-19 10:52:16,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.076923076923077) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:52:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 835 transitions. [2022-07-19 10:52:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 10:52:16,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:16,709 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:16,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 10:52:16,710 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:16,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:16,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1069512791, now seen corresponding path program 1 times [2022-07-19 10:52:16,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:16,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603997971] [2022-07-19 10:52:16,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:16,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:16,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:16,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 10:52:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:16,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 10:52:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:16,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 10:52:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:52:16,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:16,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603997971] [2022-07-19 10:52:16,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603997971] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:16,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716700831] [2022-07-19 10:52:16,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:16,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:16,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:16,805 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:16,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-19 10:52:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:16,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-19 10:52:16,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:52:16,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:52:17,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716700831] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:17,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:52:17,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-07-19 10:52:17,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986430590] [2022-07-19 10:52:17,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:17,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-19 10:52:17,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:17,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-19 10:52:17,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:52:17,208 INFO L87 Difference]: Start difference. First operand 570 states and 835 transitions. Second operand has 23 states, 20 states have (on average 3.3) internal successors, (66), 18 states have internal predecessors, (66), 5 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 10:52:20,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:20,019 INFO L93 Difference]: Finished difference Result 980 states and 1544 transitions. [2022-07-19 10:52:20,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-19 10:52:20,023 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 3.3) internal successors, (66), 18 states have internal predecessors, (66), 5 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 59 [2022-07-19 10:52:20,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:20,028 INFO L225 Difference]: With dead ends: 980 [2022-07-19 10:52:20,028 INFO L226 Difference]: Without dead ends: 793 [2022-07-19 10:52:20,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=484, Invalid=2596, Unknown=0, NotChecked=0, Total=3080 [2022-07-19 10:52:20,030 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 616 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 4643 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 4752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 4643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:20,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 530 Invalid, 4752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 4643 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-19 10:52:20,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2022-07-19 10:52:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 566. [2022-07-19 10:52:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 475 states have (on average 1.2147368421052631) internal successors, (577), 494 states have internal predecessors, (577), 59 states have call successors, (59), 11 states have call predecessors, (59), 31 states have return successors, (182), 60 states have call predecessors, (182), 56 states have call successors, (182) [2022-07-19 10:52:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 818 transitions. [2022-07-19 10:52:20,103 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 818 transitions. Word has length 59 [2022-07-19 10:52:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:20,103 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 818 transitions. [2022-07-19 10:52:20,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 3.3) internal successors, (66), 18 states have internal predecessors, (66), 5 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 10:52:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 818 transitions. [2022-07-19 10:52:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:52:20,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:20,106 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:20,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:20,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:20,323 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:20,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2004112473, now seen corresponding path program 1 times [2022-07-19 10:52:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:20,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342073657] [2022-07-19 10:52:20,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:20,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:20,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:20,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:20,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:52:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:20,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 10:52:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:20,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 10:52:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:20,454 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:52:20,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:20,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342073657] [2022-07-19 10:52:20,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342073657] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:20,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429617804] [2022-07-19 10:52:20,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:20,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:20,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:20,456 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:20,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-19 10:52:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:20,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 10:52:20,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-19 10:52:20,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-19 10:52:20,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429617804] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:20,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:52:20,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2022-07-19 10:52:20,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491422041] [2022-07-19 10:52:20,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:20,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 10:52:20,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:20,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 10:52:20,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:52:20,728 INFO L87 Difference]: Start difference. First operand 566 states and 818 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 10:52:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:22,479 INFO L93 Difference]: Finished difference Result 1166 states and 1747 transitions. [2022-07-19 10:52:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 10:52:22,480 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 60 [2022-07-19 10:52:22,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:22,483 INFO L225 Difference]: With dead ends: 1166 [2022-07-19 10:52:22,484 INFO L226 Difference]: Without dead ends: 871 [2022-07-19 10:52:22,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=1173, Unknown=0, NotChecked=0, Total=1406 [2022-07-19 10:52:22,486 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 913 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 3191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:22,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 539 Invalid, 3191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-19 10:52:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-07-19 10:52:22,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 646. [2022-07-19 10:52:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 550 states have (on average 1.2054545454545456) internal successors, (663), 572 states have internal predecessors, (663), 59 states have call successors, (59), 13 states have call predecessors, (59), 36 states have return successors, (148), 60 states have call predecessors, (148), 56 states have call successors, (148) [2022-07-19 10:52:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 870 transitions. [2022-07-19 10:52:22,567 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 870 transitions. Word has length 60 [2022-07-19 10:52:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:22,567 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 870 transitions. [2022-07-19 10:52:22,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 10:52:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 870 transitions. [2022-07-19 10:52:22,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-19 10:52:22,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:22,570 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:22,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:22,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-19 10:52:22,786 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:22,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:22,786 INFO L85 PathProgramCache]: Analyzing trace with hash -912833732, now seen corresponding path program 1 times [2022-07-19 10:52:22,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:22,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783091401] [2022-07-19 10:52:22,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:22,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:22,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:22,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:22,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:52:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:22,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:52:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:22,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:22,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783091401] [2022-07-19 10:52:22,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783091401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:22,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220709549] [2022-07-19 10:52:22,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:22,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:22,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:22,868 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:22,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-19 10:52:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:22,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:52:22,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:23,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:23,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220709549] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:23,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:52:23,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-07-19 10:52:23,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387912453] [2022-07-19 10:52:23,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:23,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 10:52:23,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:23,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 10:52:23,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:52:23,114 INFO L87 Difference]: Start difference. First operand 646 states and 870 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 10:52:24,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:24,359 INFO L93 Difference]: Finished difference Result 1353 states and 1960 transitions. [2022-07-19 10:52:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:52:24,359 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2022-07-19 10:52:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:24,363 INFO L225 Difference]: With dead ends: 1353 [2022-07-19 10:52:24,363 INFO L226 Difference]: Without dead ends: 1130 [2022-07-19 10:52:24,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2022-07-19 10:52:24,364 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 358 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 2863 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:24,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 408 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2863 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-19 10:52:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2022-07-19 10:52:24,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 619. [2022-07-19 10:52:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 531 states have (on average 1.2090395480225988) internal successors, (642), 551 states have internal predecessors, (642), 55 states have call successors, (55), 11 states have call predecessors, (55), 32 states have return successors, (138), 56 states have call predecessors, (138), 52 states have call successors, (138) [2022-07-19 10:52:24,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 835 transitions. [2022-07-19 10:52:24,454 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 835 transitions. Word has length 61 [2022-07-19 10:52:24,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:24,454 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 835 transitions. [2022-07-19 10:52:24,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 13 states have internal predecessors, (62), 4 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 10:52:24,455 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 835 transitions. [2022-07-19 10:52:24,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:52:24,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:24,456 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:24,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:24,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-19 10:52:24,663 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:24,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:24,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1971885056, now seen corresponding path program 1 times [2022-07-19 10:52:24,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:24,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042586957] [2022-07-19 10:52:24,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:24,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:24,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:24,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:24,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:52:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:52:24,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:24,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042586957] [2022-07-19 10:52:24,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042586957] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:24,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970467475] [2022-07-19 10:52:24,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:24,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:24,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:24,732 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:24,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-19 10:52:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:24,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:52:24,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:52:24,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:24,889 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:52:24,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970467475] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:24,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:52:24,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-07-19 10:52:24,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441670739] [2022-07-19 10:52:24,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:24,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:52:24,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:24,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:52:24,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:52:24,892 INFO L87 Difference]: Start difference. First operand 619 states and 835 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:52:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:25,443 INFO L93 Difference]: Finished difference Result 1079 states and 1458 transitions. [2022-07-19 10:52:25,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 10:52:25,443 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2022-07-19 10:52:25,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:25,446 INFO L225 Difference]: With dead ends: 1079 [2022-07-19 10:52:25,446 INFO L226 Difference]: Without dead ends: 781 [2022-07-19 10:52:25,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:52:25,448 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 271 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:25,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 636 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:52:25,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-07-19 10:52:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 612. [2022-07-19 10:52:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 523 states have (on average 1.2084130019120458) internal successors, (632), 544 states have internal predecessors, (632), 55 states have call successors, (55), 11 states have call predecessors, (55), 33 states have return successors, (137), 56 states have call predecessors, (137), 52 states have call successors, (137) [2022-07-19 10:52:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 824 transitions. [2022-07-19 10:52:25,538 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 824 transitions. Word has length 60 [2022-07-19 10:52:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:25,538 INFO L495 AbstractCegarLoop]: Abstraction has 612 states and 824 transitions. [2022-07-19 10:52:25,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:52:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 824 transitions. [2022-07-19 10:52:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:52:25,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:25,540 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:25,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:25,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-19 10:52:25,762 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:25,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:25,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1645255748, now seen corresponding path program 1 times [2022-07-19 10:52:25,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:25,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429614900] [2022-07-19 10:52:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:25,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:25,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:25,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:25,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:52:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:52:25,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:25,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429614900] [2022-07-19 10:52:25,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429614900] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:52:25,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274101992] [2022-07-19 10:52:25,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:25,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:52:25,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:25,828 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:52:25,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-19 10:52:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:25,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 10:52:25,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 10:52:25,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 10:52:26,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274101992] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:26,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:52:26,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-07-19 10:52:26,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465137109] [2022-07-19 10:52:26,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:26,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 10:52:26,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:26,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 10:52:26,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:52:26,114 INFO L87 Difference]: Start difference. First operand 612 states and 824 transitions. Second operand has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:52:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:26,954 INFO L93 Difference]: Finished difference Result 1344 states and 1916 transitions. [2022-07-19 10:52:26,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-19 10:52:26,954 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 60 [2022-07-19 10:52:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:26,957 INFO L225 Difference]: With dead ends: 1344 [2022-07-19 10:52:26,957 INFO L226 Difference]: Without dead ends: 970 [2022-07-19 10:52:26,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1302, Unknown=0, NotChecked=0, Total=1560 [2022-07-19 10:52:26,960 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 542 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:26,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 423 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:52:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-07-19 10:52:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 700. [2022-07-19 10:52:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 603 states have (on average 1.1956882255389718) internal successors, (721), 629 states have internal predecessors, (721), 56 states have call successors, (56), 13 states have call predecessors, (56), 40 states have return successors, (147), 57 states have call predecessors, (147), 53 states have call successors, (147) [2022-07-19 10:52:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 924 transitions. [2022-07-19 10:52:27,058 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 924 transitions. Word has length 60 [2022-07-19 10:52:27,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:27,059 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 924 transitions. [2022-07-19 10:52:27,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:52:27,059 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 924 transitions. [2022-07-19 10:52:27,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:52:27,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:27,061 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:27,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:27,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-19 10:52:27,283 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:27,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:27,284 INFO L85 PathProgramCache]: Analyzing trace with hash -155190960, now seen corresponding path program 1 times [2022-07-19 10:52:27,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:27,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043044457] [2022-07-19 10:52:27,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:27,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:27,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:27,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:52:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:52:27,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:27,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043044457] [2022-07-19 10:52:27,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043044457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:27,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:27,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 10:52:27,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019023318] [2022-07-19 10:52:27,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:27,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 10:52:27,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:27,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 10:52:27,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:52:27,356 INFO L87 Difference]: Start difference. First operand 700 states and 924 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:28,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:28,380 INFO L93 Difference]: Finished difference Result 1626 states and 2413 transitions. [2022-07-19 10:52:28,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 10:52:28,381 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2022-07-19 10:52:28,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:28,385 INFO L225 Difference]: With dead ends: 1626 [2022-07-19 10:52:28,385 INFO L226 Difference]: Without dead ends: 1446 [2022-07-19 10:52:28,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2022-07-19 10:52:28,387 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 340 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:28,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 799 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 10:52:28,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2022-07-19 10:52:28,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 891. [2022-07-19 10:52:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 774 states have (on average 1.198966408268734) internal successors, (928), 807 states have internal predecessors, (928), 66 states have call successors, (66), 16 states have call predecessors, (66), 50 states have return successors, (172), 67 states have call predecessors, (172), 63 states have call successors, (172) [2022-07-19 10:52:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1166 transitions. [2022-07-19 10:52:28,507 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1166 transitions. Word has length 60 [2022-07-19 10:52:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:28,507 INFO L495 AbstractCegarLoop]: Abstraction has 891 states and 1166 transitions. [2022-07-19 10:52:28,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 9 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1166 transitions. [2022-07-19 10:52:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:52:28,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:28,509 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:28,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-19 10:52:28,510 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:28,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:28,510 INFO L85 PathProgramCache]: Analyzing trace with hash -833017452, now seen corresponding path program 1 times [2022-07-19 10:52:28,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:28,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104551695] [2022-07-19 10:52:28,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:28,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:28,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:28,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:28,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:52:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:52:28,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:28,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104551695] [2022-07-19 10:52:28,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104551695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:28,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:28,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:52:28,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496110122] [2022-07-19 10:52:28,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:28,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:52:28,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:28,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:52:28,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:52:28,581 INFO L87 Difference]: Start difference. First operand 891 states and 1166 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:29,256 INFO L93 Difference]: Finished difference Result 1902 states and 2781 transitions. [2022-07-19 10:52:29,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 10:52:29,256 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2022-07-19 10:52:29,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:29,262 INFO L225 Difference]: With dead ends: 1902 [2022-07-19 10:52:29,262 INFO L226 Difference]: Without dead ends: 1585 [2022-07-19 10:52:29,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-07-19 10:52:29,265 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 735 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:29,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 519 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:52:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2022-07-19 10:52:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 998. [2022-07-19 10:52:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 865 states have (on average 1.1965317919075145) internal successors, (1035), 904 states have internal predecessors, (1035), 74 states have call successors, (74), 18 states have call predecessors, (74), 58 states have return successors, (192), 75 states have call predecessors, (192), 71 states have call successors, (192) [2022-07-19 10:52:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1301 transitions. [2022-07-19 10:52:29,407 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1301 transitions. Word has length 60 [2022-07-19 10:52:29,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:29,407 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 1301 transitions. [2022-07-19 10:52:29,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:29,408 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1301 transitions. [2022-07-19 10:52:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:52:29,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:29,410 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:29,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-19 10:52:29,410 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:29,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:29,410 INFO L85 PathProgramCache]: Analyzing trace with hash -289204466, now seen corresponding path program 2 times [2022-07-19 10:52:29,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:29,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42860511] [2022-07-19 10:52:29,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:29,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:29,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:52:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:29,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:52:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:29,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:52:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:52:29,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:52:29,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42860511] [2022-07-19 10:52:29,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42860511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:29,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:29,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:52:29,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976175051] [2022-07-19 10:52:29,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:29,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:52:29,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:52:29,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:52:29,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:52:29,476 INFO L87 Difference]: Start difference. First operand 998 states and 1301 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:30,013 INFO L93 Difference]: Finished difference Result 1370 states and 1883 transitions. [2022-07-19 10:52:30,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 10:52:30,014 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2022-07-19 10:52:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:30,017 INFO L225 Difference]: With dead ends: 1370 [2022-07-19 10:52:30,017 INFO L226 Difference]: Without dead ends: 1145 [2022-07-19 10:52:30,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:52:30,018 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 208 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:30,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 594 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:52:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2022-07-19 10:52:30,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 907. [2022-07-19 10:52:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 783 states have (on average 1.1915708812260537) internal successors, (933), 818 states have internal predecessors, (933), 69 states have call successors, (69), 18 states have call predecessors, (69), 54 states have return successors, (178), 70 states have call predecessors, (178), 66 states have call successors, (178) [2022-07-19 10:52:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1180 transitions. [2022-07-19 10:52:30,120 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1180 transitions. Word has length 60 [2022-07-19 10:52:30,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:30,121 INFO L495 AbstractCegarLoop]: Abstraction has 907 states and 1180 transitions. [2022-07-19 10:52:30,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1180 transitions. [2022-07-19 10:52:30,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 10:52:30,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:30,123 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:30,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-19 10:52:30,123 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:30,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:30,124 INFO L85 PathProgramCache]: Analyzing trace with hash 814388103, now seen corresponding path program 1 times [2022-07-19 10:52:30,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:52:30,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767928823] [2022-07-19 10:52:30,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:30,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:52:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:52:30,143 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 10:52:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:52:30,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 10:52:30,180 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 10:52:30,180 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:52:30,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-19 10:52:30,184 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:30,187 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:52:30,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:52:30 BoogieIcfgContainer [2022-07-19 10:52:30,255 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:52:30,256 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:52:30,256 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:52:30,256 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:52:30,257 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:51:32" (3/4) ... [2022-07-19 10:52:30,259 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 10:52:30,260 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:52:30,261 INFO L158 Benchmark]: Toolchain (without parser) took 58073.57ms. Allocated memory was 90.2MB in the beginning and 232.8MB in the end (delta: 142.6MB). Free memory was 59.1MB in the beginning and 162.0MB in the end (delta: -102.9MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2022-07-19 10:52:30,261 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 90.2MB. Free memory was 47.7MB in the beginning and 47.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:52:30,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.95ms. Allocated memory is still 90.2MB. Free memory was 58.9MB in the beginning and 62.4MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 10:52:30,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.63ms. Allocated memory is still 90.2MB. Free memory was 62.4MB in the beginning and 60.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:52:30,263 INFO L158 Benchmark]: Boogie Preprocessor took 34.99ms. Allocated memory is still 90.2MB. Free memory was 60.8MB in the beginning and 59.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:52:30,263 INFO L158 Benchmark]: RCFGBuilder took 441.07ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 59.1MB in the beginning and 85.6MB in the end (delta: -26.5MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2022-07-19 10:52:30,264 INFO L158 Benchmark]: TraceAbstraction took 57276.66ms. Allocated memory was 109.1MB in the beginning and 232.8MB in the end (delta: 123.7MB). Free memory was 85.1MB in the beginning and 163.1MB in the end (delta: -78.0MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2022-07-19 10:52:30,265 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 232.8MB. Free memory was 163.1MB in the beginning and 162.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:52:30,267 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 90.2MB. Free memory was 47.7MB in the beginning and 47.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.95ms. Allocated memory is still 90.2MB. Free memory was 58.9MB in the beginning and 62.4MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.63ms. Allocated memory is still 90.2MB. Free memory was 62.4MB in the beginning and 60.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.99ms. Allocated memory is still 90.2MB. Free memory was 60.8MB in the beginning and 59.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 441.07ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 59.1MB in the beginning and 85.6MB in the end (delta: -26.5MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 57276.66ms. Allocated memory was 109.1MB in the beginning and 232.8MB in the end (delta: 123.7MB). Free memory was 85.1MB in the beginning and 163.1MB in the end (delta: -78.0MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 232.8MB. Free memory was 163.1MB in the beginning and 162.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseComplement at line 77. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add1 ; [L234] unsigned int r_add2 ; [L235] unsigned int zero ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int __retres14 ; VAL [ea=127, eb=127] [L242] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157382, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=8573157382] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157382, e=0, m=0, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=8573157382] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157382, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=8573157382] [L81] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157382, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=8573157382] [L242] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=127, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=8573157382] [L242] zero = base2flt(0, 0) [L243] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157382, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=8573157382] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157382, e=127, m=16777216, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=8573157382] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157382, e=127, m=16777216, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=8573157382] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157382, e=127, m=16777216, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=8573157382] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157382, e=127, m=16777216, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=8573157382] [L60] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157382, e=127, m=16777216, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=8573157382] [L77] m = m & ~ (1U << 24U) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157382, e=127, m=0, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=8573157382] [L78] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157382, e=127, m=0, m = m & ~ (1U << 24U)=8573157380, res=4278190080, res = m | ((unsigned int )(e + 128) << 24U)=4278190080] [L79] __retres4 = res VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157382, __retres4=4278190080, e=127, m=0, m = m & ~ (1U << 24U)=8573157380, res=4278190080, res = m | ((unsigned int )(e + 128) << 24U)=4278190080] [L81] return (__retres4); VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=8573157382, \result=8573157376, __retres4=4278190080, e=127, m=0, m = m & ~ (1U << 24U)=8573157380, res=4278190080, res = m | ((unsigned int )(e + 128) << 24U)=4278190080] [L243] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=8573157376, ea=127, eb=127, m = m & ~ (1U << 24U)=8573157380, ma=16777216, res = m | ((unsigned int )(e + 128) << 24U)=4278190080, zero=0] [L243] a = base2flt(ma, ea) [L244] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=4278190080, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=4278190080] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=4278190080, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=4278190080] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=4278190080, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=4278190080] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=4278190080, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=4278190080] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=4278190080, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=4278190080] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=4278190080, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=4278190080] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=4278190080, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=4278190080] [L81] return (__retres4); VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=8573157380, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=4278190080, \result=4294967295, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=8573157380, res = m | ((unsigned int )(e + 128) << 24U)=4278190080] [L244] RET, EXPR base2flt(mb, eb) VAL [a=4278190080, base2flt(mb, eb)=4294967295, ea=127, eb=127, m = m & ~ (1U << 24U)=8573157380, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=4278190080, zero=0] [L244] b = base2flt(mb, eb) [L245] CALL addflt(a, b) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157385, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157381, \old(mb = b & ((1U << 24U) - 1U))=8573157378, \old(mb = mb | (1U << 24U))=8573157377, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, m = m & ~ (1U << 24U)=8573157380, ma = a & ((1U << 24U) - 1U)=8573157385, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157381, mb = b & ((1U << 24U) - 1U)=8573157378, mb = mb | (1U << 24U)=8573157377, res = m | ((unsigned int )(e + 128) << 24U)=4278190080, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157385, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157381, \old(mb = b & ((1U << 24U) - 1U))=8573157378, \old(mb = mb | (1U << 24U))=8573157377, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4278190080, b=4294967295, m = m & ~ (1U << 24U)=8573157380, ma = a & ((1U << 24U) - 1U)=8573157385, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157381, mb = b & ((1U << 24U) - 1U)=8573157378, mb = mb | (1U << 24U)=8573157377, res = m | ((unsigned int )(e + 128) << 24U)=4278190080, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L95] COND TRUE a < b [L96] tmp = a [L97] a = b [L98] b = tmp VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157385, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157381, \old(mb = b & ((1U << 24U) - 1U))=8573157378, \old(mb = mb | (1U << 24U))=8573157377, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, m = m & ~ (1U << 24U)=8573157380, ma = a & ((1U << 24U) - 1U)=8573157385, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157381, mb = b & ((1U << 24U) - 1U)=8573157378, mb = mb | (1U << 24U)=8573157377, res = m | ((unsigned int )(e + 128) << 24U)=4278190080, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L102] COND FALSE !(! b) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157385, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157381, \old(mb = b & ((1U << 24U) - 1U))=8573157378, \old(mb = mb | (1U << 24U))=8573157377, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, m = m & ~ (1U << 24U)=8573157380, ma = a & ((1U << 24U) - 1U)=8573157385, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157381, mb = b & ((1U << 24U) - 1U)=8573157378, mb = mb | (1U << 24U)=8573157377, res = m | ((unsigned int )(e + 128) << 24U)=4278190080, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L109] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157385, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157381, \old(mb = b & ((1U << 24U) - 1U))=8573157378, \old(mb = mb | (1U << 24U))=8573157377, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, m = m & ~ (1U << 24U)=8573157380, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157381, mb = b & ((1U << 24U) - 1U)=8573157378, mb = mb | (1U << 24U)=8573157377, res = m | ((unsigned int )(e + 128) << 24U)=4278190080, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L110] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157385, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157381, \old(mb = b & ((1U << 24U) - 1U))=8573157378, \old(mb = mb | (1U << 24U))=8573157377, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, m = m & ~ (1U << 24U)=8573157380, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157381, mb = b & ((1U << 24U) - 1U)=8573157378, mb = mb | (1U << 24U)=8573157377, res = m | ((unsigned int )(e + 128) << 24U)=4278190080, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L111] ma = ma | (1U << 24U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157385, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157381, \old(mb = b & ((1U << 24U) - 1U))=8573157378, \old(mb = mb | (1U << 24U))=8573157377, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, m = m & ~ (1U << 24U)=8573157380, ma=4278190083, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157381, mb = b & ((1U << 24U) - 1U)=8573157378, mb = mb | (1U << 24U)=8573157377, res = m | ((unsigned int )(e + 128) << 24U)=4278190080, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L112] mb = b & ((1U << 24U) - 1U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157385, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157381, \old(mb = b & ((1U << 24U) - 1U))=8573157378, \old(mb = mb | (1U << 24U))=8573157377, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, m = m & ~ (1U << 24U)=8573157380, ma=4278190083, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157381, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157377, res = m | ((unsigned int )(e + 128) << 24U)=4278190080, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L113] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157385, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157381, \old(mb = b & ((1U << 24U) - 1U))=8573157378, \old(mb = mb | (1U << 24U))=8573157377, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, eb=383, m = m & ~ (1U << 24U)=8573157380, ma=4278190083, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157381, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157377, res = m | ((unsigned int )(e + 128) << 24U)=4278190080, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L114] mb = mb | (1U << 24U) VAL [\old(a)=4278190080, \old(b)=4294967295, \old(ma = a & ((1U << 24U) - 1U))=8573157385, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157381, \old(mb = b & ((1U << 24U) - 1U))=8573157378, \old(mb = mb | (1U << 24U))=8573157377, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, a=4294967295, b=4278190080, ea=127, eb=383, m = m & ~ (1U << 24U)=8573157380, ma=4278190083, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157381, mb=4278190090, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157377, res = m | ((unsigned int )(e + 128) << 24U)=4278190080, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384, tmp=4278190080] [L115] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0, \old(ma = a & ((1U << 24U) - 1U))=8573157385, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157381, \old(mb = b & ((1U << 24U) - 1U))=8573157378, \old(mb = mb | (1U << 24U))=8573157377, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, m = m & ~ (1U << 24U)=8573157380, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157381, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157377, res = m | ((unsigned int )(e + 128) << 24U)=4278190080, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L17] COND TRUE !(cond) VAL [\old(cond)=0, \old(ma = a & ((1U << 24U) - 1U))=8573157385, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157381, \old(mb = b & ((1U << 24U) - 1U))=8573157378, \old(mb = mb | (1U << 24U))=8573157377, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, cond=0, m = m & ~ (1U << 24U)=8573157380, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157381, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157377, res = m | ((unsigned int )(e + 128) << 24U)=4278190080, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] [L18] reach_error() VAL [\old(cond)=0, \old(ma = a & ((1U << 24U) - 1U))=8573157385, \old(ma = ma & ((1U << 24U) - 1U))=8573157383, \old(ma = ma | (1U << 24U))=8573157381, \old(mb = b & ((1U << 24U) - 1U))=8573157378, \old(mb = mb | (1U << 24U))=8573157377, \old(res = ma | ((unsigned int )(ea + 128) << 24U))=8573157384, cond=0, m = m & ~ (1U << 24U)=8573157380, ma = a & ((1U << 24U) - 1U)=16777215, ma = ma & ((1U << 24U) - 1U)=8573157383, ma = ma | (1U << 24U)=8573157381, mb = b & ((1U << 24U) - 1U)=16777215, mb = mb | (1U << 24U)=8573157377, res = m | ((unsigned int )(e + 128) << 24U)=4278190080, res = ma | ((unsigned int )(ea + 128) << 24U)=8573157384] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.1s, OverallIterations: 33, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 41.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13522 SdHoareTripleChecker+Valid, 29.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13246 mSDsluCounter, 17715 SdHoareTripleChecker+Invalid, 24.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11990 mSDsCounter, 1950 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66817 IncrementalHoareTripleChecker+Invalid, 68767 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1950 mSolverCounterUnsat, 5725 mSDtfsCounter, 66817 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2827 GetRequests, 1899 SyntacticMatches, 17 SemanticMatches, 911 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6960 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=998occurred in iteration=31, InterpolantAutomatonStates: 653, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 5833 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 2748 NumberOfCodeBlocks, 2748 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 3378 ConstructedInterpolants, 0 QuantifiedInterpolants, 8805 SizeOfPredicates, 95 NumberOfNonLiveVariables, 3982 ConjunctsInSsa, 292 ConjunctsInUnsatCore, 64 InterpolantComputations, 19 PerfectInterpolantSequences, 1053/1266 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-19 10:52:30,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/soft_float_4-2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:52:32,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:52:32,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:52:32,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:52:32,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:52:32,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:52:32,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:52:32,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:52:32,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:52:32,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:52:32,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:52:32,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:52:32,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:52:32,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:52:32,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:52:32,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:52:32,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:52:32,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:52:32,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:52:32,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:52:32,204 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:52:32,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:52:32,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:52:32,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:52:32,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:52:32,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:52:32,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:52:32,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:52:32,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:52:32,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:52:32,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:52:32,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:52:32,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:52:32,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:52:32,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:52:32,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:52:32,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:52:32,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:52:32,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:52:32,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:52:32,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:52:32,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:52:32,234 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 10:52:32,264 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:52:32,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:52:32,265 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:52:32,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:52:32,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:52:32,266 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:52:32,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:52:32,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:52:32,267 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:52:32,268 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:52:32,268 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:52:32,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:52:32,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:52:32,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:52:32,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:52:32,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:52:32,277 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 10:52:32,277 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 10:52:32,278 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 10:52:32,278 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:52:32,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:52:32,278 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:52:32,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:52:32,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:52:32,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:52:32,279 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:52:32,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:52:32,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:52:32,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:52:32,280 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:52:32,280 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 10:52:32,281 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 10:52:32,281 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:52:32,281 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:52:32,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:52:32,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 10:52:32,282 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2022-07-19 10:52:32,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:52:32,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:52:32,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:52:32,594 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:52:32,595 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:52:32,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2022-07-19 10:52:32,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56581db35/0f92cdddc6204fc09bce44a268e11456/FLAG48d8980e3 [2022-07-19 10:52:33,100 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:52:33,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2022-07-19 10:52:33,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56581db35/0f92cdddc6204fc09bce44a268e11456/FLAG48d8980e3 [2022-07-19 10:52:33,129 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56581db35/0f92cdddc6204fc09bce44a268e11456 [2022-07-19 10:52:33,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:52:33,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:52:33,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:52:33,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:52:33,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:52:33,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:52:33" (1/1) ... [2022-07-19 10:52:33,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@320fa073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:33, skipping insertion in model container [2022-07-19 10:52:33,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:52:33" (1/1) ... [2022-07-19 10:52:33,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:52:33,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:52:33,339 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/bitvector/soft_float_4-2a.c.cil.c[755,768] [2022-07-19 10:52:33,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:52:33,453 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:52:33,465 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/bitvector/soft_float_4-2a.c.cil.c[755,768] [2022-07-19 10:52:33,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:52:33,522 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:52:33,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:33 WrapperNode [2022-07-19 10:52:33,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:52:33,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:52:33,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:52:33,524 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:52:33,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:33" (1/1) ... [2022-07-19 10:52:33,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:33" (1/1) ... [2022-07-19 10:52:33,569 INFO L137 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2022-07-19 10:52:33,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:52:33,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:52:33,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:52:33,571 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:52:33,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:33" (1/1) ... [2022-07-19 10:52:33,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:33" (1/1) ... [2022-07-19 10:52:33,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:33" (1/1) ... [2022-07-19 10:52:33,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:33" (1/1) ... [2022-07-19 10:52:33,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:33" (1/1) ... [2022-07-19 10:52:33,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:33" (1/1) ... [2022-07-19 10:52:33,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:33" (1/1) ... [2022-07-19 10:52:33,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:52:33,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:52:33,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:52:33,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:52:33,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:33" (1/1) ... [2022-07-19 10:52:33,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:52:33,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:52:33,640 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 10:52:33,661 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 10:52:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:52:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 10:52:33,679 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-19 10:52:33,680 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-19 10:52:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:52:33,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:52:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-19 10:52:33,680 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-19 10:52:33,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 10:52:33,681 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 10:52:33,752 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:52:33,753 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:52:33,917 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:52:33,922 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:52:33,922 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 10:52:33,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:52:33 BoogieIcfgContainer [2022-07-19 10:52:33,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:52:33,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:52:33,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:52:33,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:52:33,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:52:33" (1/3) ... [2022-07-19 10:52:33,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13cfb54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:52:33, skipping insertion in model container [2022-07-19 10:52:33,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:52:33" (2/3) ... [2022-07-19 10:52:33,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13cfb54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:52:33, skipping insertion in model container [2022-07-19 10:52:33,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:52:33" (3/3) ... [2022-07-19 10:52:33,930 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2022-07-19 10:52:33,941 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:52:33,941 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:52:34,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:52:34,021 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@59326672, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@815a11e [2022-07-19 10:52:34,021 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:52:34,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 42 states have internal predecessors, (61), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-19 10:52:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 10:52:34,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:34,032 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:34,033 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:34,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:34,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2030319843, now seen corresponding path program 1 times [2022-07-19 10:52:34,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:34,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778954000] [2022-07-19 10:52:34,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:34,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:34,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:34,055 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:34,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 10:52:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:34,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 10:52:34,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:34,306 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:34,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:34,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:34,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778954000] [2022-07-19 10:52:34,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778954000] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:34,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:34,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:52:34,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379832953] [2022-07-19 10:52:34,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:34,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:52:34,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:34,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:52:34,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:52:34,345 INFO L87 Difference]: Start difference. First operand has 54 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 42 states have internal predecessors, (61), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:34,481 INFO L93 Difference]: Finished difference Result 130 states and 195 transitions. [2022-07-19 10:52:34,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:52:34,483 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-07-19 10:52:34,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:34,490 INFO L225 Difference]: With dead ends: 130 [2022-07-19 10:52:34,490 INFO L226 Difference]: Without dead ends: 71 [2022-07-19 10:52:34,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:52:34,496 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 23 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:34,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 452 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:52:34,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-19 10:52:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2022-07-19 10:52:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 48 states have internal predecessors, (60), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2022-07-19 10:52:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2022-07-19 10:52:34,535 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 31 [2022-07-19 10:52:34,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:34,535 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2022-07-19 10:52:34,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2022-07-19 10:52:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 10:52:34,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:34,546 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:34,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:34,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:34,752 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:34,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:34,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1468368814, now seen corresponding path program 1 times [2022-07-19 10:52:34,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:34,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418722303] [2022-07-19 10:52:34,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:34,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:34,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:34,758 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:34,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 10:52:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:34,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:52:34,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:34,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:34,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:34,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418722303] [2022-07-19 10:52:34,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418722303] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:34,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:52:34,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-07-19 10:52:34,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077188522] [2022-07-19 10:52:34,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:34,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:52:34,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:34,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:52:34,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:52:34,928 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:52:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:35,059 INFO L93 Difference]: Finished difference Result 121 states and 159 transitions. [2022-07-19 10:52:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:52:35,060 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-07-19 10:52:35,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:35,061 INFO L225 Difference]: With dead ends: 121 [2022-07-19 10:52:35,062 INFO L226 Difference]: Without dead ends: 93 [2022-07-19 10:52:35,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:52:35,063 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 26 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:35,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 484 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:52:35,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-19 10:52:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2022-07-19 10:52:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 55 states have internal predecessors, (68), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-19 10:52:35,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-07-19 10:52:35,081 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 35 [2022-07-19 10:52:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:35,082 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-07-19 10:52:35,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:52:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-07-19 10:52:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 10:52:35,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:35,089 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:35,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:35,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:35,298 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:35,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:35,299 INFO L85 PathProgramCache]: Analyzing trace with hash -686479404, now seen corresponding path program 1 times [2022-07-19 10:52:35,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:35,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683544857] [2022-07-19 10:52:35,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:35,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:35,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:35,301 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:35,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 10:52:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:35,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 10:52:35,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:35,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:52:35,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:35,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683544857] [2022-07-19 10:52:35,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683544857] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:35,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:52:35,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-19 10:52:35,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237814915] [2022-07-19 10:52:35,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:35,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:52:35,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:35,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:52:35,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:52:35,483 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:35,575 INFO L93 Difference]: Finished difference Result 113 states and 148 transitions. [2022-07-19 10:52:35,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:52:35,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-07-19 10:52:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:35,580 INFO L225 Difference]: With dead ends: 113 [2022-07-19 10:52:35,580 INFO L226 Difference]: Without dead ends: 89 [2022-07-19 10:52:35,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:52:35,586 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 16 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:35,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 455 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:52:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-19 10:52:35,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2022-07-19 10:52:35,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.25) internal successors, (75), 62 states have internal predecessors, (75), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2022-07-19 10:52:35,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2022-07-19 10:52:35,608 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 39 [2022-07-19 10:52:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:35,609 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2022-07-19 10:52:35,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2022-07-19 10:52:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 10:52:35,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:35,613 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:35,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:35,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:35,825 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:35,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash 461161469, now seen corresponding path program 2 times [2022-07-19 10:52:35,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:35,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353442456] [2022-07-19 10:52:35,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:52:35,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:35,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:35,828 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:35,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 10:52:35,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 10:52:35,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:52:35,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:52:35,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:52:36,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:36,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:36,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353442456] [2022-07-19 10:52:36,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353442456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:36,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:36,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:52:36,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525896596] [2022-07-19 10:52:36,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:36,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:52:36,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:36,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:52:36,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:52:36,026 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:36,083 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-07-19 10:52:36,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:52:36,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-07-19 10:52:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:36,085 INFO L225 Difference]: With dead ends: 96 [2022-07-19 10:52:36,086 INFO L226 Difference]: Without dead ends: 94 [2022-07-19 10:52:36,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:52:36,087 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 9 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:36,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 333 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-07-19 10:52:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-19 10:52:36,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2022-07-19 10:52:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.25) internal successors, (80), 67 states have internal predecessors, (80), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (17), 12 states have call predecessors, (17), 13 states have call successors, (17) [2022-07-19 10:52:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2022-07-19 10:52:36,097 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 111 transitions. Word has length 39 [2022-07-19 10:52:36,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:36,102 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 111 transitions. [2022-07-19 10:52:36,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:36,103 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 111 transitions. [2022-07-19 10:52:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 10:52:36,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:36,104 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:36,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:36,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:36,313 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:36,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:36,313 INFO L85 PathProgramCache]: Analyzing trace with hash 518419771, now seen corresponding path program 1 times [2022-07-19 10:52:36,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:36,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749473111] [2022-07-19 10:52:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:36,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:36,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:36,315 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:36,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 10:52:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:36,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:52:36,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:36,439 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:52:36,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:36,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:36,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749473111] [2022-07-19 10:52:36,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749473111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:36,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:36,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:52:36,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933601595] [2022-07-19 10:52:36,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:36,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:52:36,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:36,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:52:36,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:52:36,444 INFO L87 Difference]: Start difference. First operand 87 states and 111 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:36,504 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2022-07-19 10:52:36,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:52:36,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-07-19 10:52:36,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:36,507 INFO L225 Difference]: With dead ends: 96 [2022-07-19 10:52:36,507 INFO L226 Difference]: Without dead ends: 94 [2022-07-19 10:52:36,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:52:36,508 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 9 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:36,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 304 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-07-19 10:52:36,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-19 10:52:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-07-19 10:52:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 65 states have internal predecessors, (78), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2022-07-19 10:52:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2022-07-19 10:52:36,527 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 39 [2022-07-19 10:52:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:36,527 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2022-07-19 10:52:36,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:52:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2022-07-19 10:52:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:52:36,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:36,528 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:36,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:36,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:36,729 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:36,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1162622522, now seen corresponding path program 1 times [2022-07-19 10:52:36,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:36,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240619211] [2022-07-19 10:52:36,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:36,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:36,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:36,731 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:36,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 10:52:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:36,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 10:52:36,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:52:36,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:36,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:36,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240619211] [2022-07-19 10:52:36,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240619211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:36,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:36,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:52:36,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983721844] [2022-07-19 10:52:36,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:36,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:52:36,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:36,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:52:36,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:52:36,881 INFO L87 Difference]: Start difference. First operand 85 states and 107 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:52:37,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:37,111 INFO L93 Difference]: Finished difference Result 126 states and 163 transitions. [2022-07-19 10:52:37,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:52:37,112 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-07-19 10:52:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:37,113 INFO L225 Difference]: With dead ends: 126 [2022-07-19 10:52:37,113 INFO L226 Difference]: Without dead ends: 119 [2022-07-19 10:52:37,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:52:37,114 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 34 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:37,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 651 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:52:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-19 10:52:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-07-19 10:52:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 76 states have internal predecessors, (91), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2022-07-19 10:52:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 129 transitions. [2022-07-19 10:52:37,124 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 129 transitions. Word has length 44 [2022-07-19 10:52:37,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:37,125 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 129 transitions. [2022-07-19 10:52:37,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:52:37,125 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2022-07-19 10:52:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 10:52:37,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:37,126 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:37,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:37,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:37,335 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:37,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:37,336 INFO L85 PathProgramCache]: Analyzing trace with hash -977013140, now seen corresponding path program 1 times [2022-07-19 10:52:37,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:37,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502529258] [2022-07-19 10:52:37,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:37,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:37,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:37,338 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:37,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 10:52:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:37,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 10:52:37,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:52:37,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 10:52:37,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:37,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502529258] [2022-07-19 10:52:37,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502529258] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:37,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:52:37,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-07-19 10:52:37,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965851362] [2022-07-19 10:52:37,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:37,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:52:37,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:37,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:52:37,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:52:37,626 INFO L87 Difference]: Start difference. First operand 100 states and 129 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:52:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:37,868 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-07-19 10:52:37,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:52:37,869 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-07-19 10:52:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:37,870 INFO L225 Difference]: With dead ends: 133 [2022-07-19 10:52:37,870 INFO L226 Difference]: Without dead ends: 125 [2022-07-19 10:52:37,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:52:37,871 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 50 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:37,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 692 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:52:37,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-19 10:52:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2022-07-19 10:52:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.216867469879518) internal successors, (101), 84 states have internal predecessors, (101), 17 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (24), 19 states have call predecessors, (24), 16 states have call successors, (24) [2022-07-19 10:52:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 142 transitions. [2022-07-19 10:52:37,893 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 142 transitions. Word has length 46 [2022-07-19 10:52:37,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:37,894 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 142 transitions. [2022-07-19 10:52:37,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:52:37,894 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 142 transitions. [2022-07-19 10:52:37,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 10:52:37,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:37,895 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:37,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:38,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:38,104 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:38,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash -919754838, now seen corresponding path program 1 times [2022-07-19 10:52:38,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:38,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506698921] [2022-07-19 10:52:38,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:38,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:38,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:38,106 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:38,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-19 10:52:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:38,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 10:52:38,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 10:52:38,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:38,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:38,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506698921] [2022-07-19 10:52:38,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506698921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:38,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:38,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:52:38,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617152835] [2022-07-19 10:52:38,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:38,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:52:38,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:38,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:52:38,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:52:38,177 INFO L87 Difference]: Start difference. First operand 111 states and 142 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 10:52:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:38,219 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2022-07-19 10:52:38,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:52:38,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-07-19 10:52:38,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:38,224 INFO L225 Difference]: With dead ends: 119 [2022-07-19 10:52:38,224 INFO L226 Difference]: Without dead ends: 104 [2022-07-19 10:52:38,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:52:38,225 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:38,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 309 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:52:38,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-19 10:52:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-19 10:52:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.205128205128205) internal successors, (94), 80 states have internal predecessors, (94), 15 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (21), 16 states have call predecessors, (21), 14 states have call successors, (21) [2022-07-19 10:52:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2022-07-19 10:52:38,233 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 46 [2022-07-19 10:52:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:38,234 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2022-07-19 10:52:38,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 10:52:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2022-07-19 10:52:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:52:38,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:38,235 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:38,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-19 10:52:38,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:38,444 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:38,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:38,444 INFO L85 PathProgramCache]: Analyzing trace with hash -168643793, now seen corresponding path program 1 times [2022-07-19 10:52:38,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:38,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486824252] [2022-07-19 10:52:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:38,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:38,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:38,446 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:38,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-19 10:52:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:38,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 10:52:38,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:52:38,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:52:38,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:38,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486824252] [2022-07-19 10:52:38,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486824252] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:38,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:52:38,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-07-19 10:52:38,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199233343] [2022-07-19 10:52:38,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:38,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 10:52:38,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:38,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 10:52:38,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2022-07-19 10:52:38,935 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 10:52:39,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:39,852 INFO L93 Difference]: Finished difference Result 151 states and 203 transitions. [2022-07-19 10:52:39,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-19 10:52:39,852 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 48 [2022-07-19 10:52:39,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:39,854 INFO L225 Difference]: With dead ends: 151 [2022-07-19 10:52:39,854 INFO L226 Difference]: Without dead ends: 114 [2022-07-19 10:52:39,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=1361, Unknown=0, NotChecked=0, Total=1560 [2022-07-19 10:52:39,855 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 99 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:39,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1232 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:52:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-19 10:52:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 86. [2022-07-19 10:52:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.234375) internal successors, (79), 68 states have internal predecessors, (79), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (24), 12 states have call predecessors, (24), 11 states have call successors, (24) [2022-07-19 10:52:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2022-07-19 10:52:39,863 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 48 [2022-07-19 10:52:39,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:39,864 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2022-07-19 10:52:39,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 10:52:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2022-07-19 10:52:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:52:39,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:39,865 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:39,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:40,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:40,074 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:40,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:40,074 INFO L85 PathProgramCache]: Analyzing trace with hash 291178745, now seen corresponding path program 2 times [2022-07-19 10:52:40,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:40,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476777908] [2022-07-19 10:52:40,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:52:40,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:40,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:40,076 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:40,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-19 10:52:40,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:52:40,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:52:40,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 10:52:40,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:52:40,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:52:40,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:40,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476777908] [2022-07-19 10:52:40,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476777908] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:40,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:52:40,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-07-19 10:52:40,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297032976] [2022-07-19 10:52:40,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:40,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 10:52:40,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:40,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 10:52:40,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2022-07-19 10:52:40,605 INFO L87 Difference]: Start difference. First operand 86 states and 115 transitions. Second operand has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 10:52:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:41,455 INFO L93 Difference]: Finished difference Result 126 states and 173 transitions. [2022-07-19 10:52:41,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 10:52:41,456 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 48 [2022-07-19 10:52:41,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:41,457 INFO L225 Difference]: With dead ends: 126 [2022-07-19 10:52:41,457 INFO L226 Difference]: Without dead ends: 115 [2022-07-19 10:52:41,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=1298, Unknown=0, NotChecked=0, Total=1482 [2022-07-19 10:52:41,458 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 123 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:41,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1023 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:52:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-19 10:52:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2022-07-19 10:52:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 69 states have internal predecessors, (80), 13 states have call successors, (13), 5 states have call predecessors, (13), 9 states have return successors, (27), 13 states have call predecessors, (27), 12 states have call successors, (27) [2022-07-19 10:52:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 120 transitions. [2022-07-19 10:52:41,466 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 120 transitions. Word has length 48 [2022-07-19 10:52:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:41,467 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 120 transitions. [2022-07-19 10:52:41,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 10:52:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2022-07-19 10:52:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 10:52:41,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:41,468 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:41,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:41,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:41,677 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:41,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash -744862915, now seen corresponding path program 1 times [2022-07-19 10:52:41,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:41,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095202323] [2022-07-19 10:52:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:41,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:41,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:41,679 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:41,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-19 10:52:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:41,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:52:41,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:52:43,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:43,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:43,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095202323] [2022-07-19 10:52:43,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095202323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:43,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:43,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:52:43,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302028852] [2022-07-19 10:52:43,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:43,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:52:43,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:43,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:52:43,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2022-07-19 10:52:43,936 INFO L87 Difference]: Start difference. First operand 88 states and 120 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:43,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:43,980 INFO L93 Difference]: Finished difference Result 95 states and 127 transitions. [2022-07-19 10:52:43,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:52:43,981 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2022-07-19 10:52:43,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:43,982 INFO L225 Difference]: With dead ends: 95 [2022-07-19 10:52:43,982 INFO L226 Difference]: Without dead ends: 93 [2022-07-19 10:52:43,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=22, Invalid=49, Unknown=1, NotChecked=0, Total=72 [2022-07-19 10:52:43,982 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 9 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:43,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 284 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-07-19 10:52:43,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-19 10:52:43,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-07-19 10:52:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 73 states have internal predecessors, (83), 14 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (28), 13 states have call predecessors, (28), 13 states have call successors, (28) [2022-07-19 10:52:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 125 transitions. [2022-07-19 10:52:43,989 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 125 transitions. Word has length 49 [2022-07-19 10:52:43,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:43,990 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 125 transitions. [2022-07-19 10:52:43,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2022-07-19 10:52:43,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 10:52:43,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:43,991 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:44,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:44,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:44,200 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:44,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:44,200 INFO L85 PathProgramCache]: Analyzing trace with hash -325172767, now seen corresponding path program 1 times [2022-07-19 10:52:44,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:44,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591938611] [2022-07-19 10:52:44,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:44,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:44,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:44,201 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:44,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-19 10:52:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:44,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:52:44,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:52:44,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:52:44,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:44,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591938611] [2022-07-19 10:52:44,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591938611] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:44,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:52:44,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-07-19 10:52:44,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995578366] [2022-07-19 10:52:44,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:44,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 10:52:44,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:44,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 10:52:44,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:52:44,583 INFO L87 Difference]: Start difference. First operand 93 states and 125 transitions. Second operand has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 10:52:44,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:44,948 INFO L93 Difference]: Finished difference Result 129 states and 179 transitions. [2022-07-19 10:52:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 10:52:44,949 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 50 [2022-07-19 10:52:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:44,950 INFO L225 Difference]: With dead ends: 129 [2022-07-19 10:52:44,950 INFO L226 Difference]: Without dead ends: 118 [2022-07-19 10:52:44,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:52:44,951 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 60 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:44,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 846 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:52:44,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-19 10:52:44,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2022-07-19 10:52:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 76 states have internal predecessors, (85), 14 states have call successors, (14), 6 states have call predecessors, (14), 11 states have return successors, (31), 13 states have call predecessors, (31), 13 states have call successors, (31) [2022-07-19 10:52:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2022-07-19 10:52:44,962 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 50 [2022-07-19 10:52:44,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:44,962 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2022-07-19 10:52:44,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 10:52:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2022-07-19 10:52:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-19 10:52:44,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:44,963 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:44,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:45,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:45,172 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:45,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:45,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1583051783, now seen corresponding path program 1 times [2022-07-19 10:52:45,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:45,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108991176] [2022-07-19 10:52:45,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:45,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:45,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:45,175 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:45,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-19 10:52:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:45,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:52:45,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 10:52:45,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:45,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:45,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108991176] [2022-07-19 10:52:45,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108991176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:45,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:45,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 10:52:45,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431874776] [2022-07-19 10:52:45,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:45,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:52:45,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:45,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:52:45,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:52:45,292 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:52:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:45,398 INFO L93 Difference]: Finished difference Result 159 states and 202 transitions. [2022-07-19 10:52:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:52:45,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2022-07-19 10:52:45,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:45,399 INFO L225 Difference]: With dead ends: 159 [2022-07-19 10:52:45,399 INFO L226 Difference]: Without dead ends: 91 [2022-07-19 10:52:45,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:52:45,400 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 13 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:45,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 501 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:52:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-19 10:52:45,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2022-07-19 10:52:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.234375) internal successors, (79), 70 states have internal predecessors, (79), 13 states have call successors, (13), 5 states have call predecessors, (13), 10 states have return successors, (29), 12 states have call predecessors, (29), 12 states have call successors, (29) [2022-07-19 10:52:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 121 transitions. [2022-07-19 10:52:45,408 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 121 transitions. Word has length 54 [2022-07-19 10:52:45,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:45,413 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 121 transitions. [2022-07-19 10:52:45,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 10:52:45,413 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2022-07-19 10:52:45,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 10:52:45,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:45,414 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:45,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:45,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:45,619 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:45,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:45,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1846975685, now seen corresponding path program 1 times [2022-07-19 10:52:45,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:45,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21081256] [2022-07-19 10:52:45,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:45,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:45,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:45,621 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:45,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-19 10:52:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:45,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:52:45,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 10:52:51,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:51,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:51,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21081256] [2022-07-19 10:52:51,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21081256] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:51,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:51,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:52:51,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359091782] [2022-07-19 10:52:51,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:51,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:52:51,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:51,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:52:51,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=37, Unknown=3, NotChecked=0, Total=56 [2022-07-19 10:52:51,310 INFO L87 Difference]: Start difference. First operand 88 states and 121 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:51,339 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2022-07-19 10:52:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:52:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2022-07-19 10:52:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:51,340 INFO L225 Difference]: With dead ends: 94 [2022-07-19 10:52:51,340 INFO L226 Difference]: Without dead ends: 90 [2022-07-19 10:52:51,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=20, Invalid=49, Unknown=3, NotChecked=0, Total=72 [2022-07-19 10:52:51,341 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 12 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:51,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 358 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 30 Unchecked, 0.0s Time] [2022-07-19 10:52:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-19 10:52:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-07-19 10:52:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 67 states have internal predecessors, (77), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (28), 12 states have call predecessors, (28), 11 states have call successors, (28) [2022-07-19 10:52:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2022-07-19 10:52:51,348 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 50 [2022-07-19 10:52:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:51,348 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2022-07-19 10:52:51,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:52:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2022-07-19 10:52:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-19 10:52:51,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:51,349 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:51,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:51,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:51,558 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:51,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:51,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1592416888, now seen corresponding path program 1 times [2022-07-19 10:52:51,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:51,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630516419] [2022-07-19 10:52:51,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:51,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:51,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:51,560 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:51,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-19 10:52:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:51,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:52:51,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 10:52:51,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 10:52:51,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:51,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630516419] [2022-07-19 10:52:51,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630516419] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:51,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:52:51,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-07-19 10:52:51,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203620702] [2022-07-19 10:52:51,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:51,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:52:51,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:51,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:52:51,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:52:51,799 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:52:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:51,990 INFO L93 Difference]: Finished difference Result 111 states and 163 transitions. [2022-07-19 10:52:51,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:52:51,991 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-07-19 10:52:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:51,992 INFO L225 Difference]: With dead ends: 111 [2022-07-19 10:52:51,992 INFO L226 Difference]: Without dead ends: 98 [2022-07-19 10:52:51,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:52:51,993 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 119 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:51,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 481 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:52:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-19 10:52:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2022-07-19 10:52:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 70 states have internal predecessors, (79), 12 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (31), 12 states have call predecessors, (31), 11 states have call successors, (31) [2022-07-19 10:52:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2022-07-19 10:52:52,000 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 54 [2022-07-19 10:52:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:52,000 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2022-07-19 10:52:52,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:52:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2022-07-19 10:52:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 10:52:52,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:52,002 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:52,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:52,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:52,207 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:52,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:52,208 INFO L85 PathProgramCache]: Analyzing trace with hash -177633806, now seen corresponding path program 1 times [2022-07-19 10:52:52,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:52,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21664663] [2022-07-19 10:52:52,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:52,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:52,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:52,209 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:52,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-19 10:52:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:52,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:52:52,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:52,337 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 10:52:52,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:52,512 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 10:52:52,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:52,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21664663] [2022-07-19 10:52:52,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21664663] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:52,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:52:52,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-07-19 10:52:52,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285637429] [2022-07-19 10:52:52,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:52,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:52:52,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:52,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:52:52,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:52:52,514 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:52:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:52,699 INFO L93 Difference]: Finished difference Result 111 states and 161 transitions. [2022-07-19 10:52:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:52:52,700 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2022-07-19 10:52:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:52,701 INFO L225 Difference]: With dead ends: 111 [2022-07-19 10:52:52,701 INFO L226 Difference]: Without dead ends: 98 [2022-07-19 10:52:52,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:52:52,702 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 108 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:52,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 495 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:52:52,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-19 10:52:52,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2022-07-19 10:52:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 70 states have internal predecessors, (79), 12 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (30), 12 states have call predecessors, (30), 11 states have call successors, (30) [2022-07-19 10:52:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 121 transitions. [2022-07-19 10:52:52,709 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 121 transitions. Word has length 63 [2022-07-19 10:52:52,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:52,710 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 121 transitions. [2022-07-19 10:52:52,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:52:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2022-07-19 10:52:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 10:52:52,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:52,711 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:52,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-19 10:52:52,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:52,924 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash -378794195, now seen corresponding path program 1 times [2022-07-19 10:52:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:52,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012694673] [2022-07-19 10:52:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:52,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:52,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:52,926 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:52,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-19 10:52:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:52,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:52:52,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 10:52:53,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 10:52:53,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:53,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012694673] [2022-07-19 10:52:53,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012694673] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:53,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:52:53,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-07-19 10:52:53,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668300257] [2022-07-19 10:52:53,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:53,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:52:53,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:53,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:52:53,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:52:53,237 INFO L87 Difference]: Start difference. First operand 88 states and 121 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:52:53,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:53,466 INFO L93 Difference]: Finished difference Result 109 states and 153 transitions. [2022-07-19 10:52:53,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:52:53,467 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2022-07-19 10:52:53,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:53,468 INFO L225 Difference]: With dead ends: 109 [2022-07-19 10:52:53,468 INFO L226 Difference]: Without dead ends: 95 [2022-07-19 10:52:53,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:52:53,469 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 101 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:53,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 565 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:52:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-19 10:52:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2022-07-19 10:52:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 67 states have internal predecessors, (76), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (27), 12 states have call predecessors, (27), 11 states have call successors, (27) [2022-07-19 10:52:53,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 115 transitions. [2022-07-19 10:52:53,476 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 115 transitions. Word has length 63 [2022-07-19 10:52:53,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:53,476 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 115 transitions. [2022-07-19 10:52:53,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:52:53,476 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 115 transitions. [2022-07-19 10:52:53,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 10:52:53,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:53,477 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:53,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:53,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:53,687 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:53,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:53,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2130957302, now seen corresponding path program 1 times [2022-07-19 10:52:53,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:53,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651122640] [2022-07-19 10:52:53,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:53,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:53,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:53,690 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:53,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-19 10:52:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:53,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:52:53,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 10:52:53,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 10:52:53,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:53,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651122640] [2022-07-19 10:52:53,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651122640] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:53,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:52:53,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-07-19 10:52:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260246154] [2022-07-19 10:52:53,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:53,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:52:53,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:53,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:52:53,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:52:53,985 INFO L87 Difference]: Start difference. First operand 85 states and 115 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:52:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:54,186 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2022-07-19 10:52:54,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:52:54,187 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2022-07-19 10:52:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:54,188 INFO L225 Difference]: With dead ends: 106 [2022-07-19 10:52:54,188 INFO L226 Difference]: Without dead ends: 92 [2022-07-19 10:52:54,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:52:54,189 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 104 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:54,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 522 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:52:54,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-19 10:52:54,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2022-07-19 10:52:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 64 states have internal predecessors, (73), 12 states have call successors, (12), 5 states have call predecessors, (12), 8 states have return successors, (25), 12 states have call predecessors, (25), 11 states have call successors, (25) [2022-07-19 10:52:54,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions. [2022-07-19 10:52:54,195 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 110 transitions. Word has length 65 [2022-07-19 10:52:54,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:54,196 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 110 transitions. [2022-07-19 10:52:54,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:52:54,196 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2022-07-19 10:52:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 10:52:54,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:54,197 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:54,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:54,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:54,398 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:54,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:54,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1951422266, now seen corresponding path program 1 times [2022-07-19 10:52:54,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:54,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691774548] [2022-07-19 10:52:54,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:54,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:54,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:54,400 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:54,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-19 10:52:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:54,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 10:52:54,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 10:52:54,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:52:54,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:54,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691774548] [2022-07-19 10:52:54,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691774548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:52:54,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:52:54,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 10:52:54,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001154989] [2022-07-19 10:52:54,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:52:54,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:52:54,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:54,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:52:54,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:52:54,878 INFO L87 Difference]: Start difference. First operand 82 states and 110 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:52:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:52:55,437 INFO L93 Difference]: Finished difference Result 108 states and 148 transitions. [2022-07-19 10:52:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:52:55,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2022-07-19 10:52:55,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:52:55,439 INFO L225 Difference]: With dead ends: 108 [2022-07-19 10:52:55,439 INFO L226 Difference]: Without dead ends: 97 [2022-07-19 10:52:55,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:52:55,440 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 47 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:52:55,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 508 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:52:55,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-19 10:52:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2022-07-19 10:52:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 73 states have internal predecessors, (82), 13 states have call successors, (13), 5 states have call predecessors, (13), 10 states have return successors, (33), 13 states have call predecessors, (33), 12 states have call successors, (33) [2022-07-19 10:52:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2022-07-19 10:52:55,448 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 72 [2022-07-19 10:52:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:52:55,449 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2022-07-19 10:52:55,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:52:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2022-07-19 10:52:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 10:52:55,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:52:55,450 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:52:55,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-19 10:52:55,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:52:55,662 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:52:55,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:52:55,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1279345645, now seen corresponding path program 1 times [2022-07-19 10:52:55,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:52:55,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192875237] [2022-07-19 10:52:55,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:52:55,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:52:55,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:52:55,664 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:52:55,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-19 10:52:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:52:55,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 10:52:55,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:52:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 10:52:56,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:52:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 10:52:57,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:52:57,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192875237] [2022-07-19 10:52:57,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192875237] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:52:57,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:52:57,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-07-19 10:52:57,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074342918] [2022-07-19 10:52:57,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:52:57,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 10:52:57,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:52:57,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 10:52:57,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:52:57,656 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 10:53:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:00,140 INFO L93 Difference]: Finished difference Result 113 states and 155 transitions. [2022-07-19 10:53:00,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:53:00,142 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 72 [2022-07-19 10:53:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:00,142 INFO L225 Difference]: With dead ends: 113 [2022-07-19 10:53:00,143 INFO L226 Difference]: Without dead ends: 102 [2022-07-19 10:53:00,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 10:53:00,144 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 153 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:00,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 827 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-19 10:53:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-19 10:53:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2022-07-19 10:53:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.208955223880597) internal successors, (81), 72 states have internal predecessors, (81), 12 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (28), 12 states have call predecessors, (28), 11 states have call successors, (28) [2022-07-19 10:53:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 121 transitions. [2022-07-19 10:53:00,153 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 121 transitions. Word has length 72 [2022-07-19 10:53:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:00,153 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 121 transitions. [2022-07-19 10:53:00,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 10:53:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 121 transitions. [2022-07-19 10:53:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 10:53:00,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:00,154 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:00,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-19 10:53:00,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:53:00,368 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:00,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash -784876239, now seen corresponding path program 2 times [2022-07-19 10:53:00,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:53:00,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186794277] [2022-07-19 10:53:00,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:53:00,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:53:00,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:53:00,370 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:53:00,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-19 10:53:00,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:53:00,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:53:00,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 10:53:00,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:53:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 10:53:00,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:53:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 10:53:02,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:53:02,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186794277] [2022-07-19 10:53:02,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186794277] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:53:02,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:53:02,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-07-19 10:53:02,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975244396] [2022-07-19 10:53:02,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:53:02,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 10:53:02,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:53:02,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 10:53:02,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:53:02,057 INFO L87 Difference]: Start difference. First operand 90 states and 121 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 10:53:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:04,343 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2022-07-19 10:53:04,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:53:04,345 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 72 [2022-07-19 10:53:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:04,345 INFO L225 Difference]: With dead ends: 111 [2022-07-19 10:53:04,345 INFO L226 Difference]: Without dead ends: 102 [2022-07-19 10:53:04,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 10:53:04,346 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 165 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:04,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 752 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 10:53:04,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-19 10:53:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 80. [2022-07-19 10:53:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.2) internal successors, (72), 63 states have internal predecessors, (72), 11 states have call successors, (11), 5 states have call predecessors, (11), 8 states have return successors, (19), 11 states have call predecessors, (19), 10 states have call successors, (19) [2022-07-19 10:53:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2022-07-19 10:53:04,353 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 72 [2022-07-19 10:53:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:04,354 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2022-07-19 10:53:04,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 10:53:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-07-19 10:53:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 10:53:04,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:04,355 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:04,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-19 10:53:04,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:53:04,565 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:04,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:04,565 INFO L85 PathProgramCache]: Analyzing trace with hash 324909818, now seen corresponding path program 1 times [2022-07-19 10:53:04,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:53:04,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442259360] [2022-07-19 10:53:04,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:04,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:53:04,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:53:04,566 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:53:04,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-19 10:53:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:04,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-19 10:53:04,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:53:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 10:53:04,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:53:04,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:53:04,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442259360] [2022-07-19 10:53:04,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442259360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:04,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:04,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 10:53:04,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663612913] [2022-07-19 10:53:04,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:04,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:53:04,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:53:04,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:53:04,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:53:04,970 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:53:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:05,411 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2022-07-19 10:53:05,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:53:05,412 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 72 [2022-07-19 10:53:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:05,413 INFO L225 Difference]: With dead ends: 99 [2022-07-19 10:53:05,413 INFO L226 Difference]: Without dead ends: 88 [2022-07-19 10:53:05,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:53:05,414 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 28 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:05,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 437 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:05,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-19 10:53:05,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2022-07-19 10:53:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 54 states have internal predecessors, (63), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (14), 9 states have call predecessors, (14), 8 states have call successors, (14) [2022-07-19 10:53:05,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2022-07-19 10:53:05,421 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 72 [2022-07-19 10:53:05,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:05,421 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2022-07-19 10:53:05,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:53:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2022-07-19 10:53:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-19 10:53:05,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:05,422 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:05,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-19 10:53:05,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:53:05,631 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:05,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:05,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1031466431, now seen corresponding path program 1 times [2022-07-19 10:53:05,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:53:05,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133658164] [2022-07-19 10:53:05,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:05,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:53:05,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:53:05,634 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:53:05,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-19 10:53:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:05,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 10:53:05,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:53:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 10:53:06,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:53:06,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:53:06,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133658164] [2022-07-19 10:53:06,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133658164] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:53:06,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [842316036] [2022-07-19 10:53:06,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:06,673 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 10:53:06,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 10:53:06,674 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 10:53:06,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-07-19 10:53:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:06,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:53:06,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:53:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-19 10:53:06,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:53:06,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [842316036] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:06,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:53:06,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2022-07-19 10:53:06,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810239088] [2022-07-19 10:53:06,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:06,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:53:06,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:53:06,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:53:06,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:53:06,945 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:53:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:07,009 INFO L93 Difference]: Finished difference Result 110 states and 150 transitions. [2022-07-19 10:53:07,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:53:07,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 74 [2022-07-19 10:53:07,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:07,010 INFO L225 Difference]: With dead ends: 110 [2022-07-19 10:53:07,010 INFO L226 Difference]: Without dead ends: 99 [2022-07-19 10:53:07,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:53:07,011 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 22 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:07,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 278 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:53:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-19 10:53:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2022-07-19 10:53:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 73 states have internal predecessors, (82), 13 states have call successors, (13), 5 states have call predecessors, (13), 10 states have return successors, (30), 13 states have call predecessors, (30), 12 states have call successors, (30) [2022-07-19 10:53:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 125 transitions. [2022-07-19 10:53:07,025 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 125 transitions. Word has length 74 [2022-07-19 10:53:07,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:07,025 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 125 transitions. [2022-07-19 10:53:07,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:53:07,025 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 125 transitions. [2022-07-19 10:53:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-19 10:53:07,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:07,027 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:07,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-07-19 10:53:07,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-19 10:53:07,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:53:07,428 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:07,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:07,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1250321149, now seen corresponding path program 1 times [2022-07-19 10:53:07,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:53:07,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856862047] [2022-07-19 10:53:07,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:07,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:53:07,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:53:07,431 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:53:07,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-19 10:53:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:07,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 10:53:07,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:53:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 10:53:07,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:53:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 10:53:09,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:53:09,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856862047] [2022-07-19 10:53:09,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856862047] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:53:09,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:53:09,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-07-19 10:53:09,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457621231] [2022-07-19 10:53:09,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:53:09,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 10:53:09,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:53:09,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 10:53:09,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:53:09,049 INFO L87 Difference]: Start difference. First operand 92 states and 125 transitions. Second operand has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 10:53:11,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:11,310 INFO L93 Difference]: Finished difference Result 113 states and 150 transitions. [2022-07-19 10:53:11,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:53:11,311 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 74 [2022-07-19 10:53:11,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:11,311 INFO L225 Difference]: With dead ends: 113 [2022-07-19 10:53:11,311 INFO L226 Difference]: Without dead ends: 102 [2022-07-19 10:53:11,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=204, Invalid=852, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 10:53:11,313 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 174 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:11,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 728 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 10:53:11,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-19 10:53:11,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2022-07-19 10:53:11,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 66 states have internal predecessors, (77), 12 states have call successors, (12), 5 states have call predecessors, (12), 8 states have return successors, (21), 12 states have call predecessors, (21), 11 states have call successors, (21) [2022-07-19 10:53:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2022-07-19 10:53:11,321 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 74 [2022-07-19 10:53:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:11,321 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2022-07-19 10:53:11,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 10:53:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2022-07-19 10:53:11,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-19 10:53:11,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:11,323 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:11,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-19 10:53:11,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:53:11,531 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:11,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:11,531 INFO L85 PathProgramCache]: Analyzing trace with hash 359389810, now seen corresponding path program 1 times [2022-07-19 10:53:11,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:53:11,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542741665] [2022-07-19 10:53:11,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:11,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:53:11,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:53:11,533 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:53:11,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-19 10:53:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:11,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:53:11,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:53:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-19 10:53:11,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:53:11,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:53:11,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542741665] [2022-07-19 10:53:11,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542741665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:11,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:11,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:53:11,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414438134] [2022-07-19 10:53:11,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:11,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:53:11,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:53:11,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:53:11,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:53:11,646 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 10:53:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:11,725 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2022-07-19 10:53:11,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:53:11,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 74 [2022-07-19 10:53:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:11,726 INFO L225 Difference]: With dead ends: 103 [2022-07-19 10:53:11,726 INFO L226 Difference]: Without dead ends: 94 [2022-07-19 10:53:11,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:53:11,727 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 7 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 337 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.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:11,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 337 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:53:11,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-19 10:53:11,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2022-07-19 10:53:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 70 states have internal predecessors, (80), 13 states have call successors, (13), 5 states have call predecessors, (13), 9 states have return successors, (23), 13 states have call predecessors, (23), 12 states have call successors, (23) [2022-07-19 10:53:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 116 transitions. [2022-07-19 10:53:11,736 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 116 transitions. Word has length 74 [2022-07-19 10:53:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:11,737 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 116 transitions. [2022-07-19 10:53:11,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 10:53:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 116 transitions. [2022-07-19 10:53:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-19 10:53:11,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:11,738 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:11,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-19 10:53:11,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:53:11,947 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:11,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1455113153, now seen corresponding path program 2 times [2022-07-19 10:53:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:53:11,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558178527] [2022-07-19 10:53:11,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:53:11,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:53:11,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:53:11,949 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:53:11,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-19 10:53:11,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:53:11,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:53:12,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 10:53:12,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:53:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 10:53:12,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:53:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 10:53:13,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:53:13,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558178527] [2022-07-19 10:53:13,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558178527] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:53:13,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:53:13,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-07-19 10:53:13,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333345468] [2022-07-19 10:53:13,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:53:13,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 10:53:13,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:53:13,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 10:53:13,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:53:13,501 INFO L87 Difference]: Start difference. First operand 89 states and 116 transitions. Second operand has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 10:53:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:15,573 INFO L93 Difference]: Finished difference Result 115 states and 149 transitions. [2022-07-19 10:53:15,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:53:15,574 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 74 [2022-07-19 10:53:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:15,575 INFO L225 Difference]: With dead ends: 115 [2022-07-19 10:53:15,575 INFO L226 Difference]: Without dead ends: 98 [2022-07-19 10:53:15,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 10:53:15,576 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 153 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:15,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 740 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 10:53:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-19 10:53:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2022-07-19 10:53:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 13 states have call successors, (13), 5 states have call predecessors, (13), 8 states have return successors, (21), 13 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-19 10:53:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2022-07-19 10:53:15,586 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 74 [2022-07-19 10:53:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:15,586 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2022-07-19 10:53:15,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 22 states have internal predecessors, (58), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 10:53:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2022-07-19 10:53:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-19 10:53:15,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:15,587 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:15,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-19 10:53:15,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:53:15,795 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:15,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1678929915, now seen corresponding path program 1 times [2022-07-19 10:53:15,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:53:15,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162651301] [2022-07-19 10:53:15,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:15,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:53:15,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:53:15,797 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:53:15,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-19 10:53:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:15,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-19 10:53:15,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:53:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 10:53:16,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:53:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 10:53:18,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:53:18,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162651301] [2022-07-19 10:53:18,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162651301] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:53:18,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:53:18,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 26 [2022-07-19 10:53:18,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770580342] [2022-07-19 10:53:18,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:53:18,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 10:53:18,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:53:18,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 10:53:18,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-07-19 10:53:18,627 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:53:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:23,950 INFO L93 Difference]: Finished difference Result 116 states and 152 transitions. [2022-07-19 10:53:23,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 10:53:23,951 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 81 [2022-07-19 10:53:23,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:23,952 INFO L225 Difference]: With dead ends: 116 [2022-07-19 10:53:23,952 INFO L226 Difference]: Without dead ends: 105 [2022-07-19 10:53:23,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2022-07-19 10:53:23,954 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 133 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:23,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 924 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-19 10:53:23,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-19 10:53:23,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2022-07-19 10:53:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 76 states have internal predecessors, (83), 16 states have call successors, (16), 5 states have call predecessors, (16), 10 states have return successors, (32), 16 states have call predecessors, (32), 15 states have call successors, (32) [2022-07-19 10:53:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 131 transitions. [2022-07-19 10:53:23,968 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 131 transitions. Word has length 81 [2022-07-19 10:53:23,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:23,968 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 131 transitions. [2022-07-19 10:53:23,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:53:23,969 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 131 transitions. [2022-07-19 10:53:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-19 10:53:23,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:23,970 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:23,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-19 10:53:24,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:53:24,179 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2063078729, now seen corresponding path program 2 times [2022-07-19 10:53:24,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:53:24,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482027407] [2022-07-19 10:53:24,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:53:24,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:53:24,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:53:24,181 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:53:24,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-19 10:53:24,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:53:24,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:53:24,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-19 10:53:24,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:53:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 10:53:24,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:53:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 10:53:26,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:53:26,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482027407] [2022-07-19 10:53:26,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482027407] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:53:26,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:53:26,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 26 [2022-07-19 10:53:26,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592951915] [2022-07-19 10:53:26,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:53:26,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 10:53:26,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:53:26,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 10:53:26,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-07-19 10:53:26,905 INFO L87 Difference]: Start difference. First operand 98 states and 131 transitions. Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:53:31,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:31,508 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2022-07-19 10:53:31,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 10:53:31,510 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 81 [2022-07-19 10:53:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:31,511 INFO L225 Difference]: With dead ends: 118 [2022-07-19 10:53:31,511 INFO L226 Difference]: Without dead ends: 107 [2022-07-19 10:53:31,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2022-07-19 10:53:31,512 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 153 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:31,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 846 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-19 10:53:31,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-19 10:53:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2022-07-19 10:53:31,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 77 states have internal predecessors, (84), 17 states have call successors, (17), 5 states have call predecessors, (17), 10 states have return successors, (34), 17 states have call predecessors, (34), 16 states have call successors, (34) [2022-07-19 10:53:31,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 135 transitions. [2022-07-19 10:53:31,529 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 135 transitions. Word has length 81 [2022-07-19 10:53:31,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:31,529 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 135 transitions. [2022-07-19 10:53:31,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:53:31,529 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 135 transitions. [2022-07-19 10:53:31,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-19 10:53:31,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:31,531 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:31,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-19 10:53:31,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:53:31,740 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:31,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:31,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1451945505, now seen corresponding path program 1 times [2022-07-19 10:53:31,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:53:31,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572361181] [2022-07-19 10:53:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:31,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:53:31,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:53:31,742 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:53:31,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-19 10:53:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:31,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-19 10:53:31,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:53:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 10:53:32,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:53:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 10:53:34,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:53:34,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572361181] [2022-07-19 10:53:34,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572361181] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:53:34,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:53:34,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 26 [2022-07-19 10:53:34,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815112019] [2022-07-19 10:53:34,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:53:34,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 10:53:34,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:53:34,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 10:53:34,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-07-19 10:53:34,439 INFO L87 Difference]: Start difference. First operand 100 states and 135 transitions. Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:53:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:39,140 INFO L93 Difference]: Finished difference Result 114 states and 150 transitions. [2022-07-19 10:53:39,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 10:53:39,141 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 79 [2022-07-19 10:53:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:39,142 INFO L225 Difference]: With dead ends: 114 [2022-07-19 10:53:39,142 INFO L226 Difference]: Without dead ends: 105 [2022-07-19 10:53:39,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2022-07-19 10:53:39,143 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 156 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:39,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 822 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-19 10:53:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-19 10:53:39,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2022-07-19 10:53:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 77 states have internal predecessors, (84), 17 states have call successors, (17), 5 states have call predecessors, (17), 10 states have return successors, (30), 17 states have call predecessors, (30), 16 states have call successors, (30) [2022-07-19 10:53:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-07-19 10:53:39,156 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 79 [2022-07-19 10:53:39,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:39,156 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-07-19 10:53:39,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:53:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-07-19 10:53:39,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-19 10:53:39,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:39,157 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:39,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-07-19 10:53:39,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:53:39,367 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:39,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:39,367 INFO L85 PathProgramCache]: Analyzing trace with hash -476190709, now seen corresponding path program 1 times [2022-07-19 10:53:39,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:53:39,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098093661] [2022-07-19 10:53:39,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:39,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:53:39,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:53:39,369 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:53:39,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-19 10:53:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:39,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:53:39,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:53:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 10:53:39,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:53:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 10:53:39,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:53:39,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098093661] [2022-07-19 10:53:39,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098093661] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:53:39,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:53:39,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-07-19 10:53:39,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407712785] [2022-07-19 10:53:39,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:53:39,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 10:53:39,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:53:39,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 10:53:39,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:53:39,825 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:53:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:40,263 INFO L93 Difference]: Finished difference Result 109 states and 139 transitions. [2022-07-19 10:53:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:53:40,263 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 82 [2022-07-19 10:53:40,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:40,264 INFO L225 Difference]: With dead ends: 109 [2022-07-19 10:53:40,264 INFO L226 Difference]: Without dead ends: 98 [2022-07-19 10:53:40,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:53:40,265 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 112 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:40,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 689 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-19 10:53:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-19 10:53:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 76 states have internal predecessors, (83), 16 states have call successors, (16), 5 states have call predecessors, (16), 10 states have return successors, (28), 16 states have call predecessors, (28), 15 states have call successors, (28) [2022-07-19 10:53:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2022-07-19 10:53:40,278 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 82 [2022-07-19 10:53:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:40,279 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2022-07-19 10:53:40,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:53:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2022-07-19 10:53:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-19 10:53:40,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:40,280 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:40,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-07-19 10:53:40,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:53:40,489 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:40,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:40,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1133603807, now seen corresponding path program 2 times [2022-07-19 10:53:40,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:53:40,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304345785] [2022-07-19 10:53:40,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:53:40,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:53:40,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:53:40,492 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:53:40,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-19 10:53:40,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:53:40,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:53:40,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-19 10:53:40,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:53:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 10:53:41,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:53:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 10:53:43,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:53:43,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304345785] [2022-07-19 10:53:43,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304345785] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:53:43,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:53:43,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 26 [2022-07-19 10:53:43,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811126184] [2022-07-19 10:53:43,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:53:43,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 10:53:43,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:53:43,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 10:53:43,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-07-19 10:53:43,302 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:53:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:48,673 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2022-07-19 10:53:48,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 10:53:48,674 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 79 [2022-07-19 10:53:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:48,675 INFO L225 Difference]: With dead ends: 112 [2022-07-19 10:53:48,675 INFO L226 Difference]: Without dead ends: 103 [2022-07-19 10:53:48,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2022-07-19 10:53:48,679 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 172 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:48,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 874 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-19 10:53:48,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-19 10:53:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2022-07-19 10:53:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 76 states have internal predecessors, (83), 16 states have call successors, (16), 5 states have call predecessors, (16), 10 states have return successors, (26), 16 states have call predecessors, (26), 15 states have call successors, (26) [2022-07-19 10:53:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 125 transitions. [2022-07-19 10:53:48,689 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 125 transitions. Word has length 79 [2022-07-19 10:53:48,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:48,689 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 125 transitions. [2022-07-19 10:53:48,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:53:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2022-07-19 10:53:48,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-19 10:53:48,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:48,691 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:48,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-19 10:53:48,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:53:48,901 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:48,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:48,901 INFO L85 PathProgramCache]: Analyzing trace with hash -514341681, now seen corresponding path program 2 times [2022-07-19 10:53:48,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:53:48,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540739711] [2022-07-19 10:53:48,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:53:48,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:53:48,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:53:48,902 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:53:48,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-19 10:53:48,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:53:48,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:53:48,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:53:48,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:53:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 10:53:49,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:53:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 10:53:49,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:53:49,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540739711] [2022-07-19 10:53:49,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540739711] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:53:49,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:53:49,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-07-19 10:53:49,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272504744] [2022-07-19 10:53:49,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:53:49,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 10:53:49,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:53:49,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 10:53:49,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:53:49,389 INFO L87 Difference]: Start difference. First operand 98 states and 125 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:53:49,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:49,748 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2022-07-19 10:53:49,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:53:49,749 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 82 [2022-07-19 10:53:49,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:49,749 INFO L225 Difference]: With dead ends: 105 [2022-07-19 10:53:49,749 INFO L226 Difference]: Without dead ends: 94 [2022-07-19 10:53:49,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:53:49,750 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 124 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:49,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 599 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:49,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-19 10:53:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-19 10:53:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 74 states have internal predecessors, (80), 15 states have call successors, (15), 5 states have call predecessors, (15), 10 states have return successors, (23), 14 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-19 10:53:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2022-07-19 10:53:49,764 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 82 [2022-07-19 10:53:49,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:49,765 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2022-07-19 10:53:49,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:53:49,765 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2022-07-19 10:53:49,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 10:53:49,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:49,766 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:49,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-19 10:53:49,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:53:49,976 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:49,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:49,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1357497146, now seen corresponding path program 1 times [2022-07-19 10:53:49,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:53:49,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319743812] [2022-07-19 10:53:49,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:49,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:53:49,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:53:49,978 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:53:49,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-19 10:53:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:50,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-19 10:53:50,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:53:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-19 10:53:51,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:53:56,812 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-19 10:53:56,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:53:56,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319743812] [2022-07-19 10:53:56,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319743812] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:53:56,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:53:56,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2022-07-19 10:53:56,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829158759] [2022-07-19 10:53:56,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:53:56,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-19 10:53:56,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:53:56,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-19 10:53:56,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1388, Unknown=0, NotChecked=0, Total=1482 [2022-07-19 10:53:56,814 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand has 39 states, 37 states have (on average 1.864864864864865) internal successors, (69), 35 states have internal predecessors, (69), 12 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-19 10:54:14,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:14,798 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2022-07-19 10:54:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-19 10:54:14,800 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.864864864864865) internal successors, (69), 35 states have internal predecessors, (69), 12 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) Word has length 84 [2022-07-19 10:54:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:14,800 INFO L225 Difference]: With dead ends: 104 [2022-07-19 10:54:14,801 INFO L226 Difference]: Without dead ends: 99 [2022-07-19 10:54:14,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=380, Invalid=4042, Unknown=0, NotChecked=0, Total=4422 [2022-07-19 10:54:14,802 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 138 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:14,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1152 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1220 Invalid, 0 Unknown, 100 Unchecked, 7.7s Time] [2022-07-19 10:54:14,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-19 10:54:14,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2022-07-19 10:54:14,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 75 states have internal predecessors, (82), 15 states have call successors, (15), 5 states have call predecessors, (15), 10 states have return successors, (23), 15 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-19 10:54:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2022-07-19 10:54:14,817 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 84 [2022-07-19 10:54:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:14,817 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2022-07-19 10:54:14,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.864864864864865) internal successors, (69), 35 states have internal predecessors, (69), 12 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-19 10:54:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2022-07-19 10:54:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-19 10:54:14,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:14,819 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:14,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2022-07-19 10:54:15,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:54:15,028 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:15,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:15,028 INFO L85 PathProgramCache]: Analyzing trace with hash 160331167, now seen corresponding path program 1 times [2022-07-19 10:54:15,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:54:15,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868427011] [2022-07-19 10:54:15,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:15,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:54:15,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:54:15,030 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:54:15,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-19 10:54:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:15,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:54:15,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:54:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 10:54:15,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:54:15,518 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 10:54:15,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:54:15,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868427011] [2022-07-19 10:54:15,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868427011] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:54:15,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:54:15,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-07-19 10:54:15,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234003612] [2022-07-19 10:54:15,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:54:15,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 10:54:15,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:54:15,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 10:54:15,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:54:15,520 INFO L87 Difference]: Start difference. First operand 96 states and 120 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:54:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:15,951 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2022-07-19 10:54:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:54:15,952 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 80 [2022-07-19 10:54:15,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:15,953 INFO L225 Difference]: With dead ends: 110 [2022-07-19 10:54:15,953 INFO L226 Difference]: Without dead ends: 98 [2022-07-19 10:54:15,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:54:15,954 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 111 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:15,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 727 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:54:15,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-19 10:54:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2022-07-19 10:54:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.161764705882353) internal successors, (79), 72 states have internal predecessors, (79), 15 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (21), 15 states have call predecessors, (21), 14 states have call successors, (21) [2022-07-19 10:54:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2022-07-19 10:54:15,973 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 80 [2022-07-19 10:54:15,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:15,973 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2022-07-19 10:54:15,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:54:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-07-19 10:54:15,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 10:54:15,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:15,974 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:15,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2022-07-19 10:54:16,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:54:16,178 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:16,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:16,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1014343994, now seen corresponding path program 2 times [2022-07-19 10:54:16,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:54:16,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207792318] [2022-07-19 10:54:16,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:54:16,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:54:16,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:54:16,180 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:54:16,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-19 10:54:16,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:54:16,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:54:16,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-19 10:54:16,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:54:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-19 10:54:17,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:54:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-19 10:54:23,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:54:23,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207792318] [2022-07-19 10:54:23,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207792318] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:54:23,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:54:23,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2022-07-19 10:54:23,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993296025] [2022-07-19 10:54:23,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:54:23,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-19 10:54:23,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:54:23,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-19 10:54:23,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1388, Unknown=0, NotChecked=0, Total=1482 [2022-07-19 10:54:23,146 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 39 states, 37 states have (on average 1.864864864864865) internal successors, (69), 35 states have internal predecessors, (69), 12 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-19 10:54:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:43,870 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-07-19 10:54:43,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-19 10:54:43,872 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.864864864864865) internal successors, (69), 35 states have internal predecessors, (69), 12 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) Word has length 84 [2022-07-19 10:54:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:43,873 INFO L225 Difference]: With dead ends: 102 [2022-07-19 10:54:43,873 INFO L226 Difference]: Without dead ends: 97 [2022-07-19 10:54:43,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=356, Invalid=3426, Unknown=0, NotChecked=0, Total=3782 [2022-07-19 10:54:43,874 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 111 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:43,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1188 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1191 Invalid, 0 Unknown, 3 Unchecked, 9.0s Time] [2022-07-19 10:54:43,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-19 10:54:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-07-19 10:54:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.161764705882353) internal successors, (79), 72 states have internal predecessors, (79), 15 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (21), 15 states have call predecessors, (21), 14 states have call successors, (21) [2022-07-19 10:54:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2022-07-19 10:54:43,888 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 84 [2022-07-19 10:54:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:43,889 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2022-07-19 10:54:43,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.864864864864865) internal successors, (69), 35 states have internal predecessors, (69), 12 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-19 10:54:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-07-19 10:54:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-19 10:54:43,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:43,890 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:43,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2022-07-19 10:54:44,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:54:44,100 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:44,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:44,100 INFO L85 PathProgramCache]: Analyzing trace with hash -411611933, now seen corresponding path program 2 times [2022-07-19 10:54:44,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:54:44,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357791001] [2022-07-19 10:54:44,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:54:44,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:54:44,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:54:44,102 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:54:44,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-19 10:54:44,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:54:44,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:54:44,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:54:44,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:54:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 10:54:44,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:54:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 10:54:44,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:54:44,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357791001] [2022-07-19 10:54:44,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357791001] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:54:44,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:54:44,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-07-19 10:54:44,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956636510] [2022-07-19 10:54:44,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:54:44,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 10:54:44,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:54:44,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 10:54:44,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:54:44,538 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:54:44,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:44,926 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2022-07-19 10:54:44,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:54:44,927 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 80 [2022-07-19 10:54:44,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:44,928 INFO L225 Difference]: With dead ends: 105 [2022-07-19 10:54:44,928 INFO L226 Difference]: Without dead ends: 93 [2022-07-19 10:54:44,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:54:44,929 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 148 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:44,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 532 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:54:44,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-19 10:54:44,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2022-07-19 10:54:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 69 states have internal predecessors, (76), 15 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (20), 15 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-19 10:54:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2022-07-19 10:54:44,948 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 80 [2022-07-19 10:54:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:44,949 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2022-07-19 10:54:44,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 8 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 10:54:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2022-07-19 10:54:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-19 10:54:44,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:44,950 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:44,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-07-19 10:54:45,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:54:45,160 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:45,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:45,161 INFO L85 PathProgramCache]: Analyzing trace with hash 727034220, now seen corresponding path program 1 times [2022-07-19 10:54:45,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:54:45,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991325952] [2022-07-19 10:54:45,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:45,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:54:45,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:54:45,162 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:54:45,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-19 10:54:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:45,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-19 10:54:45,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:54:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-19 10:54:46,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:54:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-19 10:54:51,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:54:51,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991325952] [2022-07-19 10:54:51,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991325952] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:54:51,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:54:51,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2022-07-19 10:54:51,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313712471] [2022-07-19 10:54:51,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:54:51,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-19 10:54:51,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:54:51,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-19 10:54:51,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1388, Unknown=0, NotChecked=0, Total=1482 [2022-07-19 10:54:51,792 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 39 states, 37 states have (on average 1.945945945945946) internal successors, (72), 35 states have internal predecessors, (72), 12 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-19 10:55:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:09,804 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2022-07-19 10:55:09,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-19 10:55:09,806 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.945945945945946) internal successors, (72), 35 states have internal predecessors, (72), 12 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) Word has length 86 [2022-07-19 10:55:09,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:09,807 INFO L225 Difference]: With dead ends: 100 [2022-07-19 10:55:09,807 INFO L226 Difference]: Without dead ends: 89 [2022-07-19 10:55:09,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=330, Invalid=3210, Unknown=0, NotChecked=0, Total=3540 [2022-07-19 10:55:09,808 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 111 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:55:09,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1229 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1056 Invalid, 0 Unknown, 46 Unchecked, 8.0s Time] [2022-07-19 10:55:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-19 10:55:09,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-07-19 10:55:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (18), 14 states have call predecessors, (18), 13 states have call successors, (18) [2022-07-19 10:55:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-07-19 10:55:09,823 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 86 [2022-07-19 10:55:09,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:09,823 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-07-19 10:55:09,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.945945945945946) internal successors, (72), 35 states have internal predecessors, (72), 12 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-19 10:55:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-07-19 10:55:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-19 10:55:09,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:09,824 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:55:09,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-07-19 10:55:10,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:55:10,035 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:10,037 INFO L85 PathProgramCache]: Analyzing trace with hash 608590994, now seen corresponding path program 1 times [2022-07-19 10:55:10,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:55:10,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463016915] [2022-07-19 10:55:10,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:10,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:55:10,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:55:10,039 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:55:10,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-07-19 10:55:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:10,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-19 10:55:10,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:55:12,041 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-19 10:55:12,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:55:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-19 10:55:19,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:55:19,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463016915] [2022-07-19 10:55:19,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463016915] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:55:19,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:55:19,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2022-07-19 10:55:19,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520737474] [2022-07-19 10:55:19,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:55:19,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-19 10:55:19,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:55:19,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-19 10:55:19,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1702, Unknown=0, NotChecked=0, Total=1806 [2022-07-19 10:55:19,494 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 43 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 39 states have internal predecessors, (73), 12 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-19 10:55:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:28,993 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-07-19 10:55:28,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 10:55:28,994 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 39 states have internal predecessors, (73), 12 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) Word has length 86 [2022-07-19 10:55:28,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:28,994 INFO L225 Difference]: With dead ends: 95 [2022-07-19 10:55:28,994 INFO L226 Difference]: Without dead ends: 90 [2022-07-19 10:55:28,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=224, Invalid=3198, Unknown=0, NotChecked=0, Total=3422 [2022-07-19 10:55:28,995 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 63 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-19 10:55:28,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1549 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1359 Invalid, 0 Unknown, 92 Unchecked, 5.8s Time] [2022-07-19 10:55:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-19 10:55:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-07-19 10:55:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 5 states have call predecessors, (14), 8 states have return successors, (18), 14 states have call predecessors, (18), 13 states have call successors, (18) [2022-07-19 10:55:29,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-07-19 10:55:29,007 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 86 [2022-07-19 10:55:29,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:29,007 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-07-19 10:55:29,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 39 states have internal predecessors, (73), 12 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-19 10:55:29,007 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-07-19 10:55:29,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-19 10:55:29,008 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:29,008 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:55:29,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-07-19 10:55:29,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:55:29,208 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:29,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash -215268500, now seen corresponding path program 2 times [2022-07-19 10:55:29,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:55:29,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678043447] [2022-07-19 10:55:29,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:55:29,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:55:29,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:55:29,210 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:55:29,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-07-19 10:55:29,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:55:29,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:55:29,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-19 10:55:29,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:55:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-19 10:55:31,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:55:36,981 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-19 10:55:36,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:55:36,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678043447] [2022-07-19 10:55:36,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678043447] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:55:36,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:55:36,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2022-07-19 10:55:36,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773807966] [2022-07-19 10:55:36,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:55:36,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-19 10:55:36,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:55:36,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-19 10:55:36,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1388, Unknown=0, NotChecked=0, Total=1482 [2022-07-19 10:55:36,983 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 39 states, 37 states have (on average 1.945945945945946) internal successors, (72), 35 states have internal predecessors, (72), 12 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15)