./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-zilu/benchmark10_conjunctive.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/loop-zilu/benchmark10_conjunctive.i -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 5a9444e5380fed44b00432b26b7edd9414dfa93ba2d2f76306ea753732eae2b3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:10:18,543 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:10:18,546 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:10:18,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:10:18,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:10:18,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:10:18,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:10:18,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:10:18,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:10:18,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:10:18,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:10:18,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:10:18,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:10:18,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:10:18,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:10:18,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:10:18,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:10:18,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:10:18,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:10:18,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:10:18,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:10:18,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:10:18,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:10:18,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:10:18,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:10:18,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:10:18,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:10:18,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:10:18,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:10:18,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:10:18,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:10:18,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:10:18,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:10:18,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:10:18,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:10:18,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:10:18,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:10:18,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:10:18,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:10:18,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:10:18,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:10:18,628 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:10:18,654 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:10:18,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:10:18,655 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:10:18,655 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:10:18,656 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:10:18,656 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:10:18,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:10:18,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:10:18,657 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:10:18,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:10:18,658 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:10:18,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:10:18,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:10:18,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:10:18,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:10:18,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:10:18,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:10:18,659 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:10:18,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:10:18,659 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:10:18,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:10:18,660 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:10:18,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:10:18,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:10:18,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:10:18,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:10:18,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:10:18,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:10:18,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:10:18,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:10:18,662 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:10:18,662 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:10:18,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:10:18,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a9444e5380fed44b00432b26b7edd9414dfa93ba2d2f76306ea753732eae2b3 [2022-02-20 17:10:18,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:10:18,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:10:18,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:10:18,861 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:10:18,861 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:10:18,862 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark10_conjunctive.i [2022-02-20 17:10:18,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c03cd3d7/69f891401b494c89ad828fe58807d30d/FLAGc83057427 [2022-02-20 17:10:19,250 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:10:19,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark10_conjunctive.i [2022-02-20 17:10:19,253 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c03cd3d7/69f891401b494c89ad828fe58807d30d/FLAGc83057427 [2022-02-20 17:10:19,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c03cd3d7/69f891401b494c89ad828fe58807d30d [2022-02-20 17:10:19,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:10:19,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:10:19,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:10:19,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:10:19,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:10:19,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:10:19" (1/1) ... [2022-02-20 17:10:19,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5944403f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:19, skipping insertion in model container [2022-02-20 17:10:19,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:10:19" (1/1) ... [2022-02-20 17:10:19,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:10:19,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:10:19,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark10_conjunctive.i[873,886] [2022-02-20 17:10:19,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:10:19,396 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:10:19,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark10_conjunctive.i[873,886] [2022-02-20 17:10:19,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:10:19,414 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:10:19,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:19 WrapperNode [2022-02-20 17:10:19,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:10:19,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:10:19,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:10:19,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:10:19,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:19" (1/1) ... [2022-02-20 17:10:19,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:19" (1/1) ... [2022-02-20 17:10:19,435 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-02-20 17:10:19,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:10:19,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:10:19,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:10:19,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:10:19,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:19" (1/1) ... [2022-02-20 17:10:19,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:19" (1/1) ... [2022-02-20 17:10:19,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:19" (1/1) ... [2022-02-20 17:10:19,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:19" (1/1) ... [2022-02-20 17:10:19,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:19" (1/1) ... [2022-02-20 17:10:19,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:19" (1/1) ... [2022-02-20 17:10:19,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:19" (1/1) ... [2022-02-20 17:10:19,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:10:19,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:10:19,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:10:19,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:10:19,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:19" (1/1) ... [2022-02-20 17:10:19,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:10:19,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:19,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:10:19,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:10:19,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:10:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:10:19,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:10:19,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:10:19,534 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:10:19,535 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:10:19,645 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:10:19,649 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:10:19,650 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:10:19,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:10:19 BoogieIcfgContainer [2022-02-20 17:10:19,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:10:19,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:10:19,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:10:19,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:10:19,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:10:19" (1/3) ... [2022-02-20 17:10:19,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35de70cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:10:19, skipping insertion in model container [2022-02-20 17:10:19,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:19" (2/3) ... [2022-02-20 17:10:19,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35de70cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:10:19, skipping insertion in model container [2022-02-20 17:10:19,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:10:19" (3/3) ... [2022-02-20 17:10:19,657 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark10_conjunctive.i [2022-02-20 17:10:19,660 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:10:19,660 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:10:19,686 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:10:19,690 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:10:19,690 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:10:19,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:10:19,720 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:19,721 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:19,721 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:19,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1807243399, now seen corresponding path program 1 times [2022-02-20 17:10:19,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:19,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397274311] [2022-02-20 17:10:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:19,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {16#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {16#true} is VALID [2022-02-20 17:10:19,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {16#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~c~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~c~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {16#true} is VALID [2022-02-20 17:10:19,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {16#true} assume !!(0 == main_~c~0#1 && 0 == main_~i~0#1); {16#true} is VALID [2022-02-20 17:10:19,854 INFO L290 TraceCheckUtils]: 3: Hoare triple {16#true} assume !true; {17#false} is VALID [2022-02-20 17:10:19,855 INFO L290 TraceCheckUtils]: 4: Hoare triple {17#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~c~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {17#false} is VALID [2022-02-20 17:10:19,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {17#false} assume 0 == __VERIFIER_assert_~cond#1; {17#false} is VALID [2022-02-20 17:10:19,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {17#false} assume !false; {17#false} is VALID [2022-02-20 17:10:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:19,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:19,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397274311] [2022-02-20 17:10:19,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397274311] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:10:19,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:10:19,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:10:19,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417745241] [2022-02-20 17:10:19,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:10:19,871 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2022-02-20 17:10:19,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:19,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:19,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:19,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:10:19,895 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:19,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:10:19,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:10:19,926 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:19,952 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 17:10:19,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:10:19,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2022-02-20 17:10:19,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 25 transitions. [2022-02-20 17:10:19,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 25 transitions. [2022-02-20 17:10:19,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 25 transitions. [2022-02-20 17:10:19,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:20,006 INFO L225 Difference]: With dead ends: 21 [2022-02-20 17:10:20,007 INFO L226 Difference]: Without dead ends: 9 [2022-02-20 17:10:20,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:10:20,017 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:20,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:10:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-02-20 17:10:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-20 17:10:20,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:20,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,038 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,038 INFO L87 Difference]: Start difference. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:20,040 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-20 17:10:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-20 17:10:20,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:20,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:20,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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) Second operand 9 states. [2022-02-20 17:10:20,041 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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) Second operand 9 states. [2022-02-20 17:10:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:20,044 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-20 17:10:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-20 17:10:20,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:20,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:20,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:20,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-02-20 17:10:20,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2022-02-20 17:10:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:20,050 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-02-20 17:10:20,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-20 17:10:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:10:20,051 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:20,051 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:20,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:10:20,052 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:20,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:20,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1806975280, now seen corresponding path program 1 times [2022-02-20 17:10:20,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:20,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715201616] [2022-02-20 17:10:20,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:20,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:20,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {72#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {72#true} is VALID [2022-02-20 17:10:20,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {72#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~c~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~c~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {72#true} is VALID [2022-02-20 17:10:20,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {72#true} assume !!(0 == main_~c~0#1 && 0 == main_~i~0#1); {74#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:10:20,110 INFO L290 TraceCheckUtils]: 3: Hoare triple {74#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100); {73#false} is VALID [2022-02-20 17:10:20,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {73#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~c~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {73#false} is VALID [2022-02-20 17:10:20,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {73#false} assume 0 == __VERIFIER_assert_~cond#1; {73#false} is VALID [2022-02-20 17:10:20,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {73#false} assume !false; {73#false} is VALID [2022-02-20 17:10:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:20,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:20,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715201616] [2022-02-20 17:10:20,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715201616] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:10:20,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:10:20,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:10:20,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008130812] [2022-02-20 17:10:20,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:10:20,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2022-02-20 17:10:20,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:20,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:20,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:10:20,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:20,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:10:20,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:10:20,128 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:20,153 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-02-20 17:10:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:10:20,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2022-02-20 17:10:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-20 17:10:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-20 17:10:20,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 18 transitions. [2022-02-20 17:10:20,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:20,185 INFO L225 Difference]: With dead ends: 18 [2022-02-20 17:10:20,185 INFO L226 Difference]: Without dead ends: 14 [2022-02-20 17:10:20,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:10:20,190 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:20,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 13 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:10:20,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-20 17:10:20,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2022-02-20 17:10:20,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:20,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,196 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,196 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:20,197 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-20 17:10:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-20 17:10:20,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:20,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:20,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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) Second operand 14 states. [2022-02-20 17:10:20,198 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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) Second operand 14 states. [2022-02-20 17:10:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:20,200 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-20 17:10:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-20 17:10:20,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:20,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:20,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:20,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-02-20 17:10:20,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 7 [2022-02-20 17:10:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:20,202 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-02-20 17:10:20,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-02-20 17:10:20,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:10:20,203 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:20,204 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:20,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:10:20,204 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:20,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash 183324243, now seen corresponding path program 1 times [2022-02-20 17:10:20,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:20,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913569139] [2022-02-20 17:10:20,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:20,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {137#true} is VALID [2022-02-20 17:10:20,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {137#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~c~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~c~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {137#true} is VALID [2022-02-20 17:10:20,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {137#true} assume !!(0 == main_~c~0#1 && 0 == main_~i~0#1); {139#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 17:10:20,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {139#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {140#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 17:10:20,256 INFO L290 TraceCheckUtils]: 4: Hoare triple {140#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 <= 0; {138#false} is VALID [2022-02-20 17:10:20,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {138#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~c~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {138#false} is VALID [2022-02-20 17:10:20,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {138#false} assume 0 == __VERIFIER_assert_~cond#1; {138#false} is VALID [2022-02-20 17:10:20,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {138#false} assume !false; {138#false} is VALID [2022-02-20 17:10:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:20,257 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:20,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913569139] [2022-02-20 17:10:20,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913569139] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:10:20,257 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:10:20,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:10:20,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239611356] [2022-02-20 17:10:20,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:10:20,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2022-02-20 17:10:20,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:20,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:20,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:10:20,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:20,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:10:20,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:10:20,267 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:20,292 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-20 17:10:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:10:20,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2022-02-20 17:10:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-02-20 17:10:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-02-20 17:10:20,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2022-02-20 17:10:20,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:20,306 INFO L225 Difference]: With dead ends: 14 [2022-02-20 17:10:20,306 INFO L226 Difference]: Without dead ends: 10 [2022-02-20 17:10:20,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:10:20,311 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:20,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 7 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:10:20,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-20 17:10:20,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-20 17:10:20,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:20,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,315 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,315 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:20,315 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 17:10:20,315 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:10:20,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:20,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:20,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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) Second operand 10 states. [2022-02-20 17:10:20,316 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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) Second operand 10 states. [2022-02-20 17:10:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:20,316 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 17:10:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:10:20,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:20,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:20,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:20,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-02-20 17:10:20,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2022-02-20 17:10:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:20,318 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-02-20 17:10:20,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:10:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:10:20,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:20,318 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:20,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:10:20,319 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:20,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:20,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1389600693, now seen corresponding path program 1 times [2022-02-20 17:10:20,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:20,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780132268] [2022-02-20 17:10:20,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:20,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:20,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {191#true} is VALID [2022-02-20 17:10:20,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~c~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~c~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {191#true} is VALID [2022-02-20 17:10:20,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume !!(0 == main_~c~0#1 && 0 == main_~i~0#1); {193#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:10:20,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {193#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {194#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:10:20,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {194#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 <= 0); {194#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:10:20,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100); {192#false} is VALID [2022-02-20 17:10:20,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {192#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~c~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {192#false} is VALID [2022-02-20 17:10:20,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#false} assume 0 == __VERIFIER_assert_~cond#1; {192#false} is VALID [2022-02-20 17:10:20,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-02-20 17:10:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:20,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:20,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780132268] [2022-02-20 17:10:20,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780132268] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:10:20,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145795120] [2022-02-20 17:10:20,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:20,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:20,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:20,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:10:20,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:10:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:20,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:10:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:20,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:10:20,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {191#true} is VALID [2022-02-20 17:10:20,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~c~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~c~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {191#true} is VALID [2022-02-20 17:10:20,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume !!(0 == main_~c~0#1 && 0 == main_~i~0#1); {193#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:10:20,469 INFO L290 TraceCheckUtils]: 3: Hoare triple {193#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {194#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:10:20,469 INFO L290 TraceCheckUtils]: 4: Hoare triple {194#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 <= 0); {194#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:10:20,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100); {192#false} is VALID [2022-02-20 17:10:20,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {192#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~c~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {192#false} is VALID [2022-02-20 17:10:20,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#false} assume 0 == __VERIFIER_assert_~cond#1; {192#false} is VALID [2022-02-20 17:10:20,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-02-20 17:10:20,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:20,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:10:20,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-02-20 17:10:20,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#false} assume 0 == __VERIFIER_assert_~cond#1; {192#false} is VALID [2022-02-20 17:10:20,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {192#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~c~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {192#false} is VALID [2022-02-20 17:10:20,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#(< |ULTIMATE.start_main_~i~0#1| 100)} assume !(main_~i~0#1 < 100); {192#false} is VALID [2022-02-20 17:10:20,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {231#(< |ULTIMATE.start_main_~i~0#1| 100)} assume !(main_~i~0#1 <= 0); {231#(< |ULTIMATE.start_main_~i~0#1| 100)} is VALID [2022-02-20 17:10:20,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {238#(< |ULTIMATE.start_main_~i~0#1| 99)} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {231#(< |ULTIMATE.start_main_~i~0#1| 100)} is VALID [2022-02-20 17:10:20,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {191#true} assume !!(0 == main_~c~0#1 && 0 == main_~i~0#1); {238#(< |ULTIMATE.start_main_~i~0#1| 99)} is VALID [2022-02-20 17:10:20,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~c~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~c~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {191#true} is VALID [2022-02-20 17:10:20,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {191#true} is VALID [2022-02-20 17:10:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:20,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145795120] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:10:20,533 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:10:20,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-02-20 17:10:20,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695468757] [2022-02-20 17:10:20,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:10:20,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) Word has length 9 [2022-02-20 17:10:20,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:20,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:20,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:10:20,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:20,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:10:20,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:10:20,544 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:20,582 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-20 17:10:20,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:10:20,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) Word has length 9 [2022-02-20 17:10:20,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-02-20 17:10:20,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-02-20 17:10:20,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2022-02-20 17:10:20,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:20,600 INFO L225 Difference]: With dead ends: 20 [2022-02-20 17:10:20,601 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 17:10:20,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:10:20,605 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:20,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 15 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:10:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 17:10:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 17:10:20,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:20,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,616 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,617 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:20,618 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 17:10:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 17:10:20,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:20,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:20,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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) Second operand 16 states. [2022-02-20 17:10:20,619 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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) Second operand 16 states. [2022-02-20 17:10:20,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:20,620 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 17:10:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 17:10:20,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:20,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:20,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:20,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-02-20 17:10:20,623 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2022-02-20 17:10:20,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:20,625 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-02-20 17:10:20,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 17:10:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:10:20,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:20,625 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:20,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:10:20,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:20,835 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:20,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:20,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1013296068, now seen corresponding path program 2 times [2022-02-20 17:10:20,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:20,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068361913] [2022-02-20 17:10:20,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:20,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:20,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {325#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {325#true} is VALID [2022-02-20 17:10:20,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~c~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~c~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {325#true} is VALID [2022-02-20 17:10:20,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} assume !!(0 == main_~c~0#1 && 0 == main_~i~0#1); {327#(<= 0 (+ |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:10:20,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#(<= 0 (+ |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {328#(<= 0 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:10:20,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {328#(<= 0 |ULTIMATE.start_main_~c~0#1|)} assume !(main_~i~0#1 <= 0); {329#(<= 1 (+ |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:10:20,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {329#(<= 1 (+ |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {330#(<= 1 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:10:20,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {330#(<= 1 |ULTIMATE.start_main_~c~0#1|)} assume !(main_~i~0#1 <= 0); {331#(<= 3 (+ |ULTIMATE.start_main_~c~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 17:10:20,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(<= 3 (+ |ULTIMATE.start_main_~c~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {332#(<= 4 (+ |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:10:20,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {332#(<= 4 (+ |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !(main_~i~0#1 <= 0); {332#(<= 4 (+ |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:10:20,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {332#(<= 4 (+ |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {333#(<= 4 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:10:20,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {333#(<= 4 |ULTIMATE.start_main_~c~0#1|)} assume !(main_~i~0#1 <= 0); {333#(<= 4 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:10:20,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {333#(<= 4 |ULTIMATE.start_main_~c~0#1|)} assume !(main_~i~0#1 < 100); {333#(<= 4 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-20 17:10:20,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {333#(<= 4 |ULTIMATE.start_main_~c~0#1|)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~c~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {334#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:10:20,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {334#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {326#false} is VALID [2022-02-20 17:10:20,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {326#false} assume !false; {326#false} is VALID [2022-02-20 17:10:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:20,946 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:20,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068361913] [2022-02-20 17:10:20,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068361913] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:10:20,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055812707] [2022-02-20 17:10:20,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:10:20,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:20,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:20,948 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:10:20,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:10:20,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:10:20,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:10:20,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 17:10:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:20,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:10:21,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {325#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {325#true} is VALID [2022-02-20 17:10:21,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~c~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~c~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {325#true} is VALID [2022-02-20 17:10:21,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} assume !!(0 == main_~c~0#1 && 0 == main_~i~0#1); {344#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:10:21,104 INFO L290 TraceCheckUtils]: 3: Hoare triple {344#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {348#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:10:21,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {348#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 <= 0); {348#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:10:21,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {355#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:10:21,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {355#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 <= 0); {355#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:10:21,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {355#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {362#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:10:21,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {362#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 <= 0); {362#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:10:21,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {369#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:10:21,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {369#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 <= 0); {369#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:10:21,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {369#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100); {326#false} is VALID [2022-02-20 17:10:21,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {326#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~c~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {326#false} is VALID [2022-02-20 17:10:21,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#false} assume 0 == __VERIFIER_assert_~cond#1; {326#false} is VALID [2022-02-20 17:10:21,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {326#false} assume !false; {326#false} is VALID [2022-02-20 17:10:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:21,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:10:21,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {326#false} assume !false; {326#false} is VALID [2022-02-20 17:10:21,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#false} assume 0 == __VERIFIER_assert_~cond#1; {326#false} is VALID [2022-02-20 17:10:21,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {326#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~c~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {326#false} is VALID [2022-02-20 17:10:21,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {394#(< |ULTIMATE.start_main_~i~0#1| 100)} assume !(main_~i~0#1 < 100); {326#false} is VALID [2022-02-20 17:10:21,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {394#(< |ULTIMATE.start_main_~i~0#1| 100)} assume !(main_~i~0#1 <= 0); {394#(< |ULTIMATE.start_main_~i~0#1| 100)} is VALID [2022-02-20 17:10:21,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {401#(< |ULTIMATE.start_main_~i~0#1| 99)} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {394#(< |ULTIMATE.start_main_~i~0#1| 100)} is VALID [2022-02-20 17:10:21,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {401#(< |ULTIMATE.start_main_~i~0#1| 99)} assume !(main_~i~0#1 <= 0); {401#(< |ULTIMATE.start_main_~i~0#1| 99)} is VALID [2022-02-20 17:10:21,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {408#(< |ULTIMATE.start_main_~i~0#1| 98)} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {401#(< |ULTIMATE.start_main_~i~0#1| 99)} is VALID [2022-02-20 17:10:21,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {408#(< |ULTIMATE.start_main_~i~0#1| 98)} assume !(main_~i~0#1 <= 0); {408#(< |ULTIMATE.start_main_~i~0#1| 98)} is VALID [2022-02-20 17:10:21,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {415#(< |ULTIMATE.start_main_~i~0#1| 97)} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {408#(< |ULTIMATE.start_main_~i~0#1| 98)} is VALID [2022-02-20 17:10:21,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {415#(< |ULTIMATE.start_main_~i~0#1| 97)} assume !(main_~i~0#1 <= 0); {415#(< |ULTIMATE.start_main_~i~0#1| 97)} is VALID [2022-02-20 17:10:21,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {422#(< |ULTIMATE.start_main_~i~0#1| 96)} assume !!(main_~i~0#1 < 100);main_~c~0#1 := main_~c~0#1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1; {415#(< |ULTIMATE.start_main_~i~0#1| 97)} is VALID [2022-02-20 17:10:21,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} assume !!(0 == main_~c~0#1 && 0 == main_~i~0#1); {422#(< |ULTIMATE.start_main_~i~0#1| 96)} is VALID [2022-02-20 17:10:21,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~c~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~i~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~c~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {325#true} is VALID [2022-02-20 17:10:21,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {325#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {325#true} is VALID [2022-02-20 17:10:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:21,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055812707] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:10:21,289 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:10:21,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2022-02-20 17:10:21,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778333158] [2022-02-20 17:10:21,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:10:21,292 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 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) Word has length 15 [2022-02-20 17:10:21,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:21,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:21,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:21,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 17:10:21,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:21,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 17:10:21,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-02-20 17:10:21,321 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:21,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:21,825 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 17:10:21,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 17:10:21,826 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 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) Word has length 15 [2022-02-20 17:10:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2022-02-20 17:10:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2022-02-20 17:10:21,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 36 transitions. [2022-02-20 17:10:21,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:21,852 INFO L225 Difference]: With dead ends: 30 [2022-02-20 17:10:21,853 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:10:21,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=431, Invalid=1291, Unknown=0, NotChecked=0, Total=1722 [2022-02-20 17:10:21,854 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:21,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 13 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:10:21,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:10:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:10:21,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:21,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:21,855 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:21,855 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:21,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:21,855 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:10:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:10:21,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:21,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:21,855 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-02-20 17:10:21,855 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-02-20 17:10:21,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:21,855 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:10:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:10:21,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:21,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:21,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:21,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:10:21,856 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-02-20 17:10:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:21,856 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:10:21,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:10:21,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:21,858 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:10:21,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:10:22,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:22,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:10:22,159 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:10:22,159 INFO L861 garLoopResultBuilder]: At program point L29(lines 19 30) the Hoare annotation is: true [2022-02-20 17:10:22,159 INFO L854 garLoopResultBuilder]: At program point L23-2(lines 23 27) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (+ |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~i~0#1|))) (or (and .cse0 (<= 4 |ULTIMATE.start_main_~c~0#1|)) (and .cse0 (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 4 .cse1)) (and (<= 0 .cse1) (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|)) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 2)) (and .cse0 (<= 1 .cse1) (<= |ULTIMATE.start_main_~i~0#1| 1)))) [2022-02-20 17:10:22,159 INFO L858 garLoopResultBuilder]: For program point L23-3(lines 23 27) no Hoare annotation was computed. [2022-02-20 17:10:22,160 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-02-20 17:10:22,160 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:10:22,160 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:10:22,160 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:10:22,160 INFO L858 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-02-20 17:10:22,160 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-02-20 17:10:22,160 INFO L858 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-02-20 17:10:22,161 INFO L858 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-02-20 17:10:22,161 INFO L858 garLoopResultBuilder]: For program point L14(lines 14 18) no Hoare annotation was computed. [2022-02-20 17:10:22,163 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-02-20 17:10:22,164 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:10:22,166 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:10:22,166 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:10:22,166 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 17:10:22,166 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 17:10:22,166 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:10:22,166 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-02-20 17:10:22,166 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-02-20 17:10:22,166 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 17:10:22,167 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:10:22,167 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2022-02-20 17:10:22,167 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 17:10:22,167 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 17:10:22,167 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:10:22,167 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:10:22,167 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:10:22,167 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:10:22,167 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-20 17:10:22,167 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:10:22,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:10:22 BoogieIcfgContainer [2022-02-20 17:10:22,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:10:22,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:10:22,175 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:10:22,175 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:10:22,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:10:19" (3/4) ... [2022-02-20 17:10:22,177 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:10:22,183 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 17:10:22,183 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 17:10:22,183 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:10:22,183 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:10:22,200 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:10:22,200 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:10:22,201 INFO L158 Benchmark]: Toolchain (without parser) took 2937.39ms. Allocated memory was 102.8MB in the beginning and 134.2MB in the end (delta: 31.5MB). Free memory was 73.4MB in the beginning and 68.5MB in the end (delta: 4.9MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2022-02-20 17:10:22,201 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory is still 59.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:10:22,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.29ms. Allocated memory is still 102.8MB. Free memory was 73.1MB in the beginning and 77.7MB in the end (delta: -4.5MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-02-20 17:10:22,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.06ms. Allocated memory is still 102.8MB. Free memory was 77.7MB in the beginning and 76.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:10:22,202 INFO L158 Benchmark]: Boogie Preprocessor took 11.10ms. Allocated memory is still 102.8MB. Free memory was 76.0MB in the beginning and 75.1MB in the end (delta: 961.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:10:22,202 INFO L158 Benchmark]: RCFGBuilder took 203.56ms. Allocated memory is still 102.8MB. Free memory was 75.1MB in the beginning and 65.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:10:22,202 INFO L158 Benchmark]: TraceAbstraction took 2522.08ms. Allocated memory was 102.8MB in the beginning and 134.2MB in the end (delta: 31.5MB). Free memory was 64.9MB in the beginning and 70.6MB in the end (delta: -5.7MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2022-02-20 17:10:22,203 INFO L158 Benchmark]: Witness Printer took 25.77ms. Allocated memory is still 134.2MB. Free memory was 70.6MB in the beginning and 68.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:10:22,204 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory is still 59.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.29ms. Allocated memory is still 102.8MB. Free memory was 73.1MB in the beginning and 77.7MB in the end (delta: -4.5MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.06ms. Allocated memory is still 102.8MB. Free memory was 77.7MB in the beginning and 76.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.10ms. Allocated memory is still 102.8MB. Free memory was 76.0MB in the beginning and 75.1MB in the end (delta: 961.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 203.56ms. Allocated memory is still 102.8MB. Free memory was 75.1MB in the beginning and 65.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2522.08ms. Allocated memory was 102.8MB in the beginning and 134.2MB in the end (delta: 31.5MB). Free memory was 64.9MB in the beginning and 70.6MB in the end (delta: -5.7MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * Witness Printer took 25.77ms. Allocated memory is still 134.2MB. Free memory was 70.6MB in the beginning and 68.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: 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 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 106 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 40 mSDtfsCounter, 106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=4, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 13 NumberOfFragments, 55 HoareAnnotationTreeSize, 2 FomulaSimplifications, 6 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 123 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 104 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 6/51 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: 23]: Loop Invariant Derived loop invariant: ((((1 <= i && 4 <= c) || ((1 <= i && i <= 3) && 4 <= c + i)) || ((0 <= c + i && i <= 0) && 0 <= i)) || ((1 <= i && 1 <= c) && i <= 2)) || ((1 <= i && 1 <= c + i) && i <= 1) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:10:22,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE