./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 eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-eb692b5 [2022-07-19 17:26:53,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 17:26:53,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 17:26:53,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 17:26:53,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 17:26:53,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 17:26:53,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 17:26:53,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 17:26:53,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 17:26:53,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 17:26:53,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 17:26:53,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 17:26:53,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 17:26:53,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 17:26:53,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 17:26:53,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 17:26:53,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 17:26:53,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 17:26:53,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 17:26:53,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 17:26:53,672 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 17:26:53,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 17:26:53,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 17:26:53,675 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 17:26:53,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 17:26:53,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 17:26:53,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 17:26:53,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 17:26:53,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 17:26:53,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 17:26:53,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 17:26:53,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 17:26:53,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 17:26:53,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 17:26:53,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 17:26:53,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 17:26:53,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 17:26:53,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 17:26:53,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 17:26:53,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 17:26:53,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 17:26:53,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 17:26:53,694 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 17:26:53,723 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 17:26:53,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 17:26:53,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 17:26:53,725 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 17:26:53,725 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 17:26:53,725 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 17:26:53,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 17:26:53,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 17:26:53,726 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 17:26:53,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 17:26:53,728 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 17:26:53,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 17:26:53,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 17:26:53,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 17:26:53,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 17:26:53,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 17:26:53,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 17:26:53,729 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 17:26:53,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 17:26:53,729 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 17:26:53,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 17:26:53,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 17:26:53,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 17:26:53,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 17:26:53,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:26:53,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 17:26:53,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 17:26:53,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 17:26:53,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 17:26:53,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 17:26:53,732 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 17:26:53,732 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 17:26:53,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 17:26:53,732 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-19 17:26:53,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 17:26:53,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 17:26:53,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 17:26:53,983 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 17:26:53,983 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 17:26:53,984 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Primes.c [2022-07-19 17:26:54,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47513c7b/29bfaa7680d6498882daeae980af84a9/FLAGde40f67d9 [2022-07-19 17:26:54,470 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 17:26:54,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c [2022-07-19 17:26:54,476 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47513c7b/29bfaa7680d6498882daeae980af84a9/FLAGde40f67d9 [2022-07-19 17:26:54,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47513c7b/29bfaa7680d6498882daeae980af84a9 [2022-07-19 17:26:54,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 17:26:54,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 17:26:54,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 17:26:54,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 17:26:54,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 17:26:54,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:26:54" (1/1) ... [2022-07-19 17:26:54,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@361e4d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:54, skipping insertion in model container [2022-07-19 17:26:54,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:26:54" (1/1) ... [2022-07-19 17:26:54,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 17:26:54,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 17:26:54,726 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-19 17:26:54,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:26:54,742 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 17:26:54,766 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-19 17:26:54,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:26:54,781 INFO L208 MainTranslator]: Completed translation [2022-07-19 17:26:54,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:54 WrapperNode [2022-07-19 17:26:54,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 17:26:54,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 17:26:54,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 17:26:54,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 17:26:54,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:54" (1/1) ... [2022-07-19 17:26:54,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:54" (1/1) ... [2022-07-19 17:26:54,823 INFO L137 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-07-19 17:26:54,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 17:26:54,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 17:26:54,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 17:26:54,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 17:26:54,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:54" (1/1) ... [2022-07-19 17:26:54,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:54" (1/1) ... [2022-07-19 17:26:54,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:54" (1/1) ... [2022-07-19 17:26:54,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:54" (1/1) ... [2022-07-19 17:26:54,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:54" (1/1) ... [2022-07-19 17:26:54,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:54" (1/1) ... [2022-07-19 17:26:54,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:54" (1/1) ... [2022-07-19 17:26:54,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 17:26:54,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 17:26:54,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 17:26:54,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 17:26:54,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:54" (1/1) ... [2022-07-19 17:26:54,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:26:54,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:54,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 17:26:54,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 17:26:54,988 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2022-07-19 17:26:54,988 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2022-07-19 17:26:54,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 17:26:54,989 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2022-07-19 17:26:54,989 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2022-07-19 17:26:54,989 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2022-07-19 17:26:54,990 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2022-07-19 17:26:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 17:26:54,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 17:26:54,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 17:26:55,044 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 17:26:55,045 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 17:26:55,206 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 17:26:55,212 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 17:26:55,212 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 17:26:55,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:26:55 BoogieIcfgContainer [2022-07-19 17:26:55,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 17:26:55,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 17:26:55,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 17:26:55,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 17:26:55,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 05:26:54" (1/3) ... [2022-07-19 17:26:55,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c5a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:26:55, skipping insertion in model container [2022-07-19 17:26:55,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:26:54" (2/3) ... [2022-07-19 17:26:55,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c5a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:26:55, skipping insertion in model container [2022-07-19 17:26:55,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:26:55" (3/3) ... [2022-07-19 17:26:55,233 INFO L111 eAbstractionObserver]: Analyzing ICFG Primes.c [2022-07-19 17:26:55,246 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 17:26:55,246 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 17:26:55,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 17:26:55,327 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@574710e4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4e82dfc1 [2022-07-19 17:26:55,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 17:26:55,333 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-19 17:26:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 17:26:55,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:55,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:26:55,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:55,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash 691245353, now seen corresponding path program 1 times [2022-07-19 17:26:55,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:55,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177889712] [2022-07-19 17:26:55,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:55,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:55,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:26:55,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:55,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177889712] [2022-07-19 17:26:55,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177889712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:26:55,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:26:55,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:26:55,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372946258] [2022-07-19 17:26:55,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:26:55,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:26:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:55,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:26:55,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:26:55,604 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-19 17:26:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:55,642 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2022-07-19 17:26:55,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:26:55,644 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-19 17:26:55,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:55,651 INFO L225 Difference]: With dead ends: 58 [2022-07-19 17:26:55,651 INFO L226 Difference]: Without dead ends: 49 [2022-07-19 17:26:55,654 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-19 17:26:55,657 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-19 17:26:55,658 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-19 17:26:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-19 17:26:55,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-07-19 17:26:55,701 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-19 17:26:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2022-07-19 17:26:55,704 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 15 [2022-07-19 17:26:55,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:55,705 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2022-07-19 17:26:55,706 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-19 17:26:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2022-07-19 17:26:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 17:26:55,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:55,708 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-19 17:26:55,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 17:26:55,709 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:55,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1873142352, now seen corresponding path program 1 times [2022-07-19 17:26:55,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:55,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452285954] [2022-07-19 17:26:55,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:55,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:55,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:55,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 17:26:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:26:55,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:55,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452285954] [2022-07-19 17:26:55,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452285954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:26:55,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:26:55,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:26:55,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258892724] [2022-07-19 17:26:55,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:26:55,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:26:55,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:55,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:26:55,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:26:55,859 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-19 17:26:55,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:55,917 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-07-19 17:26:55,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:26:55,917 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-19 17:26:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:55,920 INFO L225 Difference]: With dead ends: 71 [2022-07-19 17:26:55,920 INFO L226 Difference]: Without dead ends: 51 [2022-07-19 17:26:55,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:26:55,922 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-19 17:26:55,922 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-19 17:26:55,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-19 17:26:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-19 17:26:55,931 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-19 17:26:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2022-07-19 17:26:55,933 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 22 [2022-07-19 17:26:55,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:55,933 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2022-07-19 17:26:55,933 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-19 17:26:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-07-19 17:26:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 17:26:55,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:55,936 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-19 17:26:55,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 17:26:55,936 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:55,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:55,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2039437329, now seen corresponding path program 1 times [2022-07-19 17:26:55,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:55,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484736961] [2022-07-19 17:26:55,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:55,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 17:26:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:26:56,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:56,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484736961] [2022-07-19 17:26:56,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484736961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:26:56,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:26:56,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:26:56,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058119112] [2022-07-19 17:26:56,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:26:56,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:26:56,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:56,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:26:56,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:26:56,069 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-19 17:26:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:56,119 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-07-19 17:26:56,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:26:56,122 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-19 17:26:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:56,124 INFO L225 Difference]: With dead ends: 57 [2022-07-19 17:26:56,125 INFO L226 Difference]: Without dead ends: 53 [2022-07-19 17:26:56,126 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-19 17:26:56,128 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-19 17:26:56,130 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-19 17:26:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-19 17:26:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-19 17:26:56,142 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-19 17:26:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2022-07-19 17:26:56,146 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 23 [2022-07-19 17:26:56,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:56,147 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2022-07-19 17:26:56,147 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-19 17:26:56,147 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2022-07-19 17:26:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 17:26:56,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:56,151 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-19 17:26:56,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 17:26:56,151 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash -502167403, now seen corresponding path program 1 times [2022-07-19 17:26:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:56,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92117069] [2022-07-19 17:26:56,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:56,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 17:26:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 17:26:56,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:56,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92117069] [2022-07-19 17:26:56,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92117069] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:26:56,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:26:56,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:26:56,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9005755] [2022-07-19 17:26:56,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:26:56,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:26:56,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:56,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:26:56,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:26:56,250 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-19 17:26:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:56,311 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2022-07-19 17:26:56,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:26:56,312 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-19 17:26:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:56,314 INFO L225 Difference]: With dead ends: 59 [2022-07-19 17:26:56,314 INFO L226 Difference]: Without dead ends: 55 [2022-07-19 17:26:56,314 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-19 17:26:56,315 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-19 17:26:56,316 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-19 17:26:56,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-19 17:26:56,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-07-19 17:26:56,324 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-19 17:26:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2022-07-19 17:26:56,325 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 24 [2022-07-19 17:26:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:56,325 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2022-07-19 17:26:56,325 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-19 17:26:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2022-07-19 17:26:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 17:26:56,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:56,326 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-19 17:26:56,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 17:26:56,327 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:56,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:56,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1717699423, now seen corresponding path program 1 times [2022-07-19 17:26:56,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:56,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327425792] [2022-07-19 17:26:56,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:56,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 17:26:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,403 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-19 17:26:56,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:56,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327425792] [2022-07-19 17:26:56,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327425792] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:26:56,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838941417] [2022-07-19 17:26:56,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:56,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:56,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:56,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:26:56,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 17:26:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:56,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 17:26:56,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:26:56,560 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-19 17:26:56,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:26:56,754 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-19 17:26:56,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838941417] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:26:56,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:26:56,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2022-07-19 17:26:56,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286734868] [2022-07-19 17:26:56,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:26:56,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 17:26:56,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:56,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 17:26:56,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:26:56,762 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-19 17:26:56,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:56,874 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2022-07-19 17:26:56,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 17:26:56,875 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-19 17:26:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:56,879 INFO L225 Difference]: With dead ends: 68 [2022-07-19 17:26:56,879 INFO L226 Difference]: Without dead ends: 51 [2022-07-19 17:26:56,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-07-19 17:26:56,883 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.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:26:56,884 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.1s Time] [2022-07-19 17:26:56,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-19 17:26:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-19 17:26:56,893 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-19 17:26:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-07-19 17:26:56,898 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 31 [2022-07-19 17:26:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:56,899 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2022-07-19 17:26:56,900 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-19 17:26:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-07-19 17:26:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 17:26:56,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:56,904 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-19 17:26:56,932 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-19 17:26:57,127 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-19 17:26:57,128 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:57,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:57,128 INFO L85 PathProgramCache]: Analyzing trace with hash 380831863, now seen corresponding path program 1 times [2022-07-19 17:26:57,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:57,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690309294] [2022-07-19 17:26:57,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:57,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:57,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:57,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 17:26:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:57,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:57,338 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-19 17:26:57,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:57,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690309294] [2022-07-19 17:26:57,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690309294] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:26:57,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908837120] [2022-07-19 17:26:57,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:57,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:57,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:57,341 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:26:57,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 17:26:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:57,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 17:26:57,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:26:57,557 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-19 17:26:57,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:26:57,812 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-19 17:26:57,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908837120] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:26:57,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:26:57,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2022-07-19 17:26:57,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756773330] [2022-07-19 17:26:57,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:26:57,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 17:26:57,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:57,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 17:26:57,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-07-19 17:26:57,815 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-19 17:26:58,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:58,118 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2022-07-19 17:26:58,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 17:26:58,119 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-19 17:26:58,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:58,120 INFO L225 Difference]: With dead ends: 71 [2022-07-19 17:26:58,120 INFO L226 Difference]: Without dead ends: 54 [2022-07-19 17:26:58,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2022-07-19 17:26:58,121 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.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:26:58,122 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.1s Time] [2022-07-19 17:26:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-19 17:26:58,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2022-07-19 17:26:58,126 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-19 17:26:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2022-07-19 17:26:58,127 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 32 [2022-07-19 17:26:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:58,127 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2022-07-19 17:26:58,128 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-19 17:26:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2022-07-19 17:26:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 17:26:58,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:58,129 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-19 17:26:58,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 17:26:58,329 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-19 17:26:58,330 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:58,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:58,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1826216781, now seen corresponding path program 1 times [2022-07-19 17:26:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:58,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405644141] [2022-07-19 17:26:58,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:58,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 17:26:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,416 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-19 17:26:58,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:58,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405644141] [2022-07-19 17:26:58,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405644141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:26:58,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:26:58,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:26:58,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476409018] [2022-07-19 17:26:58,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:26:58,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:26:58,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:58,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:26:58,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:26:58,419 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-19 17:26:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:58,455 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-07-19 17:26:58,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:26:58,456 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-19 17:26:58,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:58,457 INFO L225 Difference]: With dead ends: 73 [2022-07-19 17:26:58,457 INFO L226 Difference]: Without dead ends: 53 [2022-07-19 17:26:58,457 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-19 17:26:58,458 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-19 17:26:58,458 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-19 17:26:58,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-19 17:26:58,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-07-19 17:26:58,463 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-19 17:26:58,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2022-07-19 17:26:58,464 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 34 [2022-07-19 17:26:58,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:58,465 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2022-07-19 17:26:58,465 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-19 17:26:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2022-07-19 17:26:58,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 17:26:58,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:58,467 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-19 17:26:58,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 17:26:58,467 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:58,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:58,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1825803044, now seen corresponding path program 1 times [2022-07-19 17:26:58,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:58,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217895544] [2022-07-19 17:26:58,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:58,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 17:26:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 17:26:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 17:26:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,518 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-19 17:26:58,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:58,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217895544] [2022-07-19 17:26:58,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217895544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:26:58,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:26:58,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:26:58,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368044242] [2022-07-19 17:26:58,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:26:58,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:26:58,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:58,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:26:58,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:26:58,526 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-19 17:26:58,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:58,569 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2022-07-19 17:26:58,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:26:58,570 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-19 17:26:58,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:58,571 INFO L225 Difference]: With dead ends: 104 [2022-07-19 17:26:58,571 INFO L226 Difference]: Without dead ends: 51 [2022-07-19 17:26:58,572 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-19 17:26:58,572 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-19 17:26:58,573 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-19 17:26:58,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-19 17:26:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-07-19 17:26:58,587 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-19 17:26:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-07-19 17:26:58,588 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 52 [2022-07-19 17:26:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:58,588 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-07-19 17:26:58,588 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-19 17:26:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-07-19 17:26:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 17:26:58,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:58,590 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-19 17:26:58,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 17:26:58,591 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:58,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash 654757234, now seen corresponding path program 1 times [2022-07-19 17:26:58,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:58,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339424401] [2022-07-19 17:26:58,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:58,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 17:26:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:26:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 17:26:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,664 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-19 17:26:58,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:58,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339424401] [2022-07-19 17:26:58,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339424401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:26:58,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714782946] [2022-07-19 17:26:58,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:58,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:58,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:58,667 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:26:58,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 17:26:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:58,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 17:26:58,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:26:58,742 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-19 17:26:58,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:26:58,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714782946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:26:58,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:26:58,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-07-19 17:26:58,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524259184] [2022-07-19 17:26:58,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:26:58,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:26:58,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:58,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:26:58,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:26:58,745 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-19 17:26:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:58,778 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-07-19 17:26:58,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:26:58,779 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-19 17:26:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:58,780 INFO L225 Difference]: With dead ends: 96 [2022-07-19 17:26:58,780 INFO L226 Difference]: Without dead ends: 51 [2022-07-19 17:26:58,781 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-19 17:26:58,781 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-19 17:26:58,782 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-19 17:26:58,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-19 17:26:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-19 17:26:58,786 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-19 17:26:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-07-19 17:26:58,787 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 53 [2022-07-19 17:26:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:58,788 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-07-19 17:26:58,788 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-19 17:26:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-07-19 17:26:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 17:26:58,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:58,789 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-19 17:26:58,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 17:26:59,012 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-19 17:26:59,013 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:26:59,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:26:59,013 INFO L85 PathProgramCache]: Analyzing trace with hash 689204116, now seen corresponding path program 1 times [2022-07-19 17:26:59,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:26:59,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841699529] [2022-07-19 17:26:59,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:59,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:26:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:26:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 17:26:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 17:26:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 17:26:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 17:26:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:26:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,145 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-19 17:26:59,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:26:59,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841699529] [2022-07-19 17:26:59,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841699529] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:26:59,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555061213] [2022-07-19 17:26:59,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:26:59,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:26:59,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:26:59,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:26:59,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 17:26:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:26:59,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 17:26:59,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:26:59,311 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-19 17:26:59,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:26:59,586 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-19 17:26:59,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555061213] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:26:59,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:26:59,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-19 17:26:59,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596548012] [2022-07-19 17:26:59,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:26:59,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 17:26:59,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:26:59,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 17:26:59,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-07-19 17:26:59,589 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-19 17:26:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:26:59,840 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2022-07-19 17:26:59,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 17:26:59,840 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-19 17:26:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:26:59,841 INFO L225 Difference]: With dead ends: 90 [2022-07-19 17:26:59,841 INFO L226 Difference]: Without dead ends: 59 [2022-07-19 17:26:59,842 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-19 17:26:59,843 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-19 17:26:59,843 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-19 17:26:59,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-19 17:26:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2022-07-19 17:26:59,848 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-19 17:26:59,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2022-07-19 17:26:59,848 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 62 [2022-07-19 17:26:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:26:59,849 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2022-07-19 17:26:59,849 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-19 17:26:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2022-07-19 17:26:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-19 17:26:59,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:26:59,850 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-19 17:26:59,875 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-19 17:27:00,055 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-19 17:27:00,055 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:00,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:00,056 INFO L85 PathProgramCache]: Analyzing trace with hash -729550012, now seen corresponding path program 2 times [2022-07-19 17:27:00,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:00,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796971618] [2022-07-19 17:27:00,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:00,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:00,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:00,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 17:27:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:00,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 17:27:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:00,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 17:27:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:00,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 17:27:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:00,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 17:27:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:00,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:27:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:00,205 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-19 17:27:00,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:00,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796971618] [2022-07-19 17:27:00,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796971618] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:00,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542318351] [2022-07-19 17:27:00,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 17:27:00,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:00,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:00,208 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:00,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 17:27:00,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 17:27:00,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:27:00,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 17:27:00,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:00,485 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-19 17:27:00,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:01,020 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-19 17:27:01,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542318351] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:01,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:01,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 22 [2022-07-19 17:27:01,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890102436] [2022-07-19 17:27:01,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:01,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 17:27:01,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:01,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 17:27:01,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-07-19 17:27:01,022 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-19 17:27:01,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:01,389 INFO L93 Difference]: Finished difference Result 150 states and 199 transitions. [2022-07-19 17:27:01,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 17:27:01,392 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-19 17:27:01,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:01,393 INFO L225 Difference]: With dead ends: 150 [2022-07-19 17:27:01,394 INFO L226 Difference]: Without dead ends: 95 [2022-07-19 17:27:01,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2022-07-19 17:27:01,396 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 100 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:27:01,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 335 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:27:01,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-19 17:27:01,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2022-07-19 17:27:01,407 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-19 17:27:01,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2022-07-19 17:27:01,413 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 71 [2022-07-19 17:27:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:01,413 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2022-07-19 17:27:01,414 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-19 17:27:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2022-07-19 17:27:01,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-19 17:27:01,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:01,417 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-19 17:27:01,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:01,641 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-19 17:27:01,641 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:01,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1100264158, now seen corresponding path program 1 times [2022-07-19 17:27:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:01,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110487096] [2022-07-19 17:27:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:01,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 17:27:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 17:27:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 17:27:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 17:27:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 17:27:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:27:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,719 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-19 17:27:01,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:01,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110487096] [2022-07-19 17:27:01,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110487096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:27:01,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:27:01,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:27:01,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085395123] [2022-07-19 17:27:01,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:27:01,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:27:01,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:01,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:27:01,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:27:01,721 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-19 17:27:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:01,760 INFO L93 Difference]: Finished difference Result 178 states and 250 transitions. [2022-07-19 17:27:01,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:27:01,763 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-19 17:27:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:01,765 INFO L225 Difference]: With dead ends: 178 [2022-07-19 17:27:01,765 INFO L226 Difference]: Without dead ends: 91 [2022-07-19 17:27:01,766 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-19 17:27:01,766 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-19 17:27:01,766 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-19 17:27:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-19 17:27:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-07-19 17:27:01,773 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-19 17:27:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2022-07-19 17:27:01,774 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 78 [2022-07-19 17:27:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:01,774 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2022-07-19 17:27:01,775 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-19 17:27:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2022-07-19 17:27:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-19 17:27:01,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:27:01,776 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-19 17:27:01,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 17:27:01,776 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:27:01,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:27:01,777 INFO L85 PathProgramCache]: Analyzing trace with hash -862294776, now seen corresponding path program 2 times [2022-07-19 17:27:01,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:27:01,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377899773] [2022-07-19 17:27:01,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:27:01,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:27:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 17:27:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 17:27:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 17:27:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 17:27:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 17:27:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 17:27:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 17:27:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:27:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:27:01,940 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-19 17:27:01,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:27:01,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377899773] [2022-07-19 17:27:01,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377899773] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:27:01,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615819408] [2022-07-19 17:27:01,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 17:27:01,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:01,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:27:01,943 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 17:27:01,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 17:27:02,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 17:27:02,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 17:27:02,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 17:27:02,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:27:02,217 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-19 17:27:02,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:27:03,524 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-19 17:27:03,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615819408] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:27:03,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:27:03,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 25 [2022-07-19 17:27:03,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589938578] [2022-07-19 17:27:03,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:27:03,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-19 17:27:03,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:27:03,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-19 17:27:03,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2022-07-19 17:27:03,528 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-19 17:27:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:27:03,771 INFO L93 Difference]: Finished difference Result 152 states and 206 transitions. [2022-07-19 17:27:03,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 17:27:03,773 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-19 17:27:03,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:27:03,774 INFO L225 Difference]: With dead ends: 152 [2022-07-19 17:27:03,774 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 17:27:03,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=816, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 17:27:03,775 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-19 17:27:03,776 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-19 17:27:03,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 17:27:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 17:27:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 17:27:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 17:27:03,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2022-07-19 17:27:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:27:03,776 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 17:27:03,777 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-19 17:27:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 17:27:03,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 17:27:03,781 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 17:27:03,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 17:27:03,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:27:03,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 17:27:04,170 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-19 17:27:04,170 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 34) no Hoare annotation was computed. [2022-07-19 17:27:04,171 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-07-19 17:27:04,171 INFO L899 garLoopResultBuilder]: For program point multiple_ofFINAL(lines 31 45) no Hoare annotation was computed. [2022-07-19 17:27:04,171 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-19 17:27:04,171 INFO L899 garLoopResultBuilder]: For program point L44-1(line 44) no Hoare annotation was computed. [2022-07-19 17:27:04,171 INFO L902 garLoopResultBuilder]: At program point multiple_ofENTRY(lines 31 45) the Hoare annotation is: true [2022-07-19 17:27:04,171 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2022-07-19 17:27:04,171 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2022-07-19 17:27:04,171 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-19 17:27:04,172 INFO L899 garLoopResultBuilder]: For program point multiple_ofEXIT(lines 31 45) no Hoare annotation was computed. [2022-07-19 17:27:04,172 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2022-07-19 17:27:04,172 INFO L899 garLoopResultBuilder]: For program point L36-1(line 36) no Hoare annotation was computed. [2022-07-19 17:27:04,172 INFO L902 garLoopResultBuilder]: At program point multENTRY(lines 17 28) the Hoare annotation is: true [2022-07-19 17:27:04,172 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-19 17:27:04,172 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-07-19 17:27:04,172 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2022-07-19 17:27:04,172 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2022-07-19 17:27:04,173 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-19 17:27:04,173 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-07-19 17:27:04,173 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2022-07-19 17:27:04,174 INFO L899 garLoopResultBuilder]: For program point multFINAL(lines 17 28) no Hoare annotation was computed. [2022-07-19 17:27:04,174 INFO L899 garLoopResultBuilder]: For program point multEXIT(lines 17 28) no Hoare annotation was computed. [2022-07-19 17:27:04,174 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-07-19 17:27:04,174 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 17:27:04,174 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-19 17:27:04,174 INFO L899 garLoopResultBuilder]: For program point L97-2(line 97) no Hoare annotation was computed. [2022-07-19 17:27:04,174 INFO L899 garLoopResultBuilder]: For program point L97-4(lines 97 101) no Hoare annotation was computed. [2022-07-19 17:27:04,175 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-07-19 17:27:04,175 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2022-07-19 17:27:04,175 INFO L902 garLoopResultBuilder]: At program point L100(lines 76 102) the Hoare annotation is: true [2022-07-19 17:27:04,175 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-07-19 17:27:04,175 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 17:27:04,175 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 17:27:04,175 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 17:27:04,176 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 98) no Hoare annotation was computed. [2022-07-19 17:27:04,176 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-19 17:27:04,176 INFO L899 garLoopResultBuilder]: For program point L53-1(line 53) no Hoare annotation was computed. [2022-07-19 17:27:04,177 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-19 17:27:04,177 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 82) no Hoare annotation was computed. [2022-07-19 17:27:04,177 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 72) no Hoare annotation was computed. [2022-07-19 17:27:04,177 INFO L899 garLoopResultBuilder]: For program point is_prime_EXIT(lines 57 74) no Hoare annotation was computed. [2022-07-19 17:27:04,177 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 73) no Hoare annotation was computed. [2022-07-19 17:27:04,177 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 63) no Hoare annotation was computed. [2022-07-19 17:27:04,178 INFO L899 garLoopResultBuilder]: For program point is_prime_FINAL(lines 57 74) no Hoare annotation was computed. [2022-07-19 17:27:04,178 INFO L902 garLoopResultBuilder]: At program point is_prime_ENTRY(lines 57 74) the Hoare annotation is: true [2022-07-19 17:27:04,178 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-07-19 17:27:04,178 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-19 17:27:04,179 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2022-07-19 17:27:04,179 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-19 17:27:04,179 INFO L899 garLoopResultBuilder]: For program point L68-1(line 68) no Hoare annotation was computed. [2022-07-19 17:27:04,179 INFO L899 garLoopResultBuilder]: For program point L68-2(lines 68 70) no Hoare annotation was computed. [2022-07-19 17:27:04,182 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:27:04,184 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 17:27:04,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 05:27:04 BoogieIcfgContainer [2022-07-19 17:27:04,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 17:27:04,199 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 17:27:04,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 17:27:04,200 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 17:27:04,200 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:26:55" (3/4) ... [2022-07-19 17:27:04,203 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 17:27:04,208 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure multiple_of [2022-07-19 17:27:04,208 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mult [2022-07-19 17:27:04,208 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_prime_ [2022-07-19 17:27:04,215 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-07-19 17:27:04,215 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-19 17:27:04,215 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 17:27:04,216 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 17:27:04,238 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == 0 || ((n <= 2 && 1 <= n) && n <= n) [2022-07-19 17:27:04,262 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 17:27:04,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 17:27:04,263 INFO L158 Benchmark]: Toolchain (without parser) took 9766.85ms. Allocated memory was 92.3MB in the beginning and 188.7MB in the end (delta: 96.5MB). Free memory was 57.3MB in the beginning and 90.1MB in the end (delta: -32.8MB). Peak memory consumption was 63.0MB. Max. memory is 16.1GB. [2022-07-19 17:27:04,263 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 92.3MB. Free memory was 64.6MB in the beginning and 64.5MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:27:04,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.83ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 57.1MB in the beginning and 105.2MB in the end (delta: -48.2MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-07-19 17:27:04,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.36ms. Allocated memory is still 130.0MB. Free memory was 105.2MB in the beginning and 103.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:27:04,265 INFO L158 Benchmark]: Boogie Preprocessor took 46.98ms. Allocated memory is still 130.0MB. Free memory was 103.8MB in the beginning and 102.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 17:27:04,265 INFO L158 Benchmark]: RCFGBuilder took 341.58ms. Allocated memory is still 130.0MB. Free memory was 102.6MB in the beginning and 90.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 17:27:04,266 INFO L158 Benchmark]: TraceAbstraction took 8982.56ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 90.1MB in the beginning and 94.3MB in the end (delta: -4.2MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2022-07-19 17:27:04,266 INFO L158 Benchmark]: Witness Printer took 63.20ms. Allocated memory is still 188.7MB. Free memory was 94.3MB in the beginning and 90.1MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 17:27:04,271 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.23ms. Allocated memory is still 92.3MB. Free memory was 64.6MB in the beginning and 64.5MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.83ms. Allocated memory was 92.3MB in the beginning and 130.0MB in the end (delta: 37.7MB). Free memory was 57.1MB in the beginning and 105.2MB in the end (delta: -48.2MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.36ms. Allocated memory is still 130.0MB. Free memory was 105.2MB in the beginning and 103.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.98ms. Allocated memory is still 130.0MB. Free memory was 103.8MB in the beginning and 102.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 341.58ms. Allocated memory is still 130.0MB. Free memory was 102.6MB in the beginning and 90.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8982.56ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 90.1MB in the beginning and 94.3MB in the end (delta: -4.2MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * Witness Printer took 63.20ms. Allocated memory is still 188.7MB. Free memory was 94.3MB in the beginning and 90.1MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. 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: 8.9s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 494 SdHoareTripleChecker+Valid, 0.9s 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, 1374 IncrementalHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 665 mSDtfsCounter, 1374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 862 GetRequests, 688 SyntacticMatches, 7 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.4s 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.1s 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.3s SatisfiabilityAnalysisTime, 4.6s 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-19 17:27:04,318 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