./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 26d01a9c 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-?-26d01a9 [2023-02-17 02:34:01,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:34:01,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:34:01,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:34:01,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:34:01,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:34:01,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:34:01,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:34:01,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:34:01,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:34:01,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:34:01,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:34:01,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:34:01,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:34:01,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:34:01,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:34:01,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:34:01,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:34:01,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:34:01,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:34:01,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:34:01,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:34:01,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:34:01,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:34:01,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:34:01,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:34:01,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:34:01,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:34:01,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:34:01,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:34:01,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:34:01,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:34:01,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:34:01,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:34:01,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:34:01,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:34:01,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:34:01,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:34:01,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:34:01,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:34:01,626 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:34:01,627 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 02:34:01,657 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:34:01,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:34:01,658 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:34:01,658 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:34:01,659 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:34:01,659 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:34:01,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:34:01,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:34:01,660 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:34:01,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:34:01,661 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:34:01,661 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:34:01,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:34:01,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:34:01,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 02:34:01,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:34:01,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 02:34:01,662 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:34:01,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 02:34:01,662 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:34:01,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 02:34:01,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:34:01,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:34:01,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:34:01,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:34:01,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:34:01,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:34:01,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 02:34:01,664 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:34:01,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:34:01,664 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:34:01,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 02:34:01,665 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:34:01,665 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:34:01,665 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:34:01,665 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-02-17 02:34:01,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:34:01,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:34:01,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:34:01,958 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:34:01,960 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:34:01,961 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Primes.c [2023-02-17 02:34:03,091 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:34:03,276 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:34:03,276 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c [2023-02-17 02:34:03,281 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e458f57a4/50e4c9bfa45442f6868c856317ff9d96/FLAG16909d506 [2023-02-17 02:34:03,293 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e458f57a4/50e4c9bfa45442f6868c856317ff9d96 [2023-02-17 02:34:03,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:34:03,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:34:03,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:34:03,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:34:03,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:34:03,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:34:03" (1/1) ... [2023-02-17 02:34:03,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36237e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:34:03, skipping insertion in model container [2023-02-17 02:34:03,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:34:03" (1/1) ... [2023-02-17 02:34:03,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:34:03,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:34:03,471 WARN L237 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] [2023-02-17 02:34:03,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:34:03,482 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:34:03,497 WARN L237 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] [2023-02-17 02:34:03,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:34:03,508 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:34:03,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:34:03 WrapperNode [2023-02-17 02:34:03,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:34:03,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:34:03,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:34:03,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:34:03,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:34:03" (1/1) ... [2023-02-17 02:34:03,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:34:03" (1/1) ... [2023-02-17 02:34:03,532 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2023-02-17 02:34:03,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:34:03,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:34:03,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:34:03,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:34:03,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:34:03" (1/1) ... [2023-02-17 02:34:03,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:34:03" (1/1) ... [2023-02-17 02:34:03,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:34:03" (1/1) ... [2023-02-17 02:34:03,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:34:03" (1/1) ... [2023-02-17 02:34:03,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:34:03" (1/1) ... [2023-02-17 02:34:03,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:34:03" (1/1) ... [2023-02-17 02:34:03,549 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:34:03" (1/1) ... [2023-02-17 02:34:03,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:34:03" (1/1) ... [2023-02-17 02:34:03,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:34:03,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:34:03,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:34:03,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:34:03,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:34:03" (1/1) ... [2023-02-17 02:34:03,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:34:03,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:34:03,586 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) [2023-02-17 02:34:03,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 02:34:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2023-02-17 02:34:03,628 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2023-02-17 02:34:03,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:34:03,629 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2023-02-17 02:34:03,629 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2023-02-17 02:34:03,633 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2023-02-17 02:34:03,634 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2023-02-17 02:34:03,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 02:34:03,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:34:03,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:34:03,706 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:34:03,708 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:34:03,905 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:34:03,919 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:34:03,932 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 02:34:03,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:34:03 BoogieIcfgContainer [2023-02-17 02:34:03,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:34:03,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:34:03,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:34:03,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:34:03,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:34:03" (1/3) ... [2023-02-17 02:34:03,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a2fe3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:34:03, skipping insertion in model container [2023-02-17 02:34:03,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:34:03" (2/3) ... [2023-02-17 02:34:03,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a2fe3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:34:03, skipping insertion in model container [2023-02-17 02:34:03,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:34:03" (3/3) ... [2023-02-17 02:34:03,942 INFO L112 eAbstractionObserver]: Analyzing ICFG Primes.c [2023-02-17 02:34:04,000 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:34:04,000 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 02:34:04,104 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:34:04,110 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@551aa81d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:34:04,111 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 02:34:04,114 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) [2023-02-17 02:34:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 02:34:04,122 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:34:04,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:34:04,124 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:34:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:34:04,131 INFO L85 PathProgramCache]: Analyzing trace with hash 691245353, now seen corresponding path program 1 times [2023-02-17 02:34:04,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:34:04,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102454009] [2023-02-17 02:34:04,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:04,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:34:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:04,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:34:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:34:04,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:34:04,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102454009] [2023-02-17 02:34:04,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102454009] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:34:04,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:34:04,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 02:34:04,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092656094] [2023-02-17 02:34:04,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:34:04,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 02:34:04,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:34:04,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 02:34:04,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 02:34:04,374 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) [2023-02-17 02:34:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:34:04,443 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2023-02-17 02:34:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 02:34:04,446 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 [2023-02-17 02:34:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:34:04,453 INFO L225 Difference]: With dead ends: 58 [2023-02-17 02:34:04,454 INFO L226 Difference]: Without dead ends: 49 [2023-02-17 02:34:04,456 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 [2023-02-17 02:34:04,461 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 [2023-02-17 02:34:04,463 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] [2023-02-17 02:34:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-17 02:34:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-02-17 02:34:04,500 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) [2023-02-17 02:34:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2023-02-17 02:34:04,504 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 15 [2023-02-17 02:34:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:34:04,506 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2023-02-17 02:34:04,506 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) [2023-02-17 02:34:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2023-02-17 02:34:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 02:34:04,510 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:34:04,511 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] [2023-02-17 02:34:04,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 02:34:04,511 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:34:04,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:34:04,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1873142352, now seen corresponding path program 1 times [2023-02-17 02:34:04,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:34:04,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048088697] [2023-02-17 02:34:04,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:04,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:34:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:04,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:34:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:04,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-17 02:34:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:34:04,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:34:04,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048088697] [2023-02-17 02:34:04,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048088697] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:34:04,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:34:04,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 02:34:04,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888980795] [2023-02-17 02:34:04,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:34:04,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 02:34:04,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:34:04,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 02:34:04,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:34:04,714 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) [2023-02-17 02:34:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:34:04,780 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2023-02-17 02:34:04,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 02:34:04,781 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 [2023-02-17 02:34:04,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:34:04,784 INFO L225 Difference]: With dead ends: 71 [2023-02-17 02:34:04,785 INFO L226 Difference]: Without dead ends: 51 [2023-02-17 02:34:04,786 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 [2023-02-17 02:34:04,787 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 [2023-02-17 02:34:04,789 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] [2023-02-17 02:34:04,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-17 02:34:04,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-17 02:34:04,800 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) [2023-02-17 02:34:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2023-02-17 02:34:04,805 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 22 [2023-02-17 02:34:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:34:04,806 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2023-02-17 02:34:04,806 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) [2023-02-17 02:34:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2023-02-17 02:34:04,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 02:34:04,809 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:34:04,810 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] [2023-02-17 02:34:04,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 02:34:04,810 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:34:04,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:34:04,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2039437329, now seen corresponding path program 1 times [2023-02-17 02:34:04,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:34:04,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186481537] [2023-02-17 02:34:04,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:04,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:34:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:04,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:34:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:04,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 02:34:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:34:04,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:34:04,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186481537] [2023-02-17 02:34:04,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186481537] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:34:04,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:34:04,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 02:34:04,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721771723] [2023-02-17 02:34:04,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:34:04,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 02:34:04,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:34:04,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 02:34:04,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:34:04,997 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) [2023-02-17 02:34:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:34:05,061 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2023-02-17 02:34:05,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:34:05,062 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 [2023-02-17 02:34:05,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:34:05,064 INFO L225 Difference]: With dead ends: 57 [2023-02-17 02:34:05,065 INFO L226 Difference]: Without dead ends: 53 [2023-02-17 02:34:05,065 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 [2023-02-17 02:34:05,067 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, 6 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 [2023-02-17 02:34:05,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 244 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:34:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-17 02:34:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-02-17 02:34:05,078 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) [2023-02-17 02:34:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2023-02-17 02:34:05,081 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 23 [2023-02-17 02:34:05,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:34:05,082 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2023-02-17 02:34:05,083 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) [2023-02-17 02:34:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2023-02-17 02:34:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 02:34:05,085 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:34:05,086 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] [2023-02-17 02:34:05,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 02:34:05,086 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:34:05,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:34:05,087 INFO L85 PathProgramCache]: Analyzing trace with hash -502167403, now seen corresponding path program 1 times [2023-02-17 02:34:05,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:34:05,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456154340] [2023-02-17 02:34:05,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:05,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:34:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:05,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:34:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:05,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 02:34:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 02:34:05,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:34:05,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456154340] [2023-02-17 02:34:05,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456154340] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:34:05,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:34:05,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:34:05,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960615748] [2023-02-17 02:34:05,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:34:05,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:34:05,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:34:05,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:34:05,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:34:05,164 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) [2023-02-17 02:34:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:34:05,220 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2023-02-17 02:34:05,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:34:05,220 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 [2023-02-17 02:34:05,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:34:05,224 INFO L225 Difference]: With dead ends: 59 [2023-02-17 02:34:05,226 INFO L226 Difference]: Without dead ends: 55 [2023-02-17 02:34:05,227 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 [2023-02-17 02:34:05,228 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 [2023-02-17 02:34:05,233 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] [2023-02-17 02:34:05,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-17 02:34:05,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2023-02-17 02:34:05,243 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) [2023-02-17 02:34:05,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2023-02-17 02:34:05,244 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 24 [2023-02-17 02:34:05,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:34:05,244 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2023-02-17 02:34:05,245 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) [2023-02-17 02:34:05,245 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2023-02-17 02:34:05,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-17 02:34:05,247 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:34:05,247 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] [2023-02-17 02:34:05,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 02:34:05,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:34:05,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:34:05,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1717699423, now seen corresponding path program 1 times [2023-02-17 02:34:05,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:34:05,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078997340] [2023-02-17 02:34:05,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:05,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:34:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:05,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:34:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 02:34:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:05,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 02:34:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:34:05,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:34:05,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078997340] [2023-02-17 02:34:05,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078997340] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:34:05,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754354873] [2023-02-17 02:34:05,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:05,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:34:05,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:34:05,365 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) [2023-02-17 02:34:05,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 02:34:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:05,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 02:34:05,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:34:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 02:34:05,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:34:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:34:05,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754354873] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:34:05,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:34:05,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2023-02-17 02:34:05,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205991473] [2023-02-17 02:34:05,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:34:05,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 02:34:05,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:34:05,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 02:34:05,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-17 02:34:05,630 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) [2023-02-17 02:34:05,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:34:05,737 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2023-02-17 02:34:05,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 02:34:05,738 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 [2023-02-17 02:34:05,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:34:05,740 INFO L225 Difference]: With dead ends: 68 [2023-02-17 02:34:05,740 INFO L226 Difference]: Without dead ends: 51 [2023-02-17 02:34:05,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2023-02-17 02:34:05,744 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 26 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:34:05,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 373 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:34:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-17 02:34:05,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-17 02:34:05,754 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) [2023-02-17 02:34:05,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2023-02-17 02:34:05,754 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 31 [2023-02-17 02:34:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:34:05,755 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2023-02-17 02:34:05,755 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) [2023-02-17 02:34:05,755 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2023-02-17 02:34:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 02:34:05,757 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:34:05,757 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] [2023-02-17 02:34:05,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 02:34:05,966 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 [2023-02-17 02:34:05,967 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:34:05,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:34:05,968 INFO L85 PathProgramCache]: Analyzing trace with hash 380831863, now seen corresponding path program 1 times [2023-02-17 02:34:05,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:34:05,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120290969] [2023-02-17 02:34:05,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:05,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:34:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:06,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:34:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:06,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 02:34:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:06,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 02:34:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:34:06,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:34:06,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120290969] [2023-02-17 02:34:06,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120290969] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:34:06,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825480074] [2023-02-17 02:34:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:06,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:34:06,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:34:06,177 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) [2023-02-17 02:34:06,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 02:34:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:06,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 02:34:06,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:34:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:34:06,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:34:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 02:34:06,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825480074] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:34:06,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:34:06,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2023-02-17 02:34:06,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157627350] [2023-02-17 02:34:06,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:34:06,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-17 02:34:06,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:34:06,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-17 02:34:06,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2023-02-17 02:34:06,552 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) [2023-02-17 02:34:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:34:06,792 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2023-02-17 02:34:06,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 02:34:06,793 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 [2023-02-17 02:34:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:34:06,794 INFO L225 Difference]: With dead ends: 71 [2023-02-17 02:34:06,794 INFO L226 Difference]: Without dead ends: 54 [2023-02-17 02:34:06,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 49 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2023-02-17 02:34:06,796 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 50 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:34:06,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 497 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:34:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-02-17 02:34:06,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2023-02-17 02:34:06,801 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) [2023-02-17 02:34:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2023-02-17 02:34:06,802 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 32 [2023-02-17 02:34:06,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:34:06,802 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2023-02-17 02:34:06,803 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) [2023-02-17 02:34:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2023-02-17 02:34:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-17 02:34:06,804 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:34:06,804 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] [2023-02-17 02:34:06,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 02:34:07,009 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 [2023-02-17 02:34:07,010 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:34:07,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:34:07,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1826216781, now seen corresponding path program 1 times [2023-02-17 02:34:07,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:34:07,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852832727] [2023-02-17 02:34:07,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:07,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:34:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:34:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 02:34:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 02:34:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 02:34:07,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:34:07,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852832727] [2023-02-17 02:34:07,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852832727] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:34:07,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:34:07,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 02:34:07,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177204771] [2023-02-17 02:34:07,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:34:07,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 02:34:07,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:34:07,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 02:34:07,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:34:07,137 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) [2023-02-17 02:34:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:34:07,174 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2023-02-17 02:34:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 02:34:07,175 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 [2023-02-17 02:34:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:34:07,177 INFO L225 Difference]: With dead ends: 73 [2023-02-17 02:34:07,177 INFO L226 Difference]: Without dead ends: 53 [2023-02-17 02:34:07,177 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 [2023-02-17 02:34:07,178 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 26 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:34:07,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 220 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:34:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-17 02:34:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2023-02-17 02:34:07,189 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) [2023-02-17 02:34:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2023-02-17 02:34:07,191 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 34 [2023-02-17 02:34:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:34:07,191 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2023-02-17 02:34:07,192 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) [2023-02-17 02:34:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2023-02-17 02:34:07,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-17 02:34:07,195 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:34:07,195 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] [2023-02-17 02:34:07,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 02:34:07,196 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:34:07,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:34:07,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1825803044, now seen corresponding path program 1 times [2023-02-17 02:34:07,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:34:07,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417584150] [2023-02-17 02:34:07,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:07,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:34:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:34:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:34:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-17 02:34:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-02-17 02:34:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 02:34:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,266 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-17 02:34:07,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:34:07,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417584150] [2023-02-17 02:34:07,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417584150] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:34:07,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:34:07,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:34:07,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786086463] [2023-02-17 02:34:07,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:34:07,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:34:07,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:34:07,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:34:07,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:34:07,269 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) [2023-02-17 02:34:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:34:07,305 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2023-02-17 02:34:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:34:07,305 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 [2023-02-17 02:34:07,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:34:07,306 INFO L225 Difference]: With dead ends: 104 [2023-02-17 02:34:07,306 INFO L226 Difference]: Without dead ends: 51 [2023-02-17 02:34:07,307 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 [2023-02-17 02:34:07,308 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 [2023-02-17 02:34:07,308 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] [2023-02-17 02:34:07,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-17 02:34:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2023-02-17 02:34:07,325 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) [2023-02-17 02:34:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2023-02-17 02:34:07,326 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 52 [2023-02-17 02:34:07,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:34:07,327 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2023-02-17 02:34:07,327 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) [2023-02-17 02:34:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2023-02-17 02:34:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 02:34:07,328 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:34:07,328 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] [2023-02-17 02:34:07,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 02:34:07,328 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:34:07,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:34:07,329 INFO L85 PathProgramCache]: Analyzing trace with hash 654757234, now seen corresponding path program 1 times [2023-02-17 02:34:07,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:34:07,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319010918] [2023-02-17 02:34:07,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:07,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:34:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:34:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:34:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-02-17 02:34:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-17 02:34:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 02:34:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:34:07,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:34:07,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319010918] [2023-02-17 02:34:07,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319010918] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:34:07,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985833276] [2023-02-17 02:34:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:07,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:34:07,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:34:07,398 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) [2023-02-17 02:34:07,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 02:34:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 02:34:07,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:34:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:34:07,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:34:07,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985833276] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:34:07,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:34:07,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-02-17 02:34:07,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614462173] [2023-02-17 02:34:07,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:34:07,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:34:07,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:34:07,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:34:07,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-17 02:34:07,477 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) [2023-02-17 02:34:07,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:34:07,512 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2023-02-17 02:34:07,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:34:07,513 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 [2023-02-17 02:34:07,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:34:07,514 INFO L225 Difference]: With dead ends: 96 [2023-02-17 02:34:07,515 INFO L226 Difference]: Without dead ends: 51 [2023-02-17 02:34:07,516 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 [2023-02-17 02:34:07,518 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 [2023-02-17 02:34:07,518 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] [2023-02-17 02:34:07,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-17 02:34:07,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-02-17 02:34:07,523 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) [2023-02-17 02:34:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2023-02-17 02:34:07,524 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 53 [2023-02-17 02:34:07,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:34:07,525 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2023-02-17 02:34:07,525 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) [2023-02-17 02:34:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2023-02-17 02:34:07,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-17 02:34:07,526 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:34:07,526 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] [2023-02-17 02:34:07,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 02:34:07,731 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 [2023-02-17 02:34:07,732 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:34:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:34:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash 689204116, now seen corresponding path program 1 times [2023-02-17 02:34:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:34:07,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646254124] [2023-02-17 02:34:07,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:07,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:34:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:34:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:34:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:34:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-17 02:34:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-17 02:34:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 02:34:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:34:07,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:34:07,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646254124] [2023-02-17 02:34:07,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646254124] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:34:07,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694289842] [2023-02-17 02:34:07,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:07,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:34:07,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:34:07,909 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) [2023-02-17 02:34:07,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 02:34:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:07,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 02:34:07,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:34:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:34:08,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:34:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 02:34:08,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694289842] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:34:08,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:34:08,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2023-02-17 02:34:08,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778694238] [2023-02-17 02:34:08,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:34:08,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 02:34:08,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:34:08,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 02:34:08,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-02-17 02:34:08,150 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) [2023-02-17 02:34:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:34:08,369 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2023-02-17 02:34:08,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 02:34:08,371 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 [2023-02-17 02:34:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:34:08,372 INFO L225 Difference]: With dead ends: 90 [2023-02-17 02:34:08,372 INFO L226 Difference]: Without dead ends: 59 [2023-02-17 02:34:08,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 122 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2023-02-17 02:34:08,374 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 71 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:34:08,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 335 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:34:08,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-17 02:34:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2023-02-17 02:34:08,384 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) [2023-02-17 02:34:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2023-02-17 02:34:08,385 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 62 [2023-02-17 02:34:08,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:34:08,385 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2023-02-17 02:34:08,385 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) [2023-02-17 02:34:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2023-02-17 02:34:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-17 02:34:08,386 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:34:08,387 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] [2023-02-17 02:34:08,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 02:34:08,592 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 [2023-02-17 02:34:08,593 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:34:08,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:34:08,593 INFO L85 PathProgramCache]: Analyzing trace with hash -729550012, now seen corresponding path program 2 times [2023-02-17 02:34:08,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:34:08,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602226170] [2023-02-17 02:34:08,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:08,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:34:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:08,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:34:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:08,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:34:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:08,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:34:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:08,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:34:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:08,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 02:34:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:08,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-17 02:34:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:08,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 02:34:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:08,913 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 02:34:08,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:34:08,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602226170] [2023-02-17 02:34:08,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602226170] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:34:08,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339221409] [2023-02-17 02:34:08,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:34:08,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:34:08,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:34:08,916 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) [2023-02-17 02:34:08,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 02:34:08,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:34:08,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:34:08,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 02:34:08,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:34:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 02:34:09,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:34:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 02:34:09,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339221409] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 02:34:09,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 02:34:09,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 22 [2023-02-17 02:34:09,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601581704] [2023-02-17 02:34:09,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 02:34:09,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-17 02:34:09,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:34:09,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-17 02:34:09,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2023-02-17 02:34:09,251 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) [2023-02-17 02:34:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:34:09,558 INFO L93 Difference]: Finished difference Result 150 states and 199 transitions. [2023-02-17 02:34:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 02:34:09,560 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 [2023-02-17 02:34:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:34:09,564 INFO L225 Difference]: With dead ends: 150 [2023-02-17 02:34:09,564 INFO L226 Difference]: Without dead ends: 95 [2023-02-17 02:34:09,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 135 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2023-02-17 02:34:09,565 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 92 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:34:09,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 335 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 02:34:09,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-02-17 02:34:09,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2023-02-17 02:34:09,574 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) [2023-02-17 02:34:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2023-02-17 02:34:09,575 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 71 [2023-02-17 02:34:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:34:09,577 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2023-02-17 02:34:09,577 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) [2023-02-17 02:34:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2023-02-17 02:34:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-17 02:34:09,579 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:34:09,579 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] [2023-02-17 02:34:09,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 02:34:09,792 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 [2023-02-17 02:34:09,793 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:34:09,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:34:09,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1100264158, now seen corresponding path program 1 times [2023-02-17 02:34:09,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:34:09,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161247582] [2023-02-17 02:34:09,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:09,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:34:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:09,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:34:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:09,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:34:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:09,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:34:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:09,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:34:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:09,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:34:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:09,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-02-17 02:34:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:09,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-02-17 02:34:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:09,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 02:34:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:09,891 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-17 02:34:09,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:34:09,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161247582] [2023-02-17 02:34:09,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161247582] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:34:09,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:34:09,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:34:09,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040528999] [2023-02-17 02:34:09,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:34:09,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:34:09,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:34:09,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:34:09,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:34:09,894 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) [2023-02-17 02:34:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:34:09,918 INFO L93 Difference]: Finished difference Result 178 states and 250 transitions. [2023-02-17 02:34:09,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:34:09,919 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 [2023-02-17 02:34:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:34:09,920 INFO L225 Difference]: With dead ends: 178 [2023-02-17 02:34:09,920 INFO L226 Difference]: Without dead ends: 91 [2023-02-17 02:34:09,920 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 [2023-02-17 02:34:09,921 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 [2023-02-17 02:34:09,921 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] [2023-02-17 02:34:09,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-17 02:34:09,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-17 02:34:09,926 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) [2023-02-17 02:34:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2023-02-17 02:34:09,927 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 78 [2023-02-17 02:34:09,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:34:09,927 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2023-02-17 02:34:09,927 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) [2023-02-17 02:34:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2023-02-17 02:34:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-17 02:34:09,928 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:34:09,929 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] [2023-02-17 02:34:09,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-17 02:34:09,929 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:34:09,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:34:09,929 INFO L85 PathProgramCache]: Analyzing trace with hash -862294776, now seen corresponding path program 2 times [2023-02-17 02:34:09,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 02:34:09,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820881699] [2023-02-17 02:34:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:34:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 02:34:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:10,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:34:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:10,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:34:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:10,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:34:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:10,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:34:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:10,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 02:34:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:10,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-17 02:34:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:10,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-02-17 02:34:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:10,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-02-17 02:34:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:10,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-02-17 02:34:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:34:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-17 02:34:10,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 02:34:10,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820881699] [2023-02-17 02:34:10,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820881699] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:34:10,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770855047] [2023-02-17 02:34:10,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 02:34:10,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 02:34:10,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:34:10,241 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) [2023-02-17 02:34:10,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 02:34:10,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 02:34:10,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 02:34:10,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 02:34:10,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:34:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 60 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-17 02:34:10,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:34:10,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770855047] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:34:10,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:34:10,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 19 [2023-02-17 02:34:10,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235586078] [2023-02-17 02:34:10,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:34:10,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-17 02:34:10,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 02:34:10,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-17 02:34:10,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2023-02-17 02:34:10,556 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 19 states, 18 states have (on average 5.444444444444445) internal successors, (98), 19 states have internal predecessors, (98), 10 states have call successors, (17), 2 states have call predecessors, (17), 8 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) [2023-02-17 02:34:10,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:34:10,731 INFO L93 Difference]: Finished difference Result 152 states and 206 transitions. [2023-02-17 02:34:10,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 02:34:10,731 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.444444444444445) internal successors, (98), 19 states have internal predecessors, (98), 10 states have call successors, (17), 2 states have call predecessors, (17), 8 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) Word has length 87 [2023-02-17 02:34:10,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:34:10,732 INFO L225 Difference]: With dead ends: 152 [2023-02-17 02:34:10,732 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 02:34:10,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2023-02-17 02:34:10,734 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 71 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:34:10,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 175 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 02:34:10,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 02:34:10,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 02:34:10,735 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) [2023-02-17 02:34:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 02:34:10,735 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2023-02-17 02:34:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:34:10,736 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 02:34:10,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.444444444444445) internal successors, (98), 19 states have internal predecessors, (98), 10 states have call successors, (17), 2 states have call predecessors, (17), 8 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) [2023-02-17 02:34:10,736 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 02:34:10,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 02:34:10,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 02:34:10,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 02:34:10,945 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 [2023-02-17 02:34:10,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 02:34:10,956 INFO L895 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (let ((.cse3 (= |multiple_of_#in~m| multiple_of_~m)) (.cse4 (<= |multiple_of_#in~m| 0))) (let ((.cse2 (not (<= |multiple_of_#in~m| |multiple_of_#in~n|))) (.cse0 (not (<= 0 |multiple_of_#in~n|))) (.cse1 (and .cse3 .cse4))) (and (or .cse0 .cse1) (or .cse2 .cse0 .cse1) .cse3 .cse4 (or .cse2 .cse0 (not (<= (* (- 1) |multiple_of_#in~n|) (* (- 2) |multiple_of_#in~m|))) .cse1)))) [2023-02-17 02:34:10,956 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 34) no Hoare annotation was computed. [2023-02-17 02:34:10,956 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2023-02-17 02:34:10,956 INFO L899 garLoopResultBuilder]: For program point multiple_ofFINAL(lines 31 45) no Hoare annotation was computed. [2023-02-17 02:34:10,957 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (let ((.cse7 (<= |multiple_of_#in~m| |multiple_of_#in~n|))) (let ((.cse6 (not .cse7)) (.cse3 (not (<= 0 |multiple_of_#in~n|))) (.cse0 (>= multiple_of_~n |multiple_of_#in~n|)) (.cse1 (= |multiple_of_#in~m| multiple_of_~m)) (.cse2 (= |multiple_of_#in~n| multiple_of_~n)) (.cse4 (<= 0 multiple_of_~n)) (.cse5 (not (<= multiple_of_~n 0)))) (and .cse0 .cse1 .cse2 (or .cse3 (and .cse0 .cse1 .cse2 .cse4 .cse5)) .cse4 (or .cse6 .cse3 (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse5)) (let ((.cse8 (<= (* (- 1) |multiple_of_#in~n|) (* (- 2) |multiple_of_#in~m|)))) (or .cse6 .cse3 (and .cse0 .cse1 .cse8 .cse2 .cse7 .cse4 .cse5) (not .cse8))) .cse5))) [2023-02-17 02:34:10,957 INFO L899 garLoopResultBuilder]: For program point L44-1(line 44) no Hoare annotation was computed. [2023-02-17 02:34:10,957 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 31 45) the Hoare annotation is: true [2023-02-17 02:34:10,957 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2023-02-17 02:34:10,957 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2023-02-17 02:34:10,957 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse0 (<= |multiple_of_#in~n| 0)) (.cse4 (>= multiple_of_~n |multiple_of_#in~n|)) (.cse5 (= |multiple_of_#in~m| multiple_of_~m)) (.cse6 (<= multiple_of_~n (- 1))) (.cse7 (= |multiple_of_#in~n| multiple_of_~n))) (let ((.cse3 (and .cse0 .cse4 .cse5 .cse6 .cse7)) (.cse8 (and .cse0 .cse4 .cse5)) (.cse1 (not (<= |multiple_of_#in~m| |multiple_of_#in~n|))) (.cse2 (not (<= 0 |multiple_of_#in~n|))) (.cse9 (and .cse0 .cse4 .cse5 .cse7))) (and .cse0 (or .cse1 .cse2) (or .cse3 .cse2) .cse4 .cse5 .cse2 .cse6 .cse7 (or .cse8 .cse3 .cse9) (or .cse8 .cse1 .cse2 (not (<= (* (- 1) |multiple_of_#in~n|) (* (- 2) |multiple_of_#in~m|))) .cse9)))) [2023-02-17 02:34:10,957 INFO L899 garLoopResultBuilder]: For program point multiple_ofEXIT(lines 31 45) no Hoare annotation was computed. [2023-02-17 02:34:10,957 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2023-02-17 02:34:10,958 INFO L899 garLoopResultBuilder]: For program point L36-1(line 36) no Hoare annotation was computed. [2023-02-17 02:34:10,958 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (= |mult_#in~n| mult_~n) (not (<= (+ (- 1) mult_~m) 0)) (= |mult_#in~m| mult_~m) (not (<= mult_~m 0))) [2023-02-17 02:34:10,958 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2023-02-17 02:34:10,958 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2023-02-17 02:34:10,958 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2023-02-17 02:34:10,958 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (let ((.cse0 (<= 0 (+ (* (- 1) |mult_#in~m|) 1))) (.cse1 (= |mult_#in~m| mult_~m)) (.cse2 (<= |mult_#in~m| 0))) (and (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1)) .cse0 .cse1 .cse2)) [2023-02-17 02:34:10,958 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-02-17 02:34:10,958 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-02-17 02:34:10,959 INFO L899 garLoopResultBuilder]: For program point multFINAL(lines 17 28) no Hoare annotation was computed. [2023-02-17 02:34:10,959 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 28) the Hoare annotation is: true [2023-02-17 02:34:10,959 INFO L899 garLoopResultBuilder]: For program point multEXIT(lines 17 28) no Hoare annotation was computed. [2023-02-17 02:34:10,959 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-02-17 02:34:10,959 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 02:34:10,959 INFO L895 garLoopResultBuilder]: At program point L97-1(line 97) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 0 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|)) [2023-02-17 02:34:10,959 INFO L899 garLoopResultBuilder]: For program point L97-2(line 97) no Hoare annotation was computed. [2023-02-17 02:34:10,960 INFO L899 garLoopResultBuilder]: For program point L97-4(lines 97 101) no Hoare annotation was computed. [2023-02-17 02:34:10,960 INFO L902 garLoopResultBuilder]: At program point L97-5(lines 76 102) the Hoare annotation is: true [2023-02-17 02:34:10,960 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2023-02-17 02:34:10,960 INFO L895 garLoopResultBuilder]: At program point is_prime_returnLabel#1(lines 52 54) the Hoare annotation is: (or (= |ULTIMATE.start_is_prime_#res#1| 0) (and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 0 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|))) [2023-02-17 02:34:10,960 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2023-02-17 02:34:10,960 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 02:34:10,960 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2023-02-17 02:34:10,960 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 02:34:10,961 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 02:34:10,961 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 98) no Hoare annotation was computed. [2023-02-17 02:34:10,961 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (<= 0 (+ (- 1) |ULTIMATE.start_main_~n~0#1|)) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|)) [2023-02-17 02:34:10,961 INFO L899 garLoopResultBuilder]: For program point L53-1(line 53) no Hoare annotation was computed. [2023-02-17 02:34:10,961 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 82) no Hoare annotation was computed. [2023-02-17 02:34:10,961 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 72) no Hoare annotation was computed. [2023-02-17 02:34:10,961 INFO L899 garLoopResultBuilder]: For program point is_prime_EXIT(lines 57 74) no Hoare annotation was computed. [2023-02-17 02:34:10,962 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 73) no Hoare annotation was computed. [2023-02-17 02:34:10,962 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 63) no Hoare annotation was computed. [2023-02-17 02:34:10,962 INFO L899 garLoopResultBuilder]: For program point is_prime_FINAL(lines 57 74) no Hoare annotation was computed. [2023-02-17 02:34:10,962 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2023-02-17 02:34:10,962 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 57 74) the Hoare annotation is: true [2023-02-17 02:34:10,962 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse11 (+ (- 2) is_prime__~n))) (let ((.cse9 (<= 4 |is_prime__#in~n|)) (.cse8 (<= (* 2 |is_prime__#in~m|) |is_prime__#in~n|)) (.cse1 (not (<= .cse11 0))) (.cse2 (= |is_prime__#in~n| is_prime__~n)) (.cse3 (= |is_prime__#in~m| is_prime__~m)) (.cse4 (>= |is_prime__#in~m| is_prime__~m)) (.cse5 (> is_prime__~n 2)) (.cse6 (<= 0 (+ (- 2) is_prime__~m))) (.cse7 (<= |is_prime__#in~n| is_prime__~n))) (let ((.cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= is_prime__~n is_prime__~m) .cse6 (<= |is_prime__#in~n| |is_prime__#in~m|) .cse7)) (.cse10 (and .cse9 .cse1 .cse8 .cse2 (<= is_prime__~m .cse11) .cse3 .cse4 .cse5 .cse6 .cse7))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (or .cse0 (not .cse8) (not .cse9) .cse10) (or .cse0 .cse10))))) [2023-02-17 02:34:10,962 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-02-17 02:34:10,963 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse7 (+ (- 2) is_prime__~n))) (let ((.cse0 (not (<= .cse7 0))) (.cse1 (= |is_prime__#in~n| is_prime__~n)) (.cse2 (= |is_prime__#in~m| is_prime__~m)) (.cse3 (>= |is_prime__#in~m| is_prime__~m)) (.cse4 (> is_prime__~n 2)) (.cse8 (<= 0 (+ (- 2) is_prime__~m))) (.cse9 (<= |is_prime__#in~n| is_prime__~n))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse6 (<= 4 |is_prime__#in~n|)) (.cse5 (<= (* 2 |is_prime__#in~m|) |is_prime__#in~n|))) (or (not .cse5) (not .cse6) (and .cse6 .cse0 .cse5 .cse1 (<= is_prime__~m .cse7) .cse2 .cse3 .cse4 .cse8 .cse9))) .cse8 .cse9))) [2023-02-17 02:34:10,963 INFO L899 garLoopResultBuilder]: For program point L68-1(line 68) no Hoare annotation was computed. [2023-02-17 02:34:10,963 INFO L899 garLoopResultBuilder]: For program point L68-2(lines 68 70) no Hoare annotation was computed. [2023-02-17 02:34:10,966 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:34:10,968 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 02:34:10,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 02:34:10 BoogieIcfgContainer [2023-02-17 02:34:10,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 02:34:10,982 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 02:34:10,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 02:34:10,983 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 02:34:10,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:34:03" (3/4) ... [2023-02-17 02:34:10,985 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 02:34:10,991 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure multiple_of [2023-02-17 02:34:10,991 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mult [2023-02-17 02:34:10,991 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_prime_ [2023-02-17 02:34:10,997 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-02-17 02:34:10,997 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-02-17 02:34:10,998 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 02:34:10,998 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 02:34:11,018 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == 0 || ((n <= 2 && 0 <= -1 + n) && n <= n) [2023-02-17 02:34:11,034 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 02:34:11,034 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 02:34:11,035 INFO L158 Benchmark]: Toolchain (without parser) took 7737.77ms. Allocated memory was 115.3MB in the beginning and 209.7MB in the end (delta: 94.4MB). Free memory was 73.2MB in the beginning and 72.9MB in the end (delta: 286.4kB). Peak memory consumption was 95.9MB. Max. memory is 16.1GB. [2023-02-17 02:34:11,035 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 115.3MB. Free memory was 86.0MB in the beginning and 85.9MB in the end (delta: 134.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:34:11,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.87ms. Allocated memory is still 115.3MB. Free memory was 73.2MB in the beginning and 62.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 02:34:11,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.62ms. Allocated memory is still 115.3MB. Free memory was 62.4MB in the beginning and 60.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 02:34:11,036 INFO L158 Benchmark]: Boogie Preprocessor took 17.97ms. Allocated memory is still 115.3MB. Free memory was 60.7MB in the beginning and 59.7MB in the end (delta: 925.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:34:11,036 INFO L158 Benchmark]: RCFGBuilder took 381.42ms. Allocated memory is still 115.3MB. Free memory was 59.7MB in the beginning and 47.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 02:34:11,036 INFO L158 Benchmark]: TraceAbstraction took 7044.74ms. Allocated memory was 115.3MB in the beginning and 209.7MB in the end (delta: 94.4MB). Free memory was 46.4MB in the beginning and 77.1MB in the end (delta: -30.7MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2023-02-17 02:34:11,037 INFO L158 Benchmark]: Witness Printer took 51.94ms. Allocated memory is still 209.7MB. Free memory was 77.1MB in the beginning and 72.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 02:34:11,038 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.21ms. Allocated memory is still 115.3MB. Free memory was 86.0MB in the beginning and 85.9MB in the end (delta: 134.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.87ms. Allocated memory is still 115.3MB. Free memory was 73.2MB in the beginning and 62.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.62ms. Allocated memory is still 115.3MB. Free memory was 62.4MB in the beginning and 60.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.97ms. Allocated memory is still 115.3MB. Free memory was 60.7MB in the beginning and 59.7MB in the end (delta: 925.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 381.42ms. Allocated memory is still 115.3MB. Free memory was 59.7MB in the beginning and 47.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7044.74ms. Allocated memory was 115.3MB in the beginning and 209.7MB in the end (delta: 94.4MB). Free memory was 46.4MB in the beginning and 77.1MB in the end (delta: -30.7MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. * Witness Printer took 51.94ms. Allocated memory is still 209.7MB. Free memory was 77.1MB in the beginning and 72.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 98]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 436 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 399 mSDsluCounter, 3376 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2711 mSDsCounter, 217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1358 IncrementalHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 217 mSolverCounterUnsat, 665 mSDtfsCounter, 1358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 814 GetRequests, 620 SyntacticMatches, 32 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.0s 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, 247 NumberOfFragments, 697 HoareAnnotationTreeSize, 207 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 920 NumberOfCodeBlocks, 920 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1093 ConstructedInterpolants, 0 QuantifiedInterpolants, 2969 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1038 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 23 InterpolantComputations, 8 PerfectInterpolantSequences, 268/459 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 && 0 <= -1 + n) && n <= n) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-17 02:34:11,062 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