./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1251.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/float-newlib/float_req_bl_1251.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 de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:22:09,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:22:09,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:22:09,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:22:09,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:22:09,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:22:09,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:22:09,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:22:09,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:22:09,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:22:09,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:22:09,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:22:09,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:22:09,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:22:09,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:22:09,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:22:09,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:22:09,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:22:09,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:22:09,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:22:09,492 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:22:09,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:22:09,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:22:09,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:22:09,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:22:09,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:22:09,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:22:09,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:22:09,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:22:09,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:22:09,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:22:09,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:22:09,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:22:09,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:22:09,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:22:09,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:22:09,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:22:09,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:22:09,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:22:09,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:22:09,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:22:09,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:22:09,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:22:09,545 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:22:09,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:22:09,548 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:22:09,548 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:22:09,549 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:22:09,549 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:22:09,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:22:09,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:22:09,550 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:22:09,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:22:09,551 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:22:09,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:22:09,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:22:09,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:22:09,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:22:09,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:22:09,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:22:09,553 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:22:09,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:22:09,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:22:09,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:22:09,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:22:09,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:22:09,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:22:09,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:22:09,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:22:09,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:22:09,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:22:09,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:22:09,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:22:09,556 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:22:09,556 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:22:09,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:22:09,556 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 -> de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d [2022-07-19 14:22:09,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:22:09,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:22:09,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:22:09,791 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:22:09,792 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:22:09,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2022-07-19 14:22:09,850 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c7afb3e/a4584a0e24794d92bf544ddfe157b591/FLAG487edfc3a [2022-07-19 14:22:10,303 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:22:10,304 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2022-07-19 14:22:10,310 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c7afb3e/a4584a0e24794d92bf544ddfe157b591/FLAG487edfc3a [2022-07-19 14:22:10,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c7afb3e/a4584a0e24794d92bf544ddfe157b591 [2022-07-19 14:22:10,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:22:10,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:22:10,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:22:10,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:22:10,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:22:10,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:22:10" (1/1) ... [2022-07-19 14:22:10,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b09c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:10, skipping insertion in model container [2022-07-19 14:22:10,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:22:10" (1/1) ... [2022-07-19 14:22:10,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:22:10,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:22:10,527 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/float-newlib/float_req_bl_1251.c[1980,1993] [2022-07-19 14:22:10,531 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/float-newlib/float_req_bl_1251.c[2139,2152] [2022-07-19 14:22:10,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:22:10,539 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:22:10,572 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/float-newlib/float_req_bl_1251.c[1980,1993] [2022-07-19 14:22:10,581 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/float-newlib/float_req_bl_1251.c[2139,2152] [2022-07-19 14:22:10,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:22:10,593 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:22:10,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:10 WrapperNode [2022-07-19 14:22:10,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:22:10,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:22:10,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:22:10,601 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:22:10,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:10" (1/1) ... [2022-07-19 14:22:10,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:10" (1/1) ... [2022-07-19 14:22:10,631 INFO L137 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2022-07-19 14:22:10,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:22:10,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:22:10,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:22:10,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:22:10,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:10" (1/1) ... [2022-07-19 14:22:10,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:10" (1/1) ... [2022-07-19 14:22:10,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:10" (1/1) ... [2022-07-19 14:22:10,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:10" (1/1) ... [2022-07-19 14:22:10,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:10" (1/1) ... [2022-07-19 14:22:10,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:10" (1/1) ... [2022-07-19 14:22:10,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:10" (1/1) ... [2022-07-19 14:22:10,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:22:10,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:22:10,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:22:10,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:22:10,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:10" (1/1) ... [2022-07-19 14:22:10,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:22:10,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:22:10,700 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 14:22:10,714 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 14:22:10,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:22:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:22:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:22:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2022-07-19 14:22:10,737 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2022-07-19 14:22:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2022-07-19 14:22:10,737 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2022-07-19 14:22:10,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-19 14:22:10,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:22:10,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:22:10,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:22:10,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:22:10,809 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:22:10,811 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:22:10,981 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:22:10,987 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:22:10,987 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 14:22:10,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:22:10 BoogieIcfgContainer [2022-07-19 14:22:10,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:22:10,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:22:10,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:22:10,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:22:10,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:22:10" (1/3) ... [2022-07-19 14:22:10,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a763628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:22:10, skipping insertion in model container [2022-07-19 14:22:10,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:10" (2/3) ... [2022-07-19 14:22:10,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a763628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:22:10, skipping insertion in model container [2022-07-19 14:22:10,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:22:10" (3/3) ... [2022-07-19 14:22:10,997 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2022-07-19 14:22:11,010 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:22:11,011 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 14:22:11,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:22:11,087 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@7a5aa7fb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@25d95d3d [2022-07-19 14:22:11,093 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-19 14:22:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 44 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 14:22:11,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 14:22:11,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:11,105 INFO L195 NwaCegarLoop]: trace histogram [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 14:22:11,106 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:11,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:11,111 INFO L85 PathProgramCache]: Analyzing trace with hash -625969503, now seen corresponding path program 1 times [2022-07-19 14:22:11,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:11,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71014537] [2022-07-19 14:22:11,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:11,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:11,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:22:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:11,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 14:22:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:11,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:22:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:22:11,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:11,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71014537] [2022-07-19 14:22:11,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71014537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:11,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:11,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:22:11,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554867579] [2022-07-19 14:22:11,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:11,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:22:11,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:11,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:22:11,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:22:11,460 INFO L87 Difference]: Start difference. First operand has 57 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 44 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:22:11,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:11,639 INFO L93 Difference]: Finished difference Result 108 states and 156 transitions. [2022-07-19 14:22:11,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:22:11,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-19 14:22:11,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:11,654 INFO L225 Difference]: With dead ends: 108 [2022-07-19 14:22:11,654 INFO L226 Difference]: Without dead ends: 62 [2022-07-19 14:22:11,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:22:11,664 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 19 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:11,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 245 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:22:11,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-19 14:22:11,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-07-19 14:22:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 14:22:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2022-07-19 14:22:11,708 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 28 [2022-07-19 14:22:11,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:11,708 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2022-07-19 14:22:11,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:22:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2022-07-19 14:22:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 14:22:11,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:11,711 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 14:22:11,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:22:11,711 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:11,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash 716059, now seen corresponding path program 1 times [2022-07-19 14:22:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:11,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055370895] [2022-07-19 14:22:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:11,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:11,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:22:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:11,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 14:22:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:11,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 14:22:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:11,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 14:22:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 14:22:11,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:11,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055370895] [2022-07-19 14:22:11,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055370895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:11,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:11,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:22:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871300460] [2022-07-19 14:22:11,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:11,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:22:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:11,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:22:11,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:22:11,843 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:22:11,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:11,915 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2022-07-19 14:22:11,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:22:11,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-07-19 14:22:11,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:11,918 INFO L225 Difference]: With dead ends: 79 [2022-07-19 14:22:11,919 INFO L226 Difference]: Without dead ends: 59 [2022-07-19 14:22:11,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:22:11,921 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:11,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 225 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:22:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-19 14:22:11,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-07-19 14:22:11,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-19 14:22:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2022-07-19 14:22:11,931 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 34 [2022-07-19 14:22:11,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:11,946 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2022-07-19 14:22:11,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:22:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2022-07-19 14:22:11,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 14:22:11,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:11,948 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 14:22:11,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:22:11,948 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:11,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash 840977401, now seen corresponding path program 1 times [2022-07-19 14:22:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:11,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40450308] [2022-07-19 14:22:11,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:11,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:11,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:22:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:11,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 14:22:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:12,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 14:22:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:12,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 14:22:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:12,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 14:22:12,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:12,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40450308] [2022-07-19 14:22:12,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40450308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:12,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:12,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:22:12,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656587986] [2022-07-19 14:22:12,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:12,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:22:12,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:12,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:22:12,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:22:12,038 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:22:12,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:12,099 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2022-07-19 14:22:12,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:22:12,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-07-19 14:22:12,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:12,101 INFO L225 Difference]: With dead ends: 83 [2022-07-19 14:22:12,101 INFO L226 Difference]: Without dead ends: 63 [2022-07-19 14:22:12,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:22:12,103 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:12,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 241 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:22:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-19 14:22:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2022-07-19 14:22:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-19 14:22:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2022-07-19 14:22:12,111 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 35 [2022-07-19 14:22:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:12,112 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2022-07-19 14:22:12,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:22:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2022-07-19 14:22:12,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 14:22:12,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:12,114 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 14:22:12,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:22:12,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:12,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:12,115 INFO L85 PathProgramCache]: Analyzing trace with hash -902959273, now seen corresponding path program 1 times [2022-07-19 14:22:12,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:12,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514418214] [2022-07-19 14:22:12,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:12,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:12,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:22:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:12,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 14:22:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:12,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 14:22:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:12,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 14:22:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 14:22:12,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:12,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514418214] [2022-07-19 14:22:12,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514418214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:12,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:12,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:22:12,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094798347] [2022-07-19 14:22:12,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:12,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:22:12,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:12,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:22:12,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:22:12,204 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:22:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:12,262 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2022-07-19 14:22:12,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:22:12,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2022-07-19 14:22:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:12,264 INFO L225 Difference]: With dead ends: 83 [2022-07-19 14:22:12,264 INFO L226 Difference]: Without dead ends: 63 [2022-07-19 14:22:12,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:22:12,266 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:12,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 241 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-19 14:22:12,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2022-07-19 14:22:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-19 14:22:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2022-07-19 14:22:12,274 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 36 [2022-07-19 14:22:12,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:12,274 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2022-07-19 14:22:12,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:22:12,275 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2022-07-19 14:22:12,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:22:12,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:12,276 INFO L195 NwaCegarLoop]: trace histogram [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 14:22:12,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 14:22:12,277 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:12,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:12,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1658214444, now seen corresponding path program 1 times [2022-07-19 14:22:12,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:12,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842869388] [2022-07-19 14:22:12,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:12,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:12,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 14:22:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:12,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 14:22:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:12,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 14:22:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:12,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 14:22:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 14:22:12,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:12,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842869388] [2022-07-19 14:22:12,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842869388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:12,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:12,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:22:12,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858426874] [2022-07-19 14:22:12,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:12,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:22:12,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:12,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:22:12,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:12,357 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 14:22:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:12,397 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-07-19 14:22:12,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:22:12,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-07-19 14:22:12,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:12,399 INFO L225 Difference]: With dead ends: 62 [2022-07-19 14:22:12,399 INFO L226 Difference]: Without dead ends: 60 [2022-07-19 14:22:12,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:12,401 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:12,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 172 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-19 14:22:12,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-07-19 14:22:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-19 14:22:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2022-07-19 14:22:12,407 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 37 [2022-07-19 14:22:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:12,408 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2022-07-19 14:22:12,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 14:22:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2022-07-19 14:22:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 14:22:12,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:12,409 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:22:12,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 14:22:12,410 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:12,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:12,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1826594765, now seen corresponding path program 1 times [2022-07-19 14:22:12,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:12,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894172194] [2022-07-19 14:22:12,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:12,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:22:12,435 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 14:22:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:22:12,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 14:22:12,484 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 14:22:12,485 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-19 14:22:12,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-19 14:22:12,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 14:22:12,495 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-19 14:22:12,498 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:22:12,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:22:12 BoogieIcfgContainer [2022-07-19 14:22:12,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:22:12,526 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:22:12,526 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:22:12,526 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:22:12,526 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:22:10" (3/4) ... [2022-07-19 14:22:12,529 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 14:22:12,529 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:22:12,530 INFO L158 Benchmark]: Toolchain (without parser) took 2200.06ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 45.7MB in the beginning and 58.0MB in the end (delta: -12.3MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2022-07-19 14:22:12,530 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 81.8MB. Free memory was 62.4MB in the beginning and 62.3MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:22:12,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.55ms. Allocated memory is still 81.8MB. Free memory was 45.5MB in the beginning and 57.8MB in the end (delta: -12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 14:22:12,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.55ms. Allocated memory is still 81.8MB. Free memory was 57.8MB in the beginning and 56.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:22:12,531 INFO L158 Benchmark]: Boogie Preprocessor took 27.33ms. Allocated memory is still 81.8MB. Free memory was 56.0MB in the beginning and 54.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:22:12,532 INFO L158 Benchmark]: RCFGBuilder took 328.79ms. Allocated memory is still 81.8MB. Free memory was 54.7MB in the beginning and 41.3MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 14:22:12,532 INFO L158 Benchmark]: TraceAbstraction took 1534.64ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 40.7MB in the beginning and 58.0MB in the end (delta: -17.3MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. [2022-07-19 14:22:12,532 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 98.6MB. Free memory is still 58.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:22:12,534 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.24ms. Allocated memory is still 81.8MB. Free memory was 62.4MB in the beginning and 62.3MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.55ms. Allocated memory is still 81.8MB. Free memory was 45.5MB in the beginning and 57.8MB in the end (delta: -12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.55ms. Allocated memory is still 81.8MB. Free memory was 57.8MB in the beginning and 56.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.33ms. Allocated memory is still 81.8MB. Free memory was 56.0MB in the beginning and 54.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 328.79ms. Allocated memory is still 81.8MB. Free memory was 54.7MB in the beginning and 41.3MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1534.64ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 40.7MB in the beginning and 58.0MB in the end (delta: -17.3MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 98.6MB. Free memory is still 58.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: 76]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 75. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L69] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578691] [L57] return x != x; VAL [\old(x)=4286578691, \result=1, x=4286578691] [L69] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, x=4286578691] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=4286578691] [L69] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578690] [L57] return x != x; VAL [\old(x)=4286578690, \result=0, x=4286578690] [L69] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578691, y=4286578690] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578691, y=4286578690] [L69-L70] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))=1, isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578691, y=4286578690] [L69-L70] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L72] CALL, EXPR fmax_float(x, y) [L46] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578691] [L23] __uint32_t w; VAL [\old(x)=4286578691, x=4286578691] [L26] ieee_float_shape_type gf_u; [L27] gf_u.value = (x) [L28] EXPR gf_u.word [L28] (w) = gf_u.word [L31] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578691, w=4286578689, x=4286578691] [L33-L34] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578691, w=4286578689, x=4286578691] [L36-L37] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578691, w=4286578689, x=4286578691] [L39] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L42] return 0; VAL [\old(x)=4286578691, \result=0, w=4286578689, x=4286578691] [L46] RET, EXPR __fpclassify_float(x) VAL [\old(x)=4286578691, \old(y)=4286578690, __fpclassify_float(x)=0, x=4286578691, y=4286578690] [L46] COND TRUE __fpclassify_float(x) == 0 [L47] return y; VAL [\old(x)=4286578691, \old(y)=4286578690, \result=4286578690, x=4286578691, y=4286578690] [L72] RET, EXPR fmax_float(x, y) [L72] float res = fmax_float(x, y); [L75] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578691] [L57] return x != x; VAL [\old(x)=4286578691, \result=1, x=4286578691] [L75] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, res=4286578690, x=4286578691, y=4286578690] [L75] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, res=4286578690, x=4286578691, y=4286578690] [L75] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578690] [L57] return x != x; VAL [\old(x)=4286578690, \result=0, x=4286578690] [L75] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=4286578690, x=4286578691, y=4286578690] [L75] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=4286578690, x=4286578691, y=4286578690] [L75] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L76] reach_error() VAL [res=4286578690, x=4286578691, y=4286578690] - UnprovableResult [Line: 82]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 1124 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 759 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 365 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=5, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 39/39 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 14:22:12,571 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/float-newlib/float_req_bl_1251.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 de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:22:14,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:22:14,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:22:14,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:22:14,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:22:14,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:22:14,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:22:14,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:22:14,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:22:14,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:22:14,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:22:14,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:22:14,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:22:14,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:22:14,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:22:14,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:22:14,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:22:14,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:22:14,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:22:14,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:22:14,544 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:22:14,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:22:14,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:22:14,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:22:14,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:22:14,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:22:14,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:22:14,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:22:14,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:22:14,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:22:14,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:22:14,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:22:14,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:22:14,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:22:14,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:22:14,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:22:14,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:22:14,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:22:14,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:22:14,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:22:14,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:22:14,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:22:14,569 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 14:22:14,610 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:22:14,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:22:14,611 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:22:14,611 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:22:14,612 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:22:14,612 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:22:14,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:22:14,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:22:14,613 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:22:14,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:22:14,614 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:22:14,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:22:14,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:22:14,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:22:14,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:22:14,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:22:14,615 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 14:22:14,615 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 14:22:14,615 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 14:22:14,615 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:22:14,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:22:14,616 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:22:14,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:22:14,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:22:14,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:22:14,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:22:14,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:22:14,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:22:14,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:22:14,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:22:14,618 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 14:22:14,618 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 14:22:14,618 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:22:14,618 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:22:14,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:22:14,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 14:22:14,619 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 -> de540e539c3db6027c1fdb04fcc6cae02aafb8aa58950d31054b2b0b8391af6d [2022-07-19 14:22:14,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:22:14,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:22:14,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:22:14,937 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:22:14,937 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:22:14,939 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2022-07-19 14:22:14,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26abca7f5/1748a5942d28460791c1b1ad395b6a10/FLAGd443c8b85 [2022-07-19 14:22:15,443 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:22:15,446 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2022-07-19 14:22:15,452 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26abca7f5/1748a5942d28460791c1b1ad395b6a10/FLAGd443c8b85 [2022-07-19 14:22:15,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26abca7f5/1748a5942d28460791c1b1ad395b6a10 [2022-07-19 14:22:15,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:22:15,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:22:15,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:22:15,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:22:15,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:22:15,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:22:15" (1/1) ... [2022-07-19 14:22:15,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16de4465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:15, skipping insertion in model container [2022-07-19 14:22:15,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:22:15" (1/1) ... [2022-07-19 14:22:15,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:22:15,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:22:16,017 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/float-newlib/float_req_bl_1251.c[1980,1993] [2022-07-19 14:22:16,021 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/float-newlib/float_req_bl_1251.c[2139,2152] [2022-07-19 14:22:16,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:22:16,034 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:22:16,077 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/float-newlib/float_req_bl_1251.c[1980,1993] [2022-07-19 14:22:16,078 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/float-newlib/float_req_bl_1251.c[2139,2152] [2022-07-19 14:22:16,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:22:16,092 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:22:16,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:16 WrapperNode [2022-07-19 14:22:16,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:22:16,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:22:16,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:22:16,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:22:16,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:16" (1/1) ... [2022-07-19 14:22:16,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:16" (1/1) ... [2022-07-19 14:22:16,123 INFO L137 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2022-07-19 14:22:16,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:22:16,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:22:16,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:22:16,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:22:16,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:16" (1/1) ... [2022-07-19 14:22:16,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:16" (1/1) ... [2022-07-19 14:22:16,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:16" (1/1) ... [2022-07-19 14:22:16,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:16" (1/1) ... [2022-07-19 14:22:16,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:16" (1/1) ... [2022-07-19 14:22:16,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:16" (1/1) ... [2022-07-19 14:22:16,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:16" (1/1) ... [2022-07-19 14:22:16,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:22:16,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:22:16,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:22:16,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:22:16,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:16" (1/1) ... [2022-07-19 14:22:16,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:22:16,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:22:16,185 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 14:22:16,188 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 14:22:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:22:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 14:22:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:22:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2022-07-19 14:22:16,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2022-07-19 14:22:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2022-07-19 14:22:16,222 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2022-07-19 14:22:16,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 14:22:16,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:22:16,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:22:16,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-07-19 14:22:16,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:22:16,284 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:22:16,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:22:16,502 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:22:16,509 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:22:16,510 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 14:22:16,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:22:16 BoogieIcfgContainer [2022-07-19 14:22:16,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:22:16,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:22:16,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:22:16,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:22:16,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:22:15" (1/3) ... [2022-07-19 14:22:16,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0b9589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:22:16, skipping insertion in model container [2022-07-19 14:22:16,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:16" (2/3) ... [2022-07-19 14:22:16,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0b9589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:22:16, skipping insertion in model container [2022-07-19 14:22:16,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:22:16" (3/3) ... [2022-07-19 14:22:16,526 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2022-07-19 14:22:16,538 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:22:16,538 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 14:22:16,582 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:22:16,588 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@21c9e99a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@523151ff [2022-07-19 14:22:16,588 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-19 14:22:16,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 42 states have internal predecessors, (59), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 14:22:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 14:22:16,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:16,600 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 14:22:16,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:16,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:16,606 INFO L85 PathProgramCache]: Analyzing trace with hash 956195031, now seen corresponding path program 1 times [2022-07-19 14:22:16,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:16,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399063682] [2022-07-19 14:22:16,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:16,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:16,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:16,623 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 14:22:16,673 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 14:22:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:16,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 14:22:16,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:16,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:16,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:16,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399063682] [2022-07-19 14:22:16,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399063682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:16,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:16,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:22:16,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261058975] [2022-07-19 14:22:16,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:16,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:22:16,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:16,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:22:16,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:22:16,828 INFO L87 Difference]: Start difference. First operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 42 states have internal predecessors, (59), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:22:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:16,862 INFO L93 Difference]: Finished difference Result 93 states and 134 transitions. [2022-07-19 14:22:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:22:16,864 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-07-19 14:22:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:16,870 INFO L225 Difference]: With dead ends: 93 [2022-07-19 14:22:16,870 INFO L226 Difference]: Without dead ends: 51 [2022-07-19 14:22:16,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:22:16,876 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:16,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:16,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-19 14:22:16,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-19 14:22:16,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 14:22:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-07-19 14:22:16,917 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 27 [2022-07-19 14:22:16,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:16,919 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-07-19 14:22:16,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:22:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-07-19 14:22:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 14:22:16,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:16,921 INFO L195 NwaCegarLoop]: trace histogram [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 14:22:16,934 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 14:22:17,132 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 14:22:17,132 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:17,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:17,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1128254016, now seen corresponding path program 1 times [2022-07-19 14:22:17,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:17,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095648852] [2022-07-19 14:22:17,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:17,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:17,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:17,141 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 14:22:17,143 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 14:22:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:17,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:22:17,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:17,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:17,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:17,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095648852] [2022-07-19 14:22:17,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095648852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:17,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:17,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:22:17,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865996415] [2022-07-19 14:22:17,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:17,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:22:17,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:17,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:22:17,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:17,279 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:22:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:17,334 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2022-07-19 14:22:17,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:22:17,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-19 14:22:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:17,337 INFO L225 Difference]: With dead ends: 96 [2022-07-19 14:22:17,338 INFO L226 Difference]: Without dead ends: 60 [2022-07-19 14:22:17,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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 14:22:17,339 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 16 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:17,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 192 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-19 14:22:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2022-07-19 14:22:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-19 14:22:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2022-07-19 14:22:17,352 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 72 transitions. Word has length 28 [2022-07-19 14:22:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:17,352 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 72 transitions. [2022-07-19 14:22:17,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:22:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2022-07-19 14:22:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-19 14:22:17,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:17,354 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 14:22:17,366 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 14:22:17,562 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 14:22:17,562 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:17,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash 987158491, now seen corresponding path program 1 times [2022-07-19 14:22:17,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:17,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146825853] [2022-07-19 14:22:17,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:17,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:17,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:17,565 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 14:22:17,566 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 14:22:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:17,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:22:17,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:22:17,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:17,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:17,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146825853] [2022-07-19 14:22:17,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146825853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:17,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:17,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:22:17,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601393999] [2022-07-19 14:22:17,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:17,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:22:17,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:17,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:22:17,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:17,666 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:22:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:17,690 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2022-07-19 14:22:17,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:22:17,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-07-19 14:22:17,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:17,693 INFO L225 Difference]: With dead ends: 76 [2022-07-19 14:22:17,693 INFO L226 Difference]: Without dead ends: 56 [2022-07-19 14:22:17,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:17,695 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:17,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:17,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-19 14:22:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-19 14:22:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-19 14:22:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2022-07-19 14:22:17,703 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 33 [2022-07-19 14:22:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:17,704 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2022-07-19 14:22:17,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:22:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-07-19 14:22:17,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 14:22:17,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:17,705 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 14:22:17,718 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 14:22:17,915 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 14:22:17,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:17,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:17,917 INFO L85 PathProgramCache]: Analyzing trace with hash 871427583, now seen corresponding path program 1 times [2022-07-19 14:22:17,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:17,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505883392] [2022-07-19 14:22:17,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:17,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:17,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:17,919 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 14:22:17,921 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 14:22:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:17,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:22:17,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:22:17,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:17,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:17,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505883392] [2022-07-19 14:22:17,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505883392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:17,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:17,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:22:17,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299247967] [2022-07-19 14:22:17,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:17,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:22:17,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:17,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:22:17,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:17,999 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:22:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:18,044 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2022-07-19 14:22:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:22:18,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-07-19 14:22:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:18,047 INFO L225 Difference]: With dead ends: 79 [2022-07-19 14:22:18,049 INFO L226 Difference]: Without dead ends: 59 [2022-07-19 14:22:18,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:18,051 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:18,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:18,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-19 14:22:18,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-07-19 14:22:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-19 14:22:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2022-07-19 14:22:18,070 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 34 [2022-07-19 14:22:18,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:18,071 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2022-07-19 14:22:18,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:22:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-07-19 14:22:18,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 14:22:18,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:18,075 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 14:22:18,088 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 14:22:18,285 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 14:22:18,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:18,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash 405124703, now seen corresponding path program 1 times [2022-07-19 14:22:18,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:18,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598497413] [2022-07-19 14:22:18,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:18,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:18,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:18,288 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 14:22:18,290 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 14:22:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:18,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:22:18,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:22:18,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:18,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:18,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598497413] [2022-07-19 14:22:18,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598497413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:18,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:18,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:22:18,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492837109] [2022-07-19 14:22:18,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:18,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:22:18,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:18,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:22:18,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:18,365 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:22:18,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:18,394 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2022-07-19 14:22:18,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:22:18,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-07-19 14:22:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:18,396 INFO L225 Difference]: With dead ends: 79 [2022-07-19 14:22:18,396 INFO L226 Difference]: Without dead ends: 59 [2022-07-19 14:22:18,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:18,397 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:18,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-19 14:22:18,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-07-19 14:22:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-19 14:22:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2022-07-19 14:22:18,404 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 35 [2022-07-19 14:22:18,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:18,404 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2022-07-19 14:22:18,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:22:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-07-19 14:22:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 14:22:18,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:18,406 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 14:22:18,418 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 14:22:18,615 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 14:22:18,616 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:18,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:18,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1955992579, now seen corresponding path program 1 times [2022-07-19 14:22:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:18,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119942916] [2022-07-19 14:22:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:18,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:18,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:18,618 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 14:22:18,619 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 14:22:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:18,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:22:18,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:22:18,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:18,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:18,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119942916] [2022-07-19 14:22:18,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119942916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:18,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:18,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:22:18,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642041819] [2022-07-19 14:22:18,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:18,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:22:18,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:18,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:22:18,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:18,708 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:22:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:18,745 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2022-07-19 14:22:18,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:22:18,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2022-07-19 14:22:18,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:18,748 INFO L225 Difference]: With dead ends: 79 [2022-07-19 14:22:18,748 INFO L226 Difference]: Without dead ends: 59 [2022-07-19 14:22:18,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:18,750 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:18,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:18,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-19 14:22:18,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-07-19 14:22:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-07-19 14:22:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2022-07-19 14:22:18,762 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 36 [2022-07-19 14:22:18,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:18,762 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2022-07-19 14:22:18,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 14:22:18,764 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2022-07-19 14:22:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 14:22:18,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:18,768 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 14:22:18,783 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 14:22:18,980 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 14:22:18,981 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:18,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:18,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1662589572, now seen corresponding path program 1 times [2022-07-19 14:22:18,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:18,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883335875] [2022-07-19 14:22:18,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:18,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:18,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:18,983 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 14:22:18,984 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 14:22:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:19,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 14:22:19,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:22:19,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:19,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:22:19,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:19,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883335875] [2022-07-19 14:22:19,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883335875] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:22:19,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:22:19,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2022-07-19 14:22:19,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993743391] [2022-07-19 14:22:19,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:19,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 14:22:19,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:19,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 14:22:19,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-19 14:22:19,589 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 14:22:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:20,108 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2022-07-19 14:22:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 14:22:20,109 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2022-07-19 14:22:20,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:20,110 INFO L225 Difference]: With dead ends: 102 [2022-07-19 14:22:20,110 INFO L226 Difference]: Without dead ends: 88 [2022-07-19 14:22:20,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-07-19 14:22:20,111 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 103 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:20,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 639 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 14:22:20,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-19 14:22:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74. [2022-07-19 14:22:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 15 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (19), 17 states have call predecessors, (19), 15 states have call successors, (19) [2022-07-19 14:22:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2022-07-19 14:22:20,120 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 36 [2022-07-19 14:22:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:20,120 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2022-07-19 14:22:20,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 14:22:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2022-07-19 14:22:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 14:22:20,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:20,122 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 14:22:20,137 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 14:22:20,332 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 14:22:20,333 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:20,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2045835875, now seen corresponding path program 1 times [2022-07-19 14:22:20,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:20,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546133231] [2022-07-19 14:22:20,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:20,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:20,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:20,335 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 14:22:20,337 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 14:22:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:20,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 14:22:20,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 14:22:20,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:20,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:20,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546133231] [2022-07-19 14:22:20,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546133231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:20,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:20,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 14:22:20,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294440647] [2022-07-19 14:22:20,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:20,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 14:22:20,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:20,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 14:22:20,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:22:20,532 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 14:22:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:20,862 INFO L93 Difference]: Finished difference Result 127 states and 174 transitions. [2022-07-19 14:22:20,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:22:20,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-07-19 14:22:20,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:20,864 INFO L225 Difference]: With dead ends: 127 [2022-07-19 14:22:20,864 INFO L226 Difference]: Without dead ends: 87 [2022-07-19 14:22:20,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-07-19 14:22:20,865 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 56 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:20,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 498 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:22:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-19 14:22:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2022-07-19 14:22:20,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 15 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (19), 17 states have call predecessors, (19), 15 states have call successors, (19) [2022-07-19 14:22:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2022-07-19 14:22:20,872 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 38 [2022-07-19 14:22:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:20,873 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2022-07-19 14:22:20,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 14:22:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2022-07-19 14:22:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 14:22:20,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:20,874 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:22:20,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-19 14:22:21,082 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 14:22:21,083 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:21,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash -490349503, now seen corresponding path program 1 times [2022-07-19 14:22:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:21,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825456938] [2022-07-19 14:22:21,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:21,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:21,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:21,085 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 14:22:21,086 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 14:22:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:21,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 14:22:21,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 14:22:21,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 14:22:21,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:21,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825456938] [2022-07-19 14:22:21,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825456938] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:22:21,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:22:21,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-07-19 14:22:21,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674103616] [2022-07-19 14:22:21,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:21,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 14:22:21,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:21,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 14:22:21,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-07-19 14:22:21,750 INFO L87 Difference]: Start difference. First operand 74 states and 104 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-19 14:22:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:22,513 INFO L93 Difference]: Finished difference Result 117 states and 162 transitions. [2022-07-19 14:22:22,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 14:22:22,513 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 41 [2022-07-19 14:22:22,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:22,514 INFO L225 Difference]: With dead ends: 117 [2022-07-19 14:22:22,515 INFO L226 Difference]: Without dead ends: 115 [2022-07-19 14:22:22,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2022-07-19 14:22:22,516 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 149 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:22,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 463 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 14:22:22,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-19 14:22:22,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 84. [2022-07-19 14:22:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.278688524590164) internal successors, (78), 61 states have internal predecessors, (78), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-19 14:22:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2022-07-19 14:22:22,524 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 41 [2022-07-19 14:22:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:22,525 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2022-07-19 14:22:22,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-19 14:22:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2022-07-19 14:22:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 14:22:22,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:22,526 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:22:22,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-19 14:22:22,735 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 14:22:22,736 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:22,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:22,736 INFO L85 PathProgramCache]: Analyzing trace with hash 38675638, now seen corresponding path program 1 times [2022-07-19 14:22:22,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:22,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394735897] [2022-07-19 14:22:22,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:22,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:22,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:22,738 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 14:22:22,739 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 14:22:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:22,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 14:22:22,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 14:22:22,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:22,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:22,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394735897] [2022-07-19 14:22:22,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394735897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:22,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:22,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:22:22,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727576433] [2022-07-19 14:22:22,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:22,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:22:22,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:22,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:22:22,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:22:22,810 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 14:22:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:22,821 INFO L93 Difference]: Finished difference Result 87 states and 122 transitions. [2022-07-19 14:22:22,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:22:22,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2022-07-19 14:22:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:22,824 INFO L225 Difference]: With dead ends: 87 [2022-07-19 14:22:22,824 INFO L226 Difference]: Without dead ends: 85 [2022-07-19 14:22:22,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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 14:22:22,825 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 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 14:22:22,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-19 14:22:22,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-07-19 14:22:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.278688524590164) internal successors, (78), 61 states have internal predecessors, (78), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (23), 20 states have call predecessors, (23), 18 states have call successors, (23) [2022-07-19 14:22:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2022-07-19 14:22:22,838 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 43 [2022-07-19 14:22:22,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:22,839 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2022-07-19 14:22:22,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 14:22:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2022-07-19 14:22:22,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 14:22:22,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:22,841 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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 14:22:22,856 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 14:22:23,051 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 14:22:23,052 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:23,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:23,052 INFO L85 PathProgramCache]: Analyzing trace with hash 972082008, now seen corresponding path program 1 times [2022-07-19 14:22:23,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:23,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87151876] [2022-07-19 14:22:23,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:23,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:23,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:23,054 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 14:22:23,054 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 14:22:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:23,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:22:23,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 14:22:23,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:23,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:23,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87151876] [2022-07-19 14:22:23,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87151876] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:23,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:23,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:22:23,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221021104] [2022-07-19 14:22:23,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:23,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:22:23,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:23,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:22:23,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:23,141 INFO L87 Difference]: Start difference. First operand 84 states and 119 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, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 14:22:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:23,169 INFO L93 Difference]: Finished difference Result 113 states and 159 transitions. [2022-07-19 14:22:23,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:22:23,170 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, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2022-07-19 14:22:23,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:23,173 INFO L225 Difference]: With dead ends: 113 [2022-07-19 14:22:23,173 INFO L226 Difference]: Without dead ends: 88 [2022-07-19 14:22:23,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:23,174 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:23,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:23,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-19 14:22:23,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-19 14:22:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.265625) internal successors, (81), 63 states have internal predecessors, (81), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (28), 22 states have call predecessors, (28), 18 states have call successors, (28) [2022-07-19 14:22:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2022-07-19 14:22:23,184 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 46 [2022-07-19 14:22:23,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:23,184 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2022-07-19 14:22:23,184 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, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 14:22:23,184 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2022-07-19 14:22:23,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 14:22:23,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:23,185 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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 14:22:23,202 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 14:22:23,396 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 14:22:23,396 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:23,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:23,397 INFO L85 PathProgramCache]: Analyzing trace with hash 411048800, now seen corresponding path program 1 times [2022-07-19 14:22:23,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:23,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366176253] [2022-07-19 14:22:23,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:23,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:23,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:23,399 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 14:22:23,401 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 14:22:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:23,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:22:23,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 14:22:23,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:23,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:23,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366176253] [2022-07-19 14:22:23,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366176253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:23,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:23,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:22:23,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910664850] [2022-07-19 14:22:23,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:23,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:22:23,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:23,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:22:23,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:23,482 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 14:22:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:23,510 INFO L93 Difference]: Finished difference Result 117 states and 167 transitions. [2022-07-19 14:22:23,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:22:23,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2022-07-19 14:22:23,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:23,512 INFO L225 Difference]: With dead ends: 117 [2022-07-19 14:22:23,512 INFO L226 Difference]: Without dead ends: 92 [2022-07-19 14:22:23,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:23,513 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:23,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-19 14:22:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2022-07-19 14:22:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.265625) internal successors, (81), 63 states have internal predecessors, (81), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (28), 22 states have call predecessors, (28), 18 states have call successors, (28) [2022-07-19 14:22:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2022-07-19 14:22:23,519 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 47 [2022-07-19 14:22:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:23,520 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2022-07-19 14:22:23,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 14:22:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2022-07-19 14:22:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 14:22:23,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:23,521 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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 14:22:23,534 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 14:22:23,731 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 14:22:23,732 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:23,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:23,732 INFO L85 PathProgramCache]: Analyzing trace with hash -877982242, now seen corresponding path program 1 times [2022-07-19 14:22:23,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:23,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682090269] [2022-07-19 14:22:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:23,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:23,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:23,734 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 14:22:23,734 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 14:22:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:23,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 14:22:23,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 14:22:23,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:24,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:24,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682090269] [2022-07-19 14:22:24,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682090269] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:22:24,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1955085026] [2022-07-19 14:22:24,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:24,005 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-19 14:22:24,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-19 14:22:24,007 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-19 14:22:24,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-07-19 14:22:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:24,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 14:22:24,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:24,303 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 14:22:24,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:24,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1955085026] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:22:24,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:22:24,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-07-19 14:22:24,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800079765] [2022-07-19 14:22:24,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:24,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:22:24,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:24,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:22:24,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:22:24,328 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 14:22:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:24,631 INFO L93 Difference]: Finished difference Result 123 states and 168 transitions. [2022-07-19 14:22:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:22:24,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-07-19 14:22:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:24,632 INFO L225 Difference]: With dead ends: 123 [2022-07-19 14:22:24,633 INFO L226 Difference]: Without dead ends: 102 [2022-07-19 14:22:24,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-19 14:22:24,634 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 68 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:24,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 309 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:22:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-19 14:22:24,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2022-07-19 14:22:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.25) internal successors, (80), 63 states have internal predecessors, (80), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (28), 22 states have call predecessors, (28), 18 states have call successors, (28) [2022-07-19 14:22:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2022-07-19 14:22:24,639 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 48 [2022-07-19 14:22:24,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:24,640 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2022-07-19 14:22:24,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 14:22:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2022-07-19 14:22:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 14:22:24,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:24,641 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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 14:22:24,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2022-07-19 14:22:24,850 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 14:22:25,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:22:25,042 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:25,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:25,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1899050596, now seen corresponding path program 1 times [2022-07-19 14:22:25,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:25,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162009048] [2022-07-19 14:22:25,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:25,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:25,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:25,044 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 14:22:25,048 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 14:22:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:25,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 14:22:25,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 14:22:25,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:25,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:25,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162009048] [2022-07-19 14:22:25,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162009048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:25,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:25,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 14:22:25,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572205740] [2022-07-19 14:22:25,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:25,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 14:22:25,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:25,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 14:22:25,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:22:25,476 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 14:22:26,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:26,024 INFO L93 Difference]: Finished difference Result 137 states and 191 transitions. [2022-07-19 14:22:26,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:22:26,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2022-07-19 14:22:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:26,027 INFO L225 Difference]: With dead ends: 137 [2022-07-19 14:22:26,027 INFO L226 Difference]: Without dead ends: 135 [2022-07-19 14:22:26,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-07-19 14:22:26,028 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 91 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:26,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 513 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 14:22:26,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-19 14:22:26,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2022-07-19 14:22:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 72 states have internal predecessors, (92), 19 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (34), 25 states have call predecessors, (34), 19 states have call successors, (34) [2022-07-19 14:22:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2022-07-19 14:22:26,034 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 48 [2022-07-19 14:22:26,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:26,035 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2022-07-19 14:22:26,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 14:22:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2022-07-19 14:22:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 14:22:26,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:26,036 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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 14:22:26,049 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 14:22:26,246 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 14:22:26,247 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:26,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:26,247 INFO L85 PathProgramCache]: Analyzing trace with hash 505566420, now seen corresponding path program 1 times [2022-07-19 14:22:26,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:26,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011041307] [2022-07-19 14:22:26,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:26,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:26,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:26,249 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 14:22:26,251 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 14:22:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:26,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:22:26,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:26,329 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 14:22:26,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:26,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:26,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011041307] [2022-07-19 14:22:26,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011041307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:26,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:26,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:22:26,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461479433] [2022-07-19 14:22:26,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:26,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:22:26,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:26,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:22:26,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:26,331 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 14:22:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:26,445 INFO L93 Difference]: Finished difference Result 129 states and 185 transitions. [2022-07-19 14:22:26,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:22:26,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-07-19 14:22:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:26,446 INFO L225 Difference]: With dead ends: 129 [2022-07-19 14:22:26,446 INFO L226 Difference]: Without dead ends: 104 [2022-07-19 14:22:26,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:26,447 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:26,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:22:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-19 14:22:26,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-07-19 14:22:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 72 states have internal predecessors, (92), 19 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (34), 25 states have call predecessors, (34), 19 states have call successors, (34) [2022-07-19 14:22:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2022-07-19 14:22:26,454 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 48 [2022-07-19 14:22:26,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:26,454 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2022-07-19 14:22:26,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 14:22:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2022-07-19 14:22:26,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 14:22:26,455 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:26,456 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:22:26,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-19 14:22:26,665 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 14:22:26,666 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:26,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:26,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1437385679, now seen corresponding path program 1 times [2022-07-19 14:22:26,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:26,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194448265] [2022-07-19 14:22:26,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:26,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:26,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:26,668 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 14:22:26,670 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 14:22:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:26,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 14:22:26,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 14:22:26,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:22:27,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:27,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194448265] [2022-07-19 14:22:27,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194448265] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:22:27,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:22:27,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2022-07-19 14:22:27,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925748572] [2022-07-19 14:22:27,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:27,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 14:22:27,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:27,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 14:22:27,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-19 14:22:27,206 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 14:22:27,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:27,574 INFO L93 Difference]: Finished difference Result 122 states and 170 transitions. [2022-07-19 14:22:27,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 14:22:27,574 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) Word has length 48 [2022-07-19 14:22:27,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:27,575 INFO L225 Difference]: With dead ends: 122 [2022-07-19 14:22:27,575 INFO L226 Difference]: Without dead ends: 99 [2022-07-19 14:22:27,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-07-19 14:22:27,576 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 86 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:27,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 443 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 14:22:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-19 14:22:27,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2022-07-19 14:22:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 69 states have internal predecessors, (85), 19 states have call successors, (19), 2 states have call predecessors, (19), 5 states have return successors, (33), 23 states have call predecessors, (33), 19 states have call successors, (33) [2022-07-19 14:22:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2022-07-19 14:22:27,590 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 48 [2022-07-19 14:22:27,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:27,591 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2022-07-19 14:22:27,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 14:22:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2022-07-19 14:22:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 14:22:27,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:27,592 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:22:27,606 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 14:22:27,802 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 14:22:27,802 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:27,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:27,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1803392071, now seen corresponding path program 1 times [2022-07-19 14:22:27,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:27,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834421729] [2022-07-19 14:22:27,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:27,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:27,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:27,805 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 14:22:27,807 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 14:22:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:27,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 14:22:27,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 14:22:28,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:22:28,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:28,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834421729] [2022-07-19 14:22:28,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834421729] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:22:28,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:22:28,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2022-07-19 14:22:28,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287785067] [2022-07-19 14:22:28,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:28,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 14:22:28,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:28,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 14:22:28,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-19 14:22:28,229 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 14:22:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:29,087 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2022-07-19 14:22:29,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 14:22:29,088 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 48 [2022-07-19 14:22:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:29,089 INFO L225 Difference]: With dead ends: 133 [2022-07-19 14:22:29,089 INFO L226 Difference]: Without dead ends: 89 [2022-07-19 14:22:29,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-07-19 14:22:29,090 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 48 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:29,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 530 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 14:22:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-19 14:22:29,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-07-19 14:22:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 63 states have internal predecessors, (76), 16 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (27), 20 states have call predecessors, (27), 16 states have call successors, (27) [2022-07-19 14:22:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 119 transitions. [2022-07-19 14:22:29,095 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 119 transitions. Word has length 48 [2022-07-19 14:22:29,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:29,096 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 119 transitions. [2022-07-19 14:22:29,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-19 14:22:29,096 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 119 transitions. [2022-07-19 14:22:29,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 14:22:29,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:29,097 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:22:29,109 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 14:22:29,297 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 14:22:29,298 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:29,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:29,298 INFO L85 PathProgramCache]: Analyzing trace with hash -495361713, now seen corresponding path program 1 times [2022-07-19 14:22:29,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:29,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274914786] [2022-07-19 14:22:29,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:29,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:29,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:29,300 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 14:22:29,306 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 14:22:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:29,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 14:22:29,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 14:22:29,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:22:29,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:29,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274914786] [2022-07-19 14:22:29,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274914786] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:22:29,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:22:29,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2022-07-19 14:22:29,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331899604] [2022-07-19 14:22:29,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:29,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 14:22:29,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:29,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 14:22:29,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-19 14:22:29,689 INFO L87 Difference]: Start difference. First operand 86 states and 119 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 14:22:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:29,959 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2022-07-19 14:22:29,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:22:29,960 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 48 [2022-07-19 14:22:29,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:29,961 INFO L225 Difference]: With dead ends: 101 [2022-07-19 14:22:29,961 INFO L226 Difference]: Without dead ends: 82 [2022-07-19 14:22:29,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-07-19 14:22:29,962 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 48 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:29,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 503 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:22:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-19 14:22:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2022-07-19 14:22:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 55 states have internal predecessors, (63), 13 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (24), 16 states have call predecessors, (24), 13 states have call successors, (24) [2022-07-19 14:22:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2022-07-19 14:22:29,966 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 48 [2022-07-19 14:22:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:29,966 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2022-07-19 14:22:29,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 14:22:29,967 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2022-07-19 14:22:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 14:22:29,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:29,970 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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 14:22:29,982 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 14:22:30,170 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 14:22:30,171 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:30,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:30,171 INFO L85 PathProgramCache]: Analyzing trace with hash 113915812, now seen corresponding path program 1 times [2022-07-19 14:22:30,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:30,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1386228738] [2022-07-19 14:22:30,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:30,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:30,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:30,173 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 14:22:30,175 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 14:22:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:30,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 14:22:30,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 14:22:30,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 14:22:30,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:30,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1386228738] [2022-07-19 14:22:30,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1386228738] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:22:30,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:22:30,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-07-19 14:22:30,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528217446] [2022-07-19 14:22:30,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:30,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 14:22:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:30,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 14:22:30,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-07-19 14:22:30,851 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 14:22:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:31,248 INFO L93 Difference]: Finished difference Result 84 states and 111 transitions. [2022-07-19 14:22:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 14:22:31,249 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) Word has length 49 [2022-07-19 14:22:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:31,249 INFO L225 Difference]: With dead ends: 84 [2022-07-19 14:22:31,250 INFO L226 Difference]: Without dead ends: 72 [2022-07-19 14:22:31,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2022-07-19 14:22:31,251 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 81 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:31,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 309 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:22:31,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-19 14:22:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-07-19 14:22:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 13 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (20), 15 states have call predecessors, (20), 13 states have call successors, (20) [2022-07-19 14:22:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2022-07-19 14:22:31,256 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 49 [2022-07-19 14:22:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:31,256 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-07-19 14:22:31,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 17 states have internal predecessors, (44), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 14:22:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2022-07-19 14:22:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 14:22:31,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:31,257 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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 14:22:31,271 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 14:22:31,469 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 14:22:31,469 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:31,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash -552676772, now seen corresponding path program 1 times [2022-07-19 14:22:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:31,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876965194] [2022-07-19 14:22:31,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:31,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:31,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:31,471 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 14:22:31,472 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 14:22:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:31,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:22:31,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 14:22:31,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:31,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:31,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876965194] [2022-07-19 14:22:31,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876965194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:31,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:31,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:22:31,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407397663] [2022-07-19 14:22:31,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:31,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:22:31,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:31,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:22:31,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:31,541 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 14:22:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:31,576 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-07-19 14:22:31,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:22:31,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2022-07-19 14:22:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:31,577 INFO L225 Difference]: With dead ends: 96 [2022-07-19 14:22:31,577 INFO L226 Difference]: Without dead ends: 70 [2022-07-19 14:22:31,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:31,579 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:31,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:31,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-19 14:22:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-07-19 14:22:31,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (16), 15 states have call predecessors, (16), 13 states have call successors, (16) [2022-07-19 14:22:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-07-19 14:22:31,586 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 49 [2022-07-19 14:22:31,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:31,587 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-07-19 14:22:31,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 14:22:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-07-19 14:22:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 14:22:31,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:31,587 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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 14:22:31,600 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 14:22:31,798 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 14:22:31,798 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:31,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:31,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1549749125, now seen corresponding path program 1 times [2022-07-19 14:22:31,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:31,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45317035] [2022-07-19 14:22:31,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:31,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:31,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:31,800 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 14:22:31,801 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 14:22:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:31,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 14:22:31,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:22:32,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:32,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:32,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45317035] [2022-07-19 14:22:32,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45317035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:32,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:32,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 14:22:32,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457105905] [2022-07-19 14:22:32,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:32,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 14:22:32,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:32,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 14:22:32,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-19 14:22:32,390 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 14:22:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:33,084 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2022-07-19 14:22:33,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 14:22:33,085 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2022-07-19 14:22:33,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:33,086 INFO L225 Difference]: With dead ends: 90 [2022-07-19 14:22:33,086 INFO L226 Difference]: Without dead ends: 69 [2022-07-19 14:22:33,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-07-19 14:22:33,087 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 42 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:33,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 585 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 400 Invalid, 0 Unknown, 36 Unchecked, 0.4s Time] [2022-07-19 14:22:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-19 14:22:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2022-07-19 14:22:33,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 36 states have internal predecessors, (44), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-19 14:22:33,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2022-07-19 14:22:33,090 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 49 [2022-07-19 14:22:33,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:33,091 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2022-07-19 14:22:33,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 14:22:33,091 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2022-07-19 14:22:33,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-19 14:22:33,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:33,091 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:22:33,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-19 14:22:33,301 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 14:22:33,302 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:33,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:33,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1451512262, now seen corresponding path program 1 times [2022-07-19 14:22:33,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:33,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887645628] [2022-07-19 14:22:33,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:33,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:33,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:33,304 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 14:22:33,305 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 14:22:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:33,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 14:22:33,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-19 14:22:33,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 14:22:34,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:34,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887645628] [2022-07-19 14:22:34,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887645628] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:22:34,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:22:34,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2022-07-19 14:22:34,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561058076] [2022-07-19 14:22:34,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:34,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 14:22:34,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:34,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 14:22:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-07-19 14:22:34,767 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-19 14:22:35,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:35,359 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2022-07-19 14:22:35,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 14:22:35,362 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 55 [2022-07-19 14:22:35,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:35,362 INFO L225 Difference]: With dead ends: 88 [2022-07-19 14:22:35,362 INFO L226 Difference]: Without dead ends: 55 [2022-07-19 14:22:35,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2022-07-19 14:22:35,363 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 131 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:35,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 261 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 307 Invalid, 0 Unknown, 24 Unchecked, 0.4s Time] [2022-07-19 14:22:35,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-19 14:22:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2022-07-19 14:22:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-07-19 14:22:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2022-07-19 14:22:35,367 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 55 [2022-07-19 14:22:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:35,367 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-07-19 14:22:35,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 4 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-19 14:22:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-07-19 14:22:35,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 14:22:35,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:35,368 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:35,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-19 14:22:35,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:22:35,577 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:35,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:35,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2059347801, now seen corresponding path program 1 times [2022-07-19 14:22:35,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:35,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791206845] [2022-07-19 14:22:35,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:35,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:35,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:35,579 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:22:35,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-19 14:22:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:35,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 14:22:35,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-19 14:22:35,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:35,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:35,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791206845] [2022-07-19 14:22:35,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791206845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:35,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:35,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 14:22:35,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383719573] [2022-07-19 14:22:35,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:35,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:22:35,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:35,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:22:35,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:22:35,741 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 14:22:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:35,911 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-07-19 14:22:35,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:22:35,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2022-07-19 14:22:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:35,912 INFO L225 Difference]: With dead ends: 65 [2022-07-19 14:22:35,912 INFO L226 Difference]: Without dead ends: 48 [2022-07-19 14:22:35,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-19 14:22:35,913 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:35,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 226 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:22:35,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-19 14:22:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-07-19 14:22:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-07-19 14:22:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-07-19 14:22:35,916 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 62 [2022-07-19 14:22:35,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:35,916 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-07-19 14:22:35,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 14:22:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-07-19 14:22:35,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 14:22:35,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:35,917 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:35,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-19 14:22:36,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:22:36,127 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:36,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:36,128 INFO L85 PathProgramCache]: Analyzing trace with hash 253909467, now seen corresponding path program 1 times [2022-07-19 14:22:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:36,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396433623] [2022-07-19 14:22:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:36,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:36,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:36,130 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 14:22:36,130 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 14:22:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:36,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-19 14:22:36,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 14:22:36,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:36,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:36,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396433623] [2022-07-19 14:22:36,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396433623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:36,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:36,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 14:22:36,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988976693] [2022-07-19 14:22:36,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:36,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 14:22:36,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:36,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 14:22:36,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:22:36,335 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 14:22:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:36,590 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-07-19 14:22:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:22:36,591 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2022-07-19 14:22:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:36,591 INFO L225 Difference]: With dead ends: 69 [2022-07-19 14:22:36,591 INFO L226 Difference]: Without dead ends: 50 [2022-07-19 14:22:36,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-19 14:22:36,592 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 38 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:36,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 251 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:22:36,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-19 14:22:36,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-07-19 14:22:36,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-19 14:22:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-07-19 14:22:36,595 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 62 [2022-07-19 14:22:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:36,595 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-07-19 14:22:36,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 14:22:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-07-19 14:22:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 14:22:36,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:36,596 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:36,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-07-19 14:22:36,803 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 14:22:36,803 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:36,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:36,804 INFO L85 PathProgramCache]: Analyzing trace with hash 647887735, now seen corresponding path program 1 times [2022-07-19 14:22:36,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:36,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118967740] [2022-07-19 14:22:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:36,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:36,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:36,808 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 14:22:36,809 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 14:22:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:36,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-19 14:22:36,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 14:22:37,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:37,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:37,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118967740] [2022-07-19 14:22:37,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118967740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:37,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:37,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 14:22:37,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125284844] [2022-07-19 14:22:37,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:37,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 14:22:37,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:37,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 14:22:37,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:22:37,086 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 14:22:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:37,324 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-07-19 14:22:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:22:37,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 63 [2022-07-19 14:22:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:37,325 INFO L225 Difference]: With dead ends: 71 [2022-07-19 14:22:37,325 INFO L226 Difference]: Without dead ends: 52 [2022-07-19 14:22:37,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-19 14:22:37,326 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:37,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 257 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-07-19 14:22:37,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-19 14:22:37,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-07-19 14:22:37,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-19 14:22:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-07-19 14:22:37,329 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 63 [2022-07-19 14:22:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:37,329 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-07-19 14:22:37,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 14:22:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-07-19 14:22:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 14:22:37,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:37,330 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:37,342 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 14:22:37,540 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 14:22:37,540 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:37,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:37,541 INFO L85 PathProgramCache]: Analyzing trace with hash -589254976, now seen corresponding path program 1 times [2022-07-19 14:22:37,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:37,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017867468] [2022-07-19 14:22:37,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:37,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:37,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:37,543 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 14:22:37,545 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 14:22:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:37,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 14:22:37,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-19 14:22:37,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-19 14:22:38,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:38,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017867468] [2022-07-19 14:22:38,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017867468] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:22:38,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:22:38,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-19 14:22:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536202465] [2022-07-19 14:22:38,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:38,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 14:22:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 14:22:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-07-19 14:22:38,130 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-19 14:22:38,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:38,553 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2022-07-19 14:22:38,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 14:22:38,554 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) Word has length 63 [2022-07-19 14:22:38,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:38,554 INFO L225 Difference]: With dead ends: 84 [2022-07-19 14:22:38,555 INFO L226 Difference]: Without dead ends: 71 [2022-07-19 14:22:38,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-07-19 14:22:38,555 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 72 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:38,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 519 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 14:22:38,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-19 14:22:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2022-07-19 14:22:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 41 states have internal predecessors, (44), 9 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2022-07-19 14:22:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2022-07-19 14:22:38,559 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 63 [2022-07-19 14:22:38,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:38,559 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-07-19 14:22:38,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.0) internal successors, (52), 15 states have internal predecessors, (52), 7 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-19 14:22:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-07-19 14:22:38,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 14:22:38,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:38,560 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:38,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-19 14:22:38,771 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 14:22:38,771 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:38,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:38,771 INFO L85 PathProgramCache]: Analyzing trace with hash -472199073, now seen corresponding path program 1 times [2022-07-19 14:22:38,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:38,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860200637] [2022-07-19 14:22:38,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:38,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:38,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:38,774 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 14:22:38,774 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 14:22:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:38,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-19 14:22:38,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 14:22:39,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:39,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:39,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860200637] [2022-07-19 14:22:39,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860200637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:39,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:39,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 14:22:39,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964077605] [2022-07-19 14:22:39,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:39,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 14:22:39,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:39,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 14:22:39,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:22:39,055 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 14:22:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:39,312 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-07-19 14:22:39,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:22:39,313 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 64 [2022-07-19 14:22:39,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:39,314 INFO L225 Difference]: With dead ends: 75 [2022-07-19 14:22:39,314 INFO L226 Difference]: Without dead ends: 56 [2022-07-19 14:22:39,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-19 14:22:39,314 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:39,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 257 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 24 Unchecked, 0.2s Time] [2022-07-19 14:22:39,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-19 14:22:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2022-07-19 14:22:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 41 states have internal predecessors, (44), 9 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2022-07-19 14:22:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2022-07-19 14:22:39,318 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 64 [2022-07-19 14:22:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:39,319 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-07-19 14:22:39,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 14:22:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-07-19 14:22:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 14:22:39,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:39,319 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:39,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-19 14:22:39,529 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 14:22:39,530 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:39,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:39,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1512938488, now seen corresponding path program 1 times [2022-07-19 14:22:39,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:39,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690877752] [2022-07-19 14:22:39,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:39,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:39,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:39,532 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 14:22:39,533 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 14:22:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:39,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 14:22:39,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-19 14:22:39,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-19 14:22:40,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:40,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690877752] [2022-07-19 14:22:40,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690877752] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:22:40,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:22:40,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-19 14:22:40,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704923800] [2022-07-19 14:22:40,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:40,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 14:22:40,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:40,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 14:22:40,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-07-19 14:22:40,113 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-19 14:22:40,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:40,391 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2022-07-19 14:22:40,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:22:40,392 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 64 [2022-07-19 14:22:40,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:40,393 INFO L225 Difference]: With dead ends: 68 [2022-07-19 14:22:40,393 INFO L226 Difference]: Without dead ends: 55 [2022-07-19 14:22:40,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-07-19 14:22:40,393 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 112 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:40,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 229 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:22:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-19 14:22:40,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2022-07-19 14:22:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 8 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-19 14:22:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-07-19 14:22:40,397 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 64 [2022-07-19 14:22:40,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:40,398 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-07-19 14:22:40,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-07-19 14:22:40,398 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-07-19 14:22:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 14:22:40,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:40,398 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:40,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-19 14:22:40,609 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 14:22:40,609 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:40,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:40,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1283662981, now seen corresponding path program 1 times [2022-07-19 14:22:40,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:40,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199514164] [2022-07-19 14:22:40,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:40,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:40,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:40,611 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 14:22:40,613 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 14:22:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:40,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-19 14:22:40,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 14:22:40,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:40,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:40,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199514164] [2022-07-19 14:22:40,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199514164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:40,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:40,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 14:22:40,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773244401] [2022-07-19 14:22:40,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:40,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 14:22:40,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:40,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 14:22:40,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:22:40,815 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 14:22:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:41,049 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2022-07-19 14:22:41,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:22:41,049 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 65 [2022-07-19 14:22:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:41,050 INFO L225 Difference]: With dead ends: 68 [2022-07-19 14:22:41,050 INFO L226 Difference]: Without dead ends: 49 [2022-07-19 14:22:41,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-19 14:22:41,051 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 32 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:41,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 249 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:22:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-19 14:22:41,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-07-19 14:22:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 8 states have call successors, (8), 2 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 14:22:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-07-19 14:22:41,053 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 65 [2022-07-19 14:22:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:41,053 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-07-19 14:22:41,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 14:22:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-07-19 14:22:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 14:22:41,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:41,054 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:41,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-19 14:22:41,254 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 14:22:41,254 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:41,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:41,255 INFO L85 PathProgramCache]: Analyzing trace with hash -322048964, now seen corresponding path program 1 times [2022-07-19 14:22:41,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:22:41,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176561951] [2022-07-19 14:22:41,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:41,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:22:41,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:22:41,257 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 14:22:41,259 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 14:22:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:41,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:22:41,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-19 14:22:41,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:22:41,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:22:41,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176561951] [2022-07-19 14:22:41,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176561951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:41,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:41,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:22:41,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513795039] [2022-07-19 14:22:41,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:41,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:22:41,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:22:41,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:22:41,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:41,346 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 14:22:41,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:41,364 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-07-19 14:22:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:22:41,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2022-07-19 14:22:41,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:41,366 INFO L225 Difference]: With dead ends: 50 [2022-07-19 14:22:41,366 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 14:22:41,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:41,368 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:41,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:41,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 14:22:41,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 14:22:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:22:41,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 14:22:41,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2022-07-19 14:22:41,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:41,370 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 14:22:41,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 14:22:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 14:22:41,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 14:22:41,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-19 14:22:41,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-19 14:22:41,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-19 14:22:41,579 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 14:22:41,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 14:22:42,254 INFO L899 garLoopResultBuilder]: For program point isnan_floatFINAL(line 57) no Hoare annotation was computed. [2022-07-19 14:22:42,254 INFO L902 garLoopResultBuilder]: At program point isnan_floatENTRY(line 57) the Hoare annotation is: true [2022-07-19 14:22:42,254 INFO L899 garLoopResultBuilder]: For program point isnan_floatEXIT(line 57) no Hoare annotation was computed. [2022-07-19 14:22:42,254 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 82) no Hoare annotation was computed. [2022-07-19 14:22:42,254 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|))) (or (and .cse0 (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (and (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~x~0#1|) .cse0 (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))))) [2022-07-19 14:22:42,254 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2022-07-19 14:22:42,254 INFO L899 garLoopResultBuilder]: For program point L81-2(line 81) no Hoare annotation was computed. [2022-07-19 14:22:42,254 INFO L895 garLoopResultBuilder]: At program point L81-3(line 81) the Hoare annotation is: (and (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|) (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))) [2022-07-19 14:22:42,254 INFO L899 garLoopResultBuilder]: For program point L81-4(line 81) no Hoare annotation was computed. [2022-07-19 14:22:42,254 INFO L899 garLoopResultBuilder]: For program point L81-6(lines 81 84) no Hoare annotation was computed. [2022-07-19 14:22:42,254 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2022-07-19 14:22:42,255 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2022-07-19 14:22:42,255 INFO L899 garLoopResultBuilder]: For program point L69-2(line 69) no Hoare annotation was computed. [2022-07-19 14:22:42,255 INFO L895 garLoopResultBuilder]: At program point L69-3(line 69) the Hoare annotation is: (and (= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32)) |ULTIMATE.start_main_#t~short12#1| (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) [2022-07-19 14:22:42,255 INFO L899 garLoopResultBuilder]: For program point L69-4(line 69) no Hoare annotation was computed. [2022-07-19 14:22:42,255 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 14:22:42,255 INFO L899 garLoopResultBuilder]: For program point L69-6(line 69) no Hoare annotation was computed. [2022-07-19 14:22:42,255 INFO L899 garLoopResultBuilder]: For program point L69-7(lines 69 70) no Hoare annotation was computed. [2022-07-19 14:22:42,255 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 14:22:42,255 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 14:22:42,255 INFO L899 garLoopResultBuilder]: For program point L69-9(lines 69 85) no Hoare annotation was computed. [2022-07-19 14:22:42,255 INFO L899 garLoopResultBuilder]: For program point L69-11(lines 69 85) no Hoare annotation was computed. [2022-07-19 14:22:42,255 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2022-07-19 14:22:42,255 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-07-19 14:22:42,255 INFO L899 garLoopResultBuilder]: For program point L53-2(line 53) no Hoare annotation was computed. [2022-07-19 14:22:42,255 INFO L895 garLoopResultBuilder]: At program point L53-3(lines 45 54) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and .cse0 (not (fp.eq |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_fmax_float_~x#1|)) (not .cse1) (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~y~0#1|) (fp.eq |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (and (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~x~0#1|) .cse0 .cse1 (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))))) [2022-07-19 14:22:42,255 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-07-19 14:22:42,256 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse0 (not |ULTIMATE.start_main_#t~short12#1|)) (.cse1 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse2 (not |ULTIMATE.start_main_#t~short16#1|))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32)) (= |ULTIMATE.start_main_#t~ret11#1| (_ bv1 32)) (not (fp.eq |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (not .cse1) .cse2) (and .cse0 (= |ULTIMATE.start_main_#t~ret10#1| (_ bv0 32)) .cse1 .cse2))) [2022-07-19 14:22:42,256 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2022-07-19 14:22:42,256 INFO L899 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2022-07-19 14:22:42,256 INFO L895 garLoopResultBuilder]: At program point L70-3(line 70) the Hoare annotation is: (and (not |ULTIMATE.start_main_#t~short12#1|) |ULTIMATE.start_main_#t~short15#1| (= |ULTIMATE.start_main_#t~ret13#1| (_ bv0 32)) (= |ULTIMATE.start_main_#t~ret10#1| (_ bv0 32)) (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|) (not |ULTIMATE.start_main_#t~short16#1|)) [2022-07-19 14:22:42,256 INFO L899 garLoopResultBuilder]: For program point L70-4(line 70) no Hoare annotation was computed. [2022-07-19 14:22:42,256 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 14:22:42,256 INFO L899 garLoopResultBuilder]: For program point L70-6(line 70) no Hoare annotation was computed. [2022-07-19 14:22:42,256 INFO L902 garLoopResultBuilder]: At program point L87(lines 59 88) the Hoare annotation is: true [2022-07-19 14:22:42,257 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse2 (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))) (or (and .cse0 (not (fp.eq |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_fmax_float_~x#1|)) (not .cse1) .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not .cse2)))) [2022-07-19 14:22:42,257 INFO L899 garLoopResultBuilder]: For program point L50-1(lines 50 52) no Hoare annotation was computed. [2022-07-19 14:22:42,257 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (.cse2 (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))) (or (and .cse0 (not (fp.eq |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_fmax_float_~x#1|)) (not .cse1) .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not .cse2)))) [2022-07-19 14:22:42,257 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 46 48) no Hoare annotation was computed. [2022-07-19 14:22:42,257 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~x~0#1|) .cse0 .cse1 (= |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (not (fp.eq |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_fmax_float_~y#1|))) (and .cse0 (not (fp.eq |ULTIMATE.start_fmax_float_~x#1| |ULTIMATE.start_fmax_float_~x#1|)) (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~y~0#1|) (not .cse1) (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~y~0#1|) (fp.eq |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) [2022-07-19 14:22:42,257 INFO L899 garLoopResultBuilder]: For program point L75-1(line 75) no Hoare annotation was computed. [2022-07-19 14:22:42,257 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2022-07-19 14:22:42,258 INFO L895 garLoopResultBuilder]: At program point L75-3(line 75) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short20#1| (= |ULTIMATE.start_fmax_float_~y#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~res~0#1| |ULTIMATE.start_main_~y~0#1|) (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_fmax_float_#res#1| |ULTIMATE.start_main_~y~0#1|) (fp.eq |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) [2022-07-19 14:22:42,258 INFO L899 garLoopResultBuilder]: For program point L75-4(line 75) no Hoare annotation was computed. [2022-07-19 14:22:42,258 INFO L899 garLoopResultBuilder]: For program point L75-6(lines 75 78) no Hoare annotation was computed. [2022-07-19 14:22:42,258 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-07-19 14:22:42,258 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 42) no Hoare annotation was computed. [2022-07-19 14:22:42,258 INFO L899 garLoopResultBuilder]: For program point __fpclassify_floatFINAL(lines 22 43) no Hoare annotation was computed. [2022-07-19 14:22:42,258 INFO L899 garLoopResultBuilder]: For program point L25-1(lines 25 29) no Hoare annotation was computed. [2022-07-19 14:22:42,258 INFO L895 garLoopResultBuilder]: At program point L25-2(lines 25 29) the Hoare annotation is: (= |__fpclassify_float_#in~x| __fpclassify_float_~x) [2022-07-19 14:22:42,260 INFO L899 garLoopResultBuilder]: For program point L25-3(lines 22 43) no Hoare annotation was computed. [2022-07-19 14:22:42,260 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 42) no Hoare annotation was computed. [2022-07-19 14:22:42,260 INFO L902 garLoopResultBuilder]: At program point __fpclassify_floatENTRY(lines 22 43) the Hoare annotation is: true [2022-07-19 14:22:42,260 INFO L899 garLoopResultBuilder]: For program point __fpclassify_floatEXIT(lines 22 43) no Hoare annotation was computed. [2022-07-19 14:22:42,260 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 42) no Hoare annotation was computed. [2022-07-19 14:22:42,263 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:42,266 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:22:42,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:22:42 BoogieIcfgContainer [2022-07-19 14:22:42,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:22:42,286 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:22:42,286 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:22:42,286 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:22:42,287 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:22:16" (3/4) ... [2022-07-19 14:22:42,292 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 14:22:42,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_float [2022-07-19 14:22:42,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2022-07-19 14:22:42,307 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-07-19 14:22:42,308 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-19 14:22:42,308 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 14:22:42,308 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 14:22:42,336 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2022-07-19 14:22:42,337 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && \result == y) && ~fp.eq~FLOAT(y, y)) || ((((\result == x && y == y) && ~fp.eq~FLOAT(x, x)) && x == x) && !~fp.eq~FLOAT(y, y)) [2022-07-19 14:22:42,365 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 14:22:42,366 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:22:42,366 INFO L158 Benchmark]: Toolchain (without parser) took 26523.99ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 46.4MB in the beginning and 55.3MB in the end (delta: -8.9MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2022-07-19 14:22:42,367 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 67.1MB. Free memory was 47.2MB in the beginning and 47.2MB in the end (delta: 31.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:22:42,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.56ms. Allocated memory is still 67.1MB. Free memory was 46.2MB in the beginning and 48.5MB in the end (delta: -2.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 14:22:42,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.24ms. Allocated memory is still 67.1MB. Free memory was 48.5MB in the beginning and 46.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:22:42,371 INFO L158 Benchmark]: Boogie Preprocessor took 34.87ms. Allocated memory is still 67.1MB. Free memory was 46.9MB in the beginning and 45.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:22:42,371 INFO L158 Benchmark]: RCFGBuilder took 352.42ms. Allocated memory is still 67.1MB. Free memory was 45.4MB in the beginning and 32.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 14:22:42,372 INFO L158 Benchmark]: TraceAbstraction took 25772.03ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 32.1MB in the beginning and 58.4MB in the end (delta: -26.2MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2022-07-19 14:22:42,377 INFO L158 Benchmark]: Witness Printer took 79.91ms. Allocated memory is still 98.6MB. Free memory was 58.4MB in the beginning and 55.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 14:22:42,379 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.20ms. Allocated memory is still 67.1MB. Free memory was 47.2MB in the beginning and 47.2MB in the end (delta: 31.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.56ms. Allocated memory is still 67.1MB. Free memory was 46.2MB in the beginning and 48.5MB in the end (delta: -2.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.24ms. Allocated memory is still 67.1MB. Free memory was 48.5MB in the beginning and 46.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.87ms. Allocated memory is still 67.1MB. Free memory was 46.9MB in the beginning and 45.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 352.42ms. Allocated memory is still 67.1MB. Free memory was 45.4MB in the beginning and 32.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 25772.03ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 32.1MB in the beginning and 58.4MB in the end (delta: -26.2MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * Witness Printer took 79.91ms. Allocated memory is still 98.6MB. Free memory was 58.4MB in the beginning and 55.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 82]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 55 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 25.7s, OverallIterations: 30, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1332 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1257 mSDsluCounter, 9173 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 108 IncrementalHoareTripleChecker+Unchecked, 7355 mSDsCounter, 334 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4147 IncrementalHoareTripleChecker+Invalid, 4589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 334 mSolverCounterUnsat, 1818 mSDtfsCounter, 4147 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2044 GetRequests, 1738 SyntacticMatches, 2 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=14, InterpolantAutomatonStates: 243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 209 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 137 PreInvPairs, 163 NumberOfFragments, 264 HoareAnnotationTreeSize, 137 FomulaSimplifications, 1064 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1513 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1490 NumberOfCodeBlocks, 1490 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1902 ConstructedInterpolants, 9 QuantifiedInterpolants, 5667 SizeOfPredicates, 152 NumberOfNonLiveVariables, 3436 ConjunctsInSsa, 301 ConjunctsInUnsatCore, 40 InterpolantComputations, 20 PerfectInterpolantSequences, 1033/1145 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && \result == y) && ~fp.eq~FLOAT(y, y)) || ((((\result == x && y == y) && ~fp.eq~FLOAT(x, x)) && x == x) && !~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: \old(x) == x RESULT: Ultimate proved your program to be correct! [2022-07-19 14:22:42,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE