./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-zilu/benchmark25_linear.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/benchmark25_linear.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 1130d3df8d11f3be805af96558350a1bd8faf89323cc035b32267e4a54793a8c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:10:25,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:10:25,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:10:25,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:10:25,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:10:25,680 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:10:25,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:10:25,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:10:25,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:10:25,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:10:25,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:10:25,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:10:25,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:10:25,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:10:25,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:10:25,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:10:25,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:10:25,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:10:25,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:10:25,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:10:25,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:10:25,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:10:25,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:10:25,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:10:25,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:10:25,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:10:25,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:10:25,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:10:25,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:10:25,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:10:25,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:10:25,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:10:25,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:10:25,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:10:25,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:10:25,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:10:25,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:10:25,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:10:25,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:10:25,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:10:25,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:10:25,726 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:25,751 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:10:25,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:10:25,752 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:10:25,752 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:10:25,752 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:10:25,753 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:10:25,753 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:10:25,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:10:25,753 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:10:25,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:10:25,755 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:10:25,755 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:10:25,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:10:25,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:10:25,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:10:25,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:10:25,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:10:25,756 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:10:25,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:10:25,756 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:10:25,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:10:25,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:10:25,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:10:25,757 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:10:25,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:10:25,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:10:25,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:10:25,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:10:25,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:10:25,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:10:25,758 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:10:25,758 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:10:25,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:10:25,758 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 -> 1130d3df8d11f3be805af96558350a1bd8faf89323cc035b32267e4a54793a8c [2022-02-20 17:10:25,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:10:25,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:10:25,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:10:25,960 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:10:25,961 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:10:25,962 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark25_linear.i [2022-02-20 17:10:26,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606a06552/6438ca2ea81d47cd9e59dbd6cf677f7e/FLAG90791243a [2022-02-20 17:10:26,370 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:10:26,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark25_linear.i [2022-02-20 17:10:26,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606a06552/6438ca2ea81d47cd9e59dbd6cf677f7e/FLAG90791243a [2022-02-20 17:10:26,389 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/606a06552/6438ca2ea81d47cd9e59dbd6cf677f7e [2022-02-20 17:10:26,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:10:26,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:10:26,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:10:26,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:10:26,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:10:26,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:10:26" (1/1) ... [2022-02-20 17:10:26,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@643bb10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:26, skipping insertion in model container [2022-02-20 17:10:26,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:10:26" (1/1) ... [2022-02-20 17:10:26,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:10:26,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:10:26,561 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/benchmark25_linear.i[868,881] [2022-02-20 17:10:26,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:10:26,583 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:10:26,591 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/benchmark25_linear.i[868,881] [2022-02-20 17:10:26,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:10:26,604 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:10:26,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:26 WrapperNode [2022-02-20 17:10:26,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:10:26,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:10:26,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:10:26,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:10:26,611 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:26" (1/1) ... [2022-02-20 17:10:26,615 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:26" (1/1) ... [2022-02-20 17:10:26,628 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2022-02-20 17:10:26,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:10:26,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:10:26,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:10:26,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:10:26,635 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:26" (1/1) ... [2022-02-20 17:10:26,635 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:26" (1/1) ... [2022-02-20 17:10:26,636 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:26" (1/1) ... [2022-02-20 17:10:26,637 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:26" (1/1) ... [2022-02-20 17:10:26,639 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:26" (1/1) ... [2022-02-20 17:10:26,643 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:26" (1/1) ... [2022-02-20 17:10:26,646 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:26" (1/1) ... [2022-02-20 17:10:26,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:10:26,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:10:26,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:10:26,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:10:26,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:26" (1/1) ... [2022-02-20 17:10:26,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:10:26,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:26,680 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:26,743 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:26,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:10:26,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:10:26,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:10:26,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:10:26,796 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:10:26,797 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:10:26,919 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:10:26,923 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:10:26,925 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:10:26,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:10:26 BoogieIcfgContainer [2022-02-20 17:10:26,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:10:26,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:10:26,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:10:26,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:10:26,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:10:26" (1/3) ... [2022-02-20 17:10:26,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b021300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:10:26, skipping insertion in model container [2022-02-20 17:10:26,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:26" (2/3) ... [2022-02-20 17:10:26,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b021300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:10:26, skipping insertion in model container [2022-02-20 17:10:26,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:10:26" (3/3) ... [2022-02-20 17:10:26,932 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark25_linear.i [2022-02-20 17:10:26,936 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:10:26,936 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:10:26,971 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:10:26,977 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:26,977 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:10:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:10:26,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:26,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:26,994 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:26,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:26,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1807089479, now seen corresponding path program 1 times [2022-02-20 17:10:27,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:27,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938371575] [2022-02-20 17:10:27,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:27,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:27,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {15#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(21, 2); {15#true} is VALID [2022-02-20 17:10:27,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {15#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {15#true} is VALID [2022-02-20 17:10:27,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {15#true} assume !!(main_~x~0#1 < 0); {15#true} is VALID [2022-02-20 17:10:27,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {15#true} assume !true; {16#false} is VALID [2022-02-20 17:10:27,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {16#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_~x~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {16#false} is VALID [2022-02-20 17:10:27,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {16#false} assume 0 == __VERIFIER_assert_~cond#1; {16#false} is VALID [2022-02-20 17:10:27,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {16#false} assume !false; {16#false} is VALID [2022-02-20 17:10:27,128 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:27,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:27,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938371575] [2022-02-20 17:10:27,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938371575] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:10:27,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:10:27,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:10:27,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468725308] [2022-02-20 17:10:27,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:10:27,136 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:27,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:27,138 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:27,157 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:27,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:10:27,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:27,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:10:27,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:10:27,172 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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:27,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:27,194 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-20 17:10:27,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:10:27,194 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:27,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:27,195 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:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2022-02-20 17:10:27,198 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:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2022-02-20 17:10:27,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 23 transitions. [2022-02-20 17:10:27,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:27,222 INFO L225 Difference]: With dead ends: 20 [2022-02-20 17:10:27,222 INFO L226 Difference]: Without dead ends: 8 [2022-02-20 17:10:27,224 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:27,228 INFO L933 BasicCegarLoop]: 13 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, 13 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:27,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 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:27,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-20 17:10:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-20 17:10:27,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:27,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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:27,247 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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:27,247 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:27,248 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 17:10:27,249 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:10:27,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:27,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:27,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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) Second operand 8 states. [2022-02-20 17:10:27,249 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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) Second operand 8 states. [2022-02-20 17:10:27,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:27,250 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2022-02-20 17:10:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:10:27,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:27,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:27,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:27,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-02-20 17:10:27,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2022-02-20 17:10:27,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:27,253 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-02-20 17:10:27,253 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:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-02-20 17:10:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:10:27,254 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:27,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:27,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:10:27,256 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:27,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:27,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1806970315, now seen corresponding path program 1 times [2022-02-20 17:10:27,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:27,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110984689] [2022-02-20 17:10:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:27,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:27,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#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(21, 2); {67#true} is VALID [2022-02-20 17:10:27,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {67#true} is VALID [2022-02-20 17:10:27,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume !!(main_~x~0#1 < 0); {69#(<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0)} is VALID [2022-02-20 17:10:27,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {69#(<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0)} assume !(main_~x~0#1 < 10); {68#false} is VALID [2022-02-20 17:10:27,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {68#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_~x~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {68#false} is VALID [2022-02-20 17:10:27,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {68#false} assume 0 == __VERIFIER_assert_~cond#1; {68#false} is VALID [2022-02-20 17:10:27,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-02-20 17:10:27,311 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:27,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:27,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110984689] [2022-02-20 17:10:27,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110984689] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:10:27,312 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:10:27,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:10:27,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537359905] [2022-02-20 17:10:27,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:10:27,313 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:27,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:27,313 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:27,319 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:27,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:10:27,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:27,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:10:27,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:10:27,321 INFO L87 Difference]: Start difference. First operand 8 states and 8 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:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:27,335 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-02-20 17:10:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:10:27,335 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:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:27,335 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:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-02-20 17:10:27,336 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:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-02-20 17:10:27,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 13 transitions. [2022-02-20 17:10:27,347 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:27,348 INFO L225 Difference]: With dead ends: 13 [2022-02-20 17:10:27,348 INFO L226 Difference]: Without dead ends: 9 [2022-02-20 17:10:27,348 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:27,349 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:27,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:10:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-02-20 17:10:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-20 17:10:27,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:27,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:27,353 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:27,353 INFO L87 Difference]: Start difference. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:27,354 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 17:10:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 17:10:27,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:27,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:27,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:27,354 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:27,355 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-02-20 17:10:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 17:10:27,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:27,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:27,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:27,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-02-20 17:10:27,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2022-02-20 17:10:27,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:27,357 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-20 17:10:27,357 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:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 17:10:27,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:10:27,358 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:27,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:27,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:10:27,358 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:27,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:27,359 INFO L85 PathProgramCache]: Analyzing trace with hash 183170323, now seen corresponding path program 1 times [2022-02-20 17:10:27,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:27,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596617348] [2022-02-20 17:10:27,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:27,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:27,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#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(21, 2); {116#true} is VALID [2022-02-20 17:10:27,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {116#true} is VALID [2022-02-20 17:10:27,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {116#true} assume !!(main_~x~0#1 < 0); {118#(<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0)} is VALID [2022-02-20 17:10:27,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {118#(<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0)} assume !!(main_~x~0#1 < 10);main_~x~0#1 := 1 + main_~x~0#1; {119#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:10:27,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {119#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !(main_~x~0#1 < 10); {117#false} is VALID [2022-02-20 17:10:27,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_~x~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {117#false} is VALID [2022-02-20 17:10:27,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {117#false} assume 0 == __VERIFIER_assert_~cond#1; {117#false} is VALID [2022-02-20 17:10:27,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {117#false} assume !false; {117#false} is VALID [2022-02-20 17:10:27,392 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:27,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:27,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596617348] [2022-02-20 17:10:27,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596617348] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:10:27,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235247793] [2022-02-20 17:10:27,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:27,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:27,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:27,395 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:27,396 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:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:27,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:10:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:27,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:10:27,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#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(21, 2); {116#true} is VALID [2022-02-20 17:10:27,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {116#true} is VALID [2022-02-20 17:10:27,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {116#true} assume !!(main_~x~0#1 < 0); {118#(<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0)} is VALID [2022-02-20 17:10:27,479 INFO L290 TraceCheckUtils]: 3: Hoare triple {118#(<= (+ |ULTIMATE.start_main_~x~0#1| 1) 0)} assume !!(main_~x~0#1 < 10);main_~x~0#1 := 1 + main_~x~0#1; {119#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-20 17:10:27,479 INFO L290 TraceCheckUtils]: 4: Hoare triple {119#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !(main_~x~0#1 < 10); {117#false} is VALID [2022-02-20 17:10:27,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_~x~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {117#false} is VALID [2022-02-20 17:10:27,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {117#false} assume 0 == __VERIFIER_assert_~cond#1; {117#false} is VALID [2022-02-20 17:10:27,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {117#false} assume !false; {117#false} is VALID [2022-02-20 17:10:27,480 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:27,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:10:27,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {117#false} assume !false; {117#false} is VALID [2022-02-20 17:10:27,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {117#false} assume 0 == __VERIFIER_assert_~cond#1; {117#false} is VALID [2022-02-20 17:10:27,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {117#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_~x~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {117#false} is VALID [2022-02-20 17:10:27,520 INFO L290 TraceCheckUtils]: 4: Hoare triple {153#(< |ULTIMATE.start_main_~x~0#1| 10)} assume !(main_~x~0#1 < 10); {117#false} is VALID [2022-02-20 17:10:27,521 INFO L290 TraceCheckUtils]: 3: Hoare triple {157#(< |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 < 10);main_~x~0#1 := 1 + main_~x~0#1; {153#(< |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-20 17:10:27,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {116#true} assume !!(main_~x~0#1 < 0); {157#(< |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-20 17:10:27,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {116#true} is VALID [2022-02-20 17:10:27,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#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(21, 2); {116#true} is VALID [2022-02-20 17:10:27,522 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:27,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235247793] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:10:27,522 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:10:27,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-02-20 17:10:27,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936594802] [2022-02-20 17:10:27,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:10:27,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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) Word has length 8 [2022-02-20 17:10:27,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:27,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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:27,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:27,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:10:27,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:27,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:10:27,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:10:27,532 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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:27,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:27,560 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-20 17:10:27,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:10:27,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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) Word has length 8 [2022-02-20 17:10:27,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-02-20 17:10:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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:27,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-02-20 17:10:27,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-02-20 17:10:27,575 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:27,575 INFO L225 Difference]: With dead ends: 16 [2022-02-20 17:10:27,575 INFO L226 Difference]: Without dead ends: 12 [2022-02-20 17:10:27,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:10:27,577 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:27,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:10:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-20 17:10:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-20 17:10:27,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:27,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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:27,582 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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:27,582 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:27,582 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-02-20 17:10:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-02-20 17:10:27,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:27,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:27,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 12 states. [2022-02-20 17:10:27,583 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 12 states. [2022-02-20 17:10:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:27,584 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-02-20 17:10:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-02-20 17:10:27,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:27,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:27,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:27,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-02-20 17:10:27,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2022-02-20 17:10:27,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:27,586 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-02-20 17:10:27,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-02-20 17:10:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 17:10:27,587 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:27,587 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:27,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:10:27,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:27,804 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:27,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:27,805 INFO L85 PathProgramCache]: Analyzing trace with hash -422592565, now seen corresponding path program 2 times [2022-02-20 17:10:27,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:27,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771709239] [2022-02-20 17:10:27,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:27,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:27,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {228#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(21, 2); {228#true} is VALID [2022-02-20 17:10:27,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_~x~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {228#true} is VALID [2022-02-20 17:10:27,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume !!(main_~x~0#1 < 0); {228#true} is VALID [2022-02-20 17:10:27,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {228#true} assume !!(main_~x~0#1 < 10);main_~x~0#1 := 1 + main_~x~0#1; {228#true} is VALID [2022-02-20 17:10:27,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {228#true} assume !!(main_~x~0#1 < 10);main_~x~0#1 := 1 + main_~x~0#1; {228#true} is VALID [2022-02-20 17:10:27,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} assume !!(main_~x~0#1 < 10);main_~x~0#1 := 1 + main_~x~0#1; {228#true} is VALID [2022-02-20 17:10:27,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {228#true} assume !!(main_~x~0#1 < 10);main_~x~0#1 := 1 + main_~x~0#1; {230#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-20 17:10:27,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {230#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !(main_~x~0#1 < 10); {231#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (< 9 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:10:27,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#(and (<= |ULTIMATE.start_main_~x~0#1| 10) (< 9 |ULTIMATE.start_main_~x~0#1|))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_~x~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {232#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:10:27,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {232#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {229#false} is VALID [2022-02-20 17:10:27,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {229#false} assume !false; {229#false} is VALID [2022-02-20 17:10:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:10:27,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:27,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771709239] [2022-02-20 17:10:27,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771709239] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:10:27,872 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:10:27,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:10:27,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378849679] [2022-02-20 17:10:27,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:10:27,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2022-02-20 17:10:27,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:27,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:27,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:27,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:10:27,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:27,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:10:27,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:10:27,880 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:27,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:27,907 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-02-20 17:10:27,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:10:27,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2022-02-20 17:10:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2022-02-20 17:10:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2022-02-20 17:10:27,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 8 transitions. [2022-02-20 17:10:27,914 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:27,914 INFO L225 Difference]: With dead ends: 12 [2022-02-20 17:10:27,914 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:10:27,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:10:27,915 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:27,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:10:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:10:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:10:27,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:27,916 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:27,917 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:27,917 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:27,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:27,917 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:10:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:10:27,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:27,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:27,917 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:27,918 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:27,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:27,918 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:10:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:10:27,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:27,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:27,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:27,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:27,925 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:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:10:27,925 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2022-02-20 17:10:27,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:27,927 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:10:27,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:27,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:10:27,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:27,930 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:10:27,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:10:27,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:10:27,943 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:10:27,947 INFO L858 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-02-20 17:10:27,947 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-02-20 17:10:27,947 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:10:27,948 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:10:27,948 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:10:27,948 INFO L861 garLoopResultBuilder]: At program point L26(lines 19 27) the Hoare annotation is: true [2022-02-20 17:10:27,949 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-02-20 17:10:27,949 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 22 24) the Hoare annotation is: (<= |ULTIMATE.start_main_~x~0#1| 10) [2022-02-20 17:10:27,949 INFO L858 garLoopResultBuilder]: For program point L22-3(lines 22 24) no Hoare annotation was computed. [2022-02-20 17:10:27,949 INFO L858 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-02-20 17:10:27,949 INFO L858 garLoopResultBuilder]: For program point L14(lines 14 18) no Hoare annotation was computed. [2022-02-20 17:10:27,951 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-02-20 17:10:27,952 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:10:27,955 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:10:27,955 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:10:27,955 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 17:10:27,955 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 17:10:27,955 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:10:27,956 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-20 17:10:27,956 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-20 17:10:27,957 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:10:27,957 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-20 17:10:27,957 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:10:27,957 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:10:27,957 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:10:27,957 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:10:27,957 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-20 17:10:27,957 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:10:27,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:10:27 BoogieIcfgContainer [2022-02-20 17:10:27,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:10:27,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:10:27,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:10:27,962 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:10:27,963 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:26" (3/4) ... [2022-02-20 17:10:27,964 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:10:27,970 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 17:10:27,970 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 17:10:27,970 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:10:27,970 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:10:27,987 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:10:27,987 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:10:27,988 INFO L158 Benchmark]: Toolchain (without parser) took 1595.88ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 50.1MB in the beginning and 73.6MB in the end (delta: -23.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:10:27,988 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 63.4MB in the beginning and 63.3MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:10:27,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.32ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 50.0MB in the beginning and 77.9MB in the end (delta: -27.9MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2022-02-20 17:10:27,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.44ms. Allocated memory is still 100.7MB. Free memory was 77.9MB in the beginning and 76.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:10:27,989 INFO L158 Benchmark]: Boogie Preprocessor took 17.27ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 75.6MB in the end (delta: 995.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:10:27,989 INFO L158 Benchmark]: RCFGBuilder took 278.63ms. Allocated memory is still 100.7MB. Free memory was 75.6MB in the beginning and 66.1MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:10:27,990 INFO L158 Benchmark]: TraceAbstraction took 1034.73ms. Allocated memory is still 100.7MB. Free memory was 65.7MB in the beginning and 75.6MB in the end (delta: -9.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:10:27,990 INFO L158 Benchmark]: Witness Printer took 25.21ms. Allocated memory is still 100.7MB. Free memory was 75.6MB in the beginning and 73.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:10:27,991 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.15ms. Allocated memory is still 83.9MB. Free memory was 63.4MB in the beginning and 63.3MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.32ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 50.0MB in the beginning and 77.9MB in the end (delta: -27.9MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.44ms. Allocated memory is still 100.7MB. Free memory was 77.9MB in the beginning and 76.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.27ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 75.6MB in the end (delta: 995.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 278.63ms. Allocated memory is still 100.7MB. Free memory was 75.6MB in the beginning and 66.1MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1034.73ms. Allocated memory is still 100.7MB. Free memory was 65.7MB in the beginning and 75.6MB in the end (delta: -9.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 25.21ms. Allocated memory is still 100.7MB. Free memory was 75.6MB in the beginning and 73.6MB 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, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 30 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 4 HoareAnnotationTreeSize, 2 FomulaSimplifications, 31 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 74 SizeOfPredicates, 0 NumberOfNonLiveVariables, 35 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 10/13 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: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: x <= 10 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:10:28,015 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