./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Primes.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/recursive/Primes.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 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 06:21:49,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 06:21:49,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 06:21:49,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 06:21:49,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 06:21:49,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 06:21:49,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 06:21:49,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 06:21:49,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 06:21:49,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 06:21:49,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 06:21:49,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 06:21:49,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 06:21:49,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 06:21:49,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 06:21:49,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 06:21:49,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 06:21:49,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 06:21:49,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 06:21:49,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 06:21:49,756 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 06:21:49,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 06:21:49,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 06:21:49,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 06:21:49,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 06:21:49,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 06:21:49,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 06:21:49,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 06:21:49,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 06:21:49,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 06:21:49,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 06:21:49,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 06:21:49,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 06:21:49,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 06:21:49,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 06:21:49,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 06:21:49,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 06:21:49,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 06:21:49,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 06:21:49,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 06:21:49,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 06:21:49,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 06:21:49,775 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 06:21:49,801 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 06:21:49,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 06:21:49,802 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 06:21:49,802 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 06:21:49,803 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 06:21:49,803 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 06:21:49,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 06:21:49,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 06:21:49,804 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 06:21:49,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 06:21:49,804 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 06:21:49,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 06:21:49,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 06:21:49,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 06:21:49,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 06:21:49,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 06:21:49,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 06:21:49,805 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 06:21:49,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 06:21:49,806 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 06:21:49,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 06:21:49,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 06:21:49,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 06:21:49,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 06:21:49,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:21:49,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 06:21:49,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 06:21:49,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 06:21:49,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 06:21:49,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 06:21:49,808 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 06:21:49,808 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 06:21:49,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 06:21:49,808 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 -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e [2022-07-12 06:21:50,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 06:21:50,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 06:21:50,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 06:21:50,061 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 06:21:50,062 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 06:21:50,062 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Primes.c [2022-07-12 06:21:50,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8f4175a/b19cd72eda1140b8a9e8469df4bda5cd/FLAG4aa2b7aa3 [2022-07-12 06:21:50,532 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 06:21:50,532 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c [2022-07-12 06:21:50,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8f4175a/b19cd72eda1140b8a9e8469df4bda5cd/FLAG4aa2b7aa3 [2022-07-12 06:21:50,937 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8f4175a/b19cd72eda1140b8a9e8469df4bda5cd [2022-07-12 06:21:50,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 06:21:50,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 06:21:50,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 06:21:50,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 06:21:50,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 06:21:50,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:21:50" (1/1) ... [2022-07-12 06:21:50,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e850e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:50, skipping insertion in model container [2022-07-12 06:21:50,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:21:50" (1/1) ... [2022-07-12 06:21:50,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 06:21:51,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 06:21:51,306 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/recursive/Primes.c[2190,2203] [2022-07-12 06:21:51,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:21:51,336 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 06:21:51,379 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/recursive/Primes.c[2190,2203] [2022-07-12 06:21:51,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:21:51,405 INFO L208 MainTranslator]: Completed translation [2022-07-12 06:21:51,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:51 WrapperNode [2022-07-12 06:21:51,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 06:21:51,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 06:21:51,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 06:21:51,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 06:21:51,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:51" (1/1) ... [2022-07-12 06:21:51,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:51" (1/1) ... [2022-07-12 06:21:51,461 INFO L137 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-07-12 06:21:51,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 06:21:51,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 06:21:51,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 06:21:51,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 06:21:51,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:51" (1/1) ... [2022-07-12 06:21:51,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:51" (1/1) ... [2022-07-12 06:21:51,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:51" (1/1) ... [2022-07-12 06:21:51,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:51" (1/1) ... [2022-07-12 06:21:51,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:51" (1/1) ... [2022-07-12 06:21:51,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:51" (1/1) ... [2022-07-12 06:21:51,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:51" (1/1) ... [2022-07-12 06:21:51,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 06:21:51,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 06:21:51,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 06:21:51,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 06:21:51,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:51" (1/1) ... [2022-07-12 06:21:51,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:21:51,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:51,577 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-12 06:21:51,597 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-12 06:21:51,626 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2022-07-12 06:21:51,626 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2022-07-12 06:21:51,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 06:21:51,633 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2022-07-12 06:21:51,633 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2022-07-12 06:21:51,633 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2022-07-12 06:21:51,636 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2022-07-12 06:21:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 06:21:51,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 06:21:51,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 06:21:51,718 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 06:21:51,720 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 06:21:52,002 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 06:21:52,015 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 06:21:52,015 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 06:21:52,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:21:52 BoogieIcfgContainer [2022-07-12 06:21:52,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 06:21:52,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 06:21:52,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 06:21:52,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 06:21:52,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:21:50" (1/3) ... [2022-07-12 06:21:52,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a065e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:21:52, skipping insertion in model container [2022-07-12 06:21:52,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:21:51" (2/3) ... [2022-07-12 06:21:52,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a065e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:21:52, skipping insertion in model container [2022-07-12 06:21:52,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:21:52" (3/3) ... [2022-07-12 06:21:52,047 INFO L111 eAbstractionObserver]: Analyzing ICFG Primes.c [2022-07-12 06:21:52,070 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 06:21:52,070 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 06:21:52,163 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 06:21:52,186 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@5babadf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c3a8d52 [2022-07-12 06:21:52,186 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 06:21:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-12 06:21:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 06:21:52,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:52,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:52,210 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:52,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:52,235 INFO L85 PathProgramCache]: Analyzing trace with hash 691245353, now seen corresponding path program 1 times [2022-07-12 06:21:52,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:52,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076093465] [2022-07-12 06:21:52,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:52,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 06:21:52,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:52,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076093465] [2022-07-12 06:21:52,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076093465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:21:52,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:21:52,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 06:21:52,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074407775] [2022-07-12 06:21:52,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:21:52,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 06:21:52,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:52,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 06:21:52,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 06:21:52,631 INFO L87 Difference]: Start difference. First operand has 52 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 06:21:52,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:52,712 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2022-07-12 06:21:52,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 06:21:52,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-12 06:21:52,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:52,724 INFO L225 Difference]: With dead ends: 58 [2022-07-12 06:21:52,725 INFO L226 Difference]: Without dead ends: 49 [2022-07-12 06:21:52,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-12 06:21:52,745 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:52,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:21:52,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-12 06:21:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-07-12 06:21:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-12 06:21:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2022-07-12 06:21:52,806 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 15 [2022-07-12 06:21:52,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:52,809 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2022-07-12 06:21:52,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 06:21:52,809 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2022-07-12 06:21:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 06:21:52,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:52,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:52,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 06:21:52,826 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:52,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1873142352, now seen corresponding path program 1 times [2022-07-12 06:21:52,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:52,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546572523] [2022-07-12 06:21:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:52,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:52,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 06:21:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 06:21:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:53,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546572523] [2022-07-12 06:21:53,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546572523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:21:53,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:21:53,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:21:53,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507292835] [2022-07-12 06:21:53,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:21:53,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:21:53,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:53,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:21:53,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:21:53,045 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 06:21:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:53,146 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-07-12 06:21:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 06:21:53,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-07-12 06:21:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:53,151 INFO L225 Difference]: With dead ends: 71 [2022-07-12 06:21:53,151 INFO L226 Difference]: Without dead ends: 51 [2022-07-12 06:21:53,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 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-12 06:21:53,156 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:53,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 365 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:21:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-12 06:21:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-12 06:21:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-12 06:21:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2022-07-12 06:21:53,172 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 22 [2022-07-12 06:21:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:53,173 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2022-07-12 06:21:53,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 06:21:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-07-12 06:21:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 06:21:53,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:53,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:53,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 06:21:53,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:53,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2039437329, now seen corresponding path program 1 times [2022-07-12 06:21:53,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:53,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475449141] [2022-07-12 06:21:53,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:53,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 06:21:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 06:21:53,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:53,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475449141] [2022-07-12 06:21:53,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475449141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:21:53,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:21:53,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 06:21:53,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221850775] [2022-07-12 06:21:53,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:21:53,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 06:21:53,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:53,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 06:21:53,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 06:21:53,349 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 06:21:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:53,404 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-07-12 06:21:53,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 06:21:53,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-07-12 06:21:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:53,407 INFO L225 Difference]: With dead ends: 57 [2022-07-12 06:21:53,407 INFO L226 Difference]: Without dead ends: 53 [2022-07-12 06:21:53,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:21:53,416 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 5 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:53,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 244 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:21:53,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-12 06:21:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-12 06:21:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 40 states have internal predecessors, (50), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-12 06:21:53,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2022-07-12 06:21:53,443 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 23 [2022-07-12 06:21:53,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:53,443 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2022-07-12 06:21:53,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 06:21:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2022-07-12 06:21:53,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 06:21:53,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:53,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:53,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 06:21:53,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:53,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:53,448 INFO L85 PathProgramCache]: Analyzing trace with hash -502167403, now seen corresponding path program 1 times [2022-07-12 06:21:53,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:53,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708812612] [2022-07-12 06:21:53,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:53,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 06:21:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 06:21:53,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:53,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708812612] [2022-07-12 06:21:53,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708812612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:21:53,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:21:53,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:21:53,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176106691] [2022-07-12 06:21:53,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:21:53,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:21:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:53,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:21:53,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:21:53,571 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 06:21:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:53,634 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2022-07-12 06:21:53,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:21:53,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-07-12 06:21:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:53,637 INFO L225 Difference]: With dead ends: 59 [2022-07-12 06:21:53,638 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 06:21:53,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-12 06:21:53,643 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 9 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:53,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 209 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:21:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 06:21:53,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-07-12 06:21:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 40 states have internal predecessors, (50), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-12 06:21:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2022-07-12 06:21:53,659 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 24 [2022-07-12 06:21:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:53,659 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2022-07-12 06:21:53,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 06:21:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2022-07-12 06:21:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 06:21:53,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:53,688 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:53,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 06:21:53,688 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:53,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:53,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1717699423, now seen corresponding path program 1 times [2022-07-12 06:21:53,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:53,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145152418] [2022-07-12 06:21:53,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:53,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 06:21:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 06:21:53,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:53,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145152418] [2022-07-12 06:21:53,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145152418] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:53,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265416547] [2022-07-12 06:21:53,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:53,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:53,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:53,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:21:53,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 06:21:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:53,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 06:21:53,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 06:21:54,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 06:21:54,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265416547] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:54,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:54,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2022-07-12 06:21:54,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180957548] [2022-07-12 06:21:54,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:54,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 06:21:54,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:54,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 06:21:54,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-12 06:21:54,747 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 06:21:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:54,870 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2022-07-12 06:21:54,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 06:21:54,871 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2022-07-12 06:21:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:54,872 INFO L225 Difference]: With dead ends: 68 [2022-07-12 06:21:54,872 INFO L226 Difference]: Without dead ends: 51 [2022-07-12 06:21:54,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-07-12 06:21:54,873 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:54,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 373 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:21:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-12 06:21:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-12 06:21:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 39 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-12 06:21:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-07-12 06:21:54,877 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 31 [2022-07-12 06:21:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:54,877 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2022-07-12 06:21:54,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 06:21:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-07-12 06:21:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 06:21:54,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:54,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:54,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 06:21:55,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:55,104 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:55,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:55,104 INFO L85 PathProgramCache]: Analyzing trace with hash 380831863, now seen corresponding path program 1 times [2022-07-12 06:21:55,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:55,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435278116] [2022-07-12 06:21:55,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:55,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:55,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:55,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 06:21:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:55,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 06:21:55,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:55,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435278116] [2022-07-12 06:21:55,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435278116] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:55,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076983242] [2022-07-12 06:21:55,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:55,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:55,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:55,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:21:55,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 06:21:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:55,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 06:21:55,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 06:21:55,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 06:21:55,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076983242] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:55,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:55,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2022-07-12 06:21:55,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355205499] [2022-07-12 06:21:55,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:55,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 06:21:55,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:55,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 06:21:55,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-07-12 06:21:55,866 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 22 states, 20 states have (on average 2.3) internal successors, (46), 16 states have internal predecessors, (46), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-12 06:21:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:56,238 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2022-07-12 06:21:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 06:21:56,239 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 16 states have internal predecessors, (46), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 32 [2022-07-12 06:21:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:56,240 INFO L225 Difference]: With dead ends: 71 [2022-07-12 06:21:56,240 INFO L226 Difference]: Without dead ends: 54 [2022-07-12 06:21:56,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2022-07-12 06:21:56,241 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 44 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:56,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 497 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:21:56,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-12 06:21:56,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2022-07-12 06:21:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-12 06:21:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2022-07-12 06:21:56,258 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 32 [2022-07-12 06:21:56,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:56,260 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2022-07-12 06:21:56,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 16 states have internal predecessors, (46), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-12 06:21:56,260 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2022-07-12 06:21:56,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 06:21:56,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:56,261 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:56,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 06:21:56,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 06:21:56,477 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:56,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:56,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1826216781, now seen corresponding path program 1 times [2022-07-12 06:21:56,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:56,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985163994] [2022-07-12 06:21:56,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:56,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 06:21:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 06:21:56,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:56,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985163994] [2022-07-12 06:21:56,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985163994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:21:56,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:21:56,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:21:56,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638124744] [2022-07-12 06:21:56,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:21:56,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:21:56,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:56,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:21:56,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:21:56,606 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 1 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-12 06:21:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:56,642 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-07-12 06:21:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 06:21:56,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 1 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 34 [2022-07-12 06:21:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:56,644 INFO L225 Difference]: With dead ends: 73 [2022-07-12 06:21:56,645 INFO L226 Difference]: Without dead ends: 53 [2022-07-12 06:21:56,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 06:21:56,659 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 28 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:56,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 220 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:21:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-12 06:21:56,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-07-12 06:21:56,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-12 06:21:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2022-07-12 06:21:56,667 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 34 [2022-07-12 06:21:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:56,667 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2022-07-12 06:21:56,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 1 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-12 06:21:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2022-07-12 06:21:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 06:21:56,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:56,670 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:56,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 06:21:56,671 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:56,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:56,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1825803044, now seen corresponding path program 1 times [2022-07-12 06:21:56,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:56,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288416801] [2022-07-12 06:21:56,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:56,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 06:21:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 06:21:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 06:21:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 06:21:56,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:56,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288416801] [2022-07-12 06:21:56,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288416801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:21:56,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:21:56,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:21:56,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979227019] [2022-07-12 06:21:56,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:21:56,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:21:56,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:56,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:21:56,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:21:56,762 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 06:21:56,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:56,812 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2022-07-12 06:21:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:21:56,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2022-07-12 06:21:56,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:56,827 INFO L225 Difference]: With dead ends: 104 [2022-07-12 06:21:56,827 INFO L226 Difference]: Without dead ends: 51 [2022-07-12 06:21:56,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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-12 06:21:56,831 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 21 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:56,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 169 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:21:56,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-12 06:21:56,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-07-12 06:21:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-12 06:21:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-07-12 06:21:56,844 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 52 [2022-07-12 06:21:56,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:56,845 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-07-12 06:21:56,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 06:21:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-07-12 06:21:56,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 06:21:56,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:56,847 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:56,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 06:21:56,847 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:56,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:56,847 INFO L85 PathProgramCache]: Analyzing trace with hash 654757234, now seen corresponding path program 1 times [2022-07-12 06:21:56,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:56,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779287196] [2022-07-12 06:21:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:56,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 06:21:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:21:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 06:21:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 06:21:56,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:56,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779287196] [2022-07-12 06:21:56,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779287196] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:56,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750787774] [2022-07-12 06:21:56,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:56,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:56,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:56,968 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:21:56,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 06:21:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:57,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 06:21:57,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 06:21:57,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 06:21:57,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750787774] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:21:57,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 06:21:57,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-07-12 06:21:57,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73132827] [2022-07-12 06:21:57,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:21:57,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:21:57,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:57,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:21:57,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:21:57,110 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 06:21:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:57,140 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-07-12 06:21:57,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:21:57,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2022-07-12 06:21:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:57,141 INFO L225 Difference]: With dead ends: 96 [2022-07-12 06:21:57,141 INFO L226 Difference]: Without dead ends: 51 [2022-07-12 06:21:57,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 06:21:57,149 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:57,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 149 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:21:57,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-12 06:21:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-12 06:21:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-12 06:21:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-07-12 06:21:57,153 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 53 [2022-07-12 06:21:57,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:57,153 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-07-12 06:21:57,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 06:21:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-07-12 06:21:57,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 06:21:57,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:57,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:57,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 06:21:57,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:57,369 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:57,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash 689204116, now seen corresponding path program 1 times [2022-07-12 06:21:57,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:57,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387757105] [2022-07-12 06:21:57,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:57,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:57,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:57,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 06:21:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:57,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 06:21:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:57,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 06:21:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:57,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 06:21:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:57,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 06:21:57,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:57,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387757105] [2022-07-12 06:21:57,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387757105] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:57,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566371970] [2022-07-12 06:21:57,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:57,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:57,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:57,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:21:57,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 06:21:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:57,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 06:21:57,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:21:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 06:21:57,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:21:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 06:21:58,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566371970] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:21:58,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:21:58,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-12 06:21:58,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888090449] [2022-07-12 06:21:58,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:21:58,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 06:21:58,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:21:58,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 06:21:58,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-07-12 06:21:58,029 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 10 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-12 06:21:58,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:21:58,253 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2022-07-12 06:21:58,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 06:21:58,254 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 10 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) Word has length 62 [2022-07-12 06:21:58,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:21:58,255 INFO L225 Difference]: With dead ends: 90 [2022-07-12 06:21:58,255 INFO L226 Difference]: Without dead ends: 59 [2022-07-12 06:21:58,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-07-12 06:21:58,256 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 84 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:21:58,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 335 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:21:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-12 06:21:58,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2022-07-12 06:21:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 7 states have call successors, (7), 3 states have call predecessors, (7), 7 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-12 06:21:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2022-07-12 06:21:58,264 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 62 [2022-07-12 06:21:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:21:58,265 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2022-07-12 06:21:58,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 10 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-12 06:21:58,265 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2022-07-12 06:21:58,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 06:21:58,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:21:58,266 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:21:58,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 06:21:58,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:58,483 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:21:58,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:21:58,484 INFO L85 PathProgramCache]: Analyzing trace with hash -729550012, now seen corresponding path program 2 times [2022-07-12 06:21:58,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:21:58,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275108614] [2022-07-12 06:21:58,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:21:58,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:21:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:58,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:21:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:58,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 06:21:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:58,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 06:21:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:58,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 06:21:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:58,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 06:21:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:58,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 06:21:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:58,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:21:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:21:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 06:21:58,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:21:58,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275108614] [2022-07-12 06:21:58,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275108614] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:21:58,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642303740] [2022-07-12 06:21:58,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 06:21:58,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:21:58,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:21:58,652 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:21:58,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 06:21:58,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 06:21:58,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:21:58,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 06:21:58,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:22:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 06:22:00,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:22:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 06:22:00,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642303740] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:22:00,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:22:00,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 22 [2022-07-12 06:22:00,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440725874] [2022-07-12 06:22:00,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:22:00,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 06:22:00,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:22:00,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 06:22:00,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-07-12 06:22:00,793 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 22 states, 19 states have (on average 4.947368421052632) internal successors, (94), 22 states have internal predecessors, (94), 12 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2022-07-12 06:22:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:22:01,087 INFO L93 Difference]: Finished difference Result 150 states and 199 transitions. [2022-07-12 06:22:01,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 06:22:01,088 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 4.947368421052632) internal successors, (94), 22 states have internal predecessors, (94), 12 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) Word has length 71 [2022-07-12 06:22:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:22:01,092 INFO L225 Difference]: With dead ends: 150 [2022-07-12 06:22:01,093 INFO L226 Difference]: Without dead ends: 95 [2022-07-12 06:22:01,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2022-07-12 06:22:01,099 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 100 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:22:01,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 335 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:22:01,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-12 06:22:01,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2022-07-12 06:22:01,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 71 states have internal predecessors, (74), 11 states have call successors, (11), 7 states have call predecessors, (11), 12 states have return successors, (32), 12 states have call predecessors, (32), 11 states have call successors, (32) [2022-07-12 06:22:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2022-07-12 06:22:01,130 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 71 [2022-07-12 06:22:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:22:01,130 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2022-07-12 06:22:01,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 4.947368421052632) internal successors, (94), 22 states have internal predecessors, (94), 12 states have call successors, (15), 2 states have call predecessors, (15), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2022-07-12 06:22:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2022-07-12 06:22:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 06:22:01,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:22:01,132 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:22:01,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 06:22:01,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 06:22:01,349 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:22:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:22:01,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1100264158, now seen corresponding path program 1 times [2022-07-12 06:22:01,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:22:01,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489314996] [2022-07-12 06:22:01,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:22:01,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:22:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:22:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 06:22:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 06:22:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 06:22:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:22:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 06:22:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 06:22:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:22:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 06:22:01,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:22:01,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489314996] [2022-07-12 06:22:01,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489314996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:22:01,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:22:01,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:22:01,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190969835] [2022-07-12 06:22:01,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:22:01,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:22:01,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:22:01,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:22:01,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:22:01,484 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 06:22:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:22:01,512 INFO L93 Difference]: Finished difference Result 178 states and 250 transitions. [2022-07-12 06:22:01,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:22:01,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 78 [2022-07-12 06:22:01,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:22:01,514 INFO L225 Difference]: With dead ends: 178 [2022-07-12 06:22:01,514 INFO L226 Difference]: Without dead ends: 91 [2022-07-12 06:22:01,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:22:01,515 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:22:01,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 167 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:22:01,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-12 06:22:01,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-07-12 06:22:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 71 states have internal predecessors, (74), 11 states have call successors, (11), 7 states have call predecessors, (11), 12 states have return successors, (30), 12 states have call predecessors, (30), 11 states have call successors, (30) [2022-07-12 06:22:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2022-07-12 06:22:01,539 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 78 [2022-07-12 06:22:01,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:22:01,540 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2022-07-12 06:22:01,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 06:22:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2022-07-12 06:22:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 06:22:01,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:22:01,541 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:22:01,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 06:22:01,542 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:22:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:22:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash -862294776, now seen corresponding path program 2 times [2022-07-12 06:22:01,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:22:01,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698348868] [2022-07-12 06:22:01,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:22:01,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:22:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:22:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 06:22:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 06:22:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 06:22:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 06:22:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 06:22:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 06:22:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 06:22:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:22:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:22:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 06:22:01,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:22:01,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698348868] [2022-07-12 06:22:01,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698348868] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:22:01,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740029337] [2022-07-12 06:22:01,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 06:22:01,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:22:01,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:22:01,693 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:22:01,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 06:22:01,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 06:22:01,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:22:01,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 06:22:01,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:22:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 60 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 06:22:01,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:22:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 06:22:03,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740029337] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:22:03,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:22:03,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 25 [2022-07-12 06:22:03,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10126673] [2022-07-12 06:22:03,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:22:03,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 06:22:03,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:22:03,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 06:22:03,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2022-07-12 06:22:03,104 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 25 states, 24 states have (on average 5.166666666666667) internal successors, (124), 25 states have internal predecessors, (124), 15 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-12 06:22:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:22:03,258 INFO L93 Difference]: Finished difference Result 152 states and 206 transitions. [2022-07-12 06:22:03,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 06:22:03,259 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.166666666666667) internal successors, (124), 25 states have internal predecessors, (124), 15 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 15 states have call successors, (23) Word has length 87 [2022-07-12 06:22:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:22:03,260 INFO L225 Difference]: With dead ends: 152 [2022-07-12 06:22:03,260 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 06:22:03,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=816, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 06:22:03,261 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 100 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:22:03,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 195 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:22:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 06:22:03,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 06:22:03,261 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-12 06:22:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 06:22:03,262 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2022-07-12 06:22:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:22:03,262 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 06:22:03,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.166666666666667) internal successors, (124), 25 states have internal predecessors, (124), 15 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 15 states have call successors, (23) [2022-07-12 06:22:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 06:22:03,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 06:22:03,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 06:22:03,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 06:22:03,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:22:03,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 06:22:03,653 INFO L895 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (and (= |multiple_of_#in~m| multiple_of_~m) (<= |multiple_of_#in~m| 0)) [2022-07-12 06:22:03,653 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 34) no Hoare annotation was computed. [2022-07-12 06:22:03,653 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-07-12 06:22:03,653 INFO L899 garLoopResultBuilder]: For program point multiple_ofFINAL(lines 31 45) no Hoare annotation was computed. [2022-07-12 06:22:03,653 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n) (< 0 multiple_of_~n)) [2022-07-12 06:22:03,654 INFO L899 garLoopResultBuilder]: For program point L44-1(line 44) no Hoare annotation was computed. [2022-07-12 06:22:03,654 INFO L902 garLoopResultBuilder]: At program point multiple_ofENTRY(lines 31 45) the Hoare annotation is: true [2022-07-12 06:22:03,654 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2022-07-12 06:22:03,654 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2022-07-12 06:22:03,654 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (= |multiple_of_#in~m| multiple_of_~m) (not (<= 0 |multiple_of_#in~n|)) (= |multiple_of_#in~n| multiple_of_~n)) [2022-07-12 06:22:03,654 INFO L899 garLoopResultBuilder]: For program point multiple_ofEXIT(lines 31 45) no Hoare annotation was computed. [2022-07-12 06:22:03,654 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2022-07-12 06:22:03,654 INFO L899 garLoopResultBuilder]: For program point L36-1(line 36) no Hoare annotation was computed. [2022-07-12 06:22:03,654 INFO L902 garLoopResultBuilder]: At program point multENTRY(lines 17 28) the Hoare annotation is: true [2022-07-12 06:22:03,655 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (= |mult_#in~n| mult_~n) (= |mult_#in~m| mult_~m) (< 1 mult_~m)) [2022-07-12 06:22:03,655 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-07-12 06:22:03,655 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2022-07-12 06:22:03,655 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2022-07-12 06:22:03,655 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (and (= |mult_#in~m| mult_~m) (<= |mult_#in~m| 0)) [2022-07-12 06:22:03,655 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-07-12 06:22:03,655 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2022-07-12 06:22:03,655 INFO L899 garLoopResultBuilder]: For program point multFINAL(lines 17 28) no Hoare annotation was computed. [2022-07-12 06:22:03,655 INFO L899 garLoopResultBuilder]: For program point multEXIT(lines 17 28) no Hoare annotation was computed. [2022-07-12 06:22:03,656 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-07-12 06:22:03,656 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 06:22:03,656 INFO L895 garLoopResultBuilder]: At program point L97-1(line 97) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|)) [2022-07-12 06:22:03,656 INFO L899 garLoopResultBuilder]: For program point L97-2(line 97) no Hoare annotation was computed. [2022-07-12 06:22:03,656 INFO L899 garLoopResultBuilder]: For program point L97-4(lines 97 101) no Hoare annotation was computed. [2022-07-12 06:22:03,656 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-07-12 06:22:03,656 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2022-07-12 06:22:03,656 INFO L902 garLoopResultBuilder]: At program point L100(lines 76 102) the Hoare annotation is: true [2022-07-12 06:22:03,656 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-07-12 06:22:03,656 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 06:22:03,657 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 06:22:03,657 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 06:22:03,657 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 98) no Hoare annotation was computed. [2022-07-12 06:22:03,657 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|)) [2022-07-12 06:22:03,657 INFO L899 garLoopResultBuilder]: For program point L53-1(line 53) no Hoare annotation was computed. [2022-07-12 06:22:03,657 INFO L895 garLoopResultBuilder]: At program point L53-2(lines 52 54) the Hoare annotation is: (or (= |ULTIMATE.start_is_prime_#res#1| 0) (and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|))) [2022-07-12 06:22:03,657 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 82) no Hoare annotation was computed. [2022-07-12 06:22:03,657 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 72) no Hoare annotation was computed. [2022-07-12 06:22:03,657 INFO L899 garLoopResultBuilder]: For program point is_prime_EXIT(lines 57 74) no Hoare annotation was computed. [2022-07-12 06:22:03,658 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 73) no Hoare annotation was computed. [2022-07-12 06:22:03,658 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 63) no Hoare annotation was computed. [2022-07-12 06:22:03,658 INFO L899 garLoopResultBuilder]: For program point is_prime_FINAL(lines 57 74) no Hoare annotation was computed. [2022-07-12 06:22:03,658 INFO L902 garLoopResultBuilder]: At program point is_prime_ENTRY(lines 57 74) the Hoare annotation is: true [2022-07-12 06:22:03,658 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-07-12 06:22:03,658 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (= |is_prime__#in~n| is_prime__~n)) (.cse1 (= |is_prime__#in~m| is_prime__~m))) (or (and .cse0 .cse1 (<= |is_prime__#in~m| (div |is_prime__#in~n| 2)) (<= 2 is_prime__~m)) (and .cse0 .cse1 (<= is_prime__~n is_prime__~m) (< 2 is_prime__~n)))) [2022-07-12 06:22:03,658 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2022-07-12 06:22:03,658 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (and (= |is_prime__#in~n| is_prime__~n) (= |is_prime__#in~m| is_prime__~m) (<= 2 is_prime__~m) (< 2 is_prime__~n)) [2022-07-12 06:22:03,659 INFO L899 garLoopResultBuilder]: For program point L68-1(line 68) no Hoare annotation was computed. [2022-07-12 06:22:03,659 INFO L899 garLoopResultBuilder]: For program point L68-2(lines 68 70) no Hoare annotation was computed. [2022-07-12 06:22:03,661 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:22:03,662 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 06:22:03,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:22:03 BoogieIcfgContainer [2022-07-12 06:22:03,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 06:22:03,671 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 06:22:03,671 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 06:22:03,672 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 06:22:03,672 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:21:52" (3/4) ... [2022-07-12 06:22:03,674 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 06:22:03,678 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure multiple_of [2022-07-12 06:22:03,678 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mult [2022-07-12 06:22:03,678 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_prime_ [2022-07-12 06:22:03,681 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-07-12 06:22:03,681 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-12 06:22:03,681 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 06:22:03,681 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 06:22:03,695 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == 0 || ((n <= 2 && 1 <= n) && n <= n) [2022-07-12 06:22:03,709 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 06:22:03,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 06:22:03,710 INFO L158 Benchmark]: Toolchain (without parser) took 12769.16ms. Allocated memory was 94.4MB in the beginning and 199.2MB in the end (delta: 104.9MB). Free memory was 62.2MB in the beginning and 114.1MB in the end (delta: -51.9MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2022-07-12 06:22:03,710 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 94.4MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:22:03,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.63ms. Allocated memory was 94.4MB in the beginning and 127.9MB in the end (delta: 33.6MB). Free memory was 62.0MB in the beginning and 103.6MB in the end (delta: -41.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 06:22:03,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.62ms. Allocated memory is still 127.9MB. Free memory was 103.6MB in the beginning and 102.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:22:03,711 INFO L158 Benchmark]: Boogie Preprocessor took 56.19ms. Allocated memory is still 127.9MB. Free memory was 102.1MB in the beginning and 100.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:22:03,711 INFO L158 Benchmark]: RCFGBuilder took 512.05ms. Allocated memory is still 127.9MB. Free memory was 100.7MB in the beginning and 89.0MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 06:22:03,711 INFO L158 Benchmark]: TraceAbstraction took 11638.43ms. Allocated memory was 127.9MB in the beginning and 199.2MB in the end (delta: 71.3MB). Free memory was 88.3MB in the beginning and 117.3MB in the end (delta: -29.0MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. [2022-07-12 06:22:03,711 INFO L158 Benchmark]: Witness Printer took 38.18ms. Allocated memory is still 199.2MB. Free memory was 117.3MB in the beginning and 114.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 06:22:03,712 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.10ms. Allocated memory is still 94.4MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.63ms. Allocated memory was 94.4MB in the beginning and 127.9MB in the end (delta: 33.6MB). Free memory was 62.0MB in the beginning and 103.6MB in the end (delta: -41.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.62ms. Allocated memory is still 127.9MB. Free memory was 103.6MB in the beginning and 102.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.19ms. Allocated memory is still 127.9MB. Free memory was 102.1MB in the beginning and 100.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 512.05ms. Allocated memory is still 127.9MB. Free memory was 100.7MB in the beginning and 89.0MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11638.43ms. Allocated memory was 127.9MB in the beginning and 199.2MB in the end (delta: 71.3MB). Free memory was 88.3MB in the beginning and 117.3MB in the end (delta: -29.0MB). Peak memory consumption was 43.0MB. Max. memory is 16.1GB. * Witness Printer took 38.18ms. Allocated memory is still 199.2MB. Free memory was 117.3MB in the beginning and 114.1MB 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: 98]: 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 4 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 494 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 455 mSDsluCounter, 3396 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2731 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1381 IncrementalHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 665 mSDtfsCounter, 1381 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 862 GetRequests, 688 SyntacticMatches, 7 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=11, InterpolantAutomatonStates: 106, 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, 13 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 207 PreInvPairs, 248 NumberOfFragments, 122 HoareAnnotationTreeSize, 207 FomulaSimplifications, 261 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 343 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 920 NumberOfCodeBlocks, 920 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1179 ConstructedInterpolants, 0 QuantifiedInterpolants, 2999 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1038 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 24 InterpolantComputations, 8 PerfectInterpolantSequences, 287/540 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 1 specifications checked. All of them hold - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: \result == 0 || ((n <= 2 && 1 <= n) && n <= n) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-12 06:22:03,738 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 Writing output log to file Ultimate.log Result: TRUE