./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c --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/recursive-simple/id_i15_o15-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 109f1b0f7b496206cc9c53b0a3b6a7c393044a874053b245259453c5fb39b930 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:16:24,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:16:24,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:16:24,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:16:24,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:16:24,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:16:24,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:16:24,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:16:24,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:16:24,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:16:24,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:16:24,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:16:24,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:16:24,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:16:24,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:16:24,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:16:24,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:16:24,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:16:24,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:16:24,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:16:24,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:16:24,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:16:24,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:16:24,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:16:24,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:16:24,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:16:24,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:16:24,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:16:24,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:16:24,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:16:24,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:16:24,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:16:24,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:16:24,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:16:24,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:16:24,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:16:24,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:16:24,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:16:24,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:16:24,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:16:24,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:16:24,850 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:16:24,877 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:16:24,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:16:24,877 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:16:24,878 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:16:24,878 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:16:24,878 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:16:24,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:16:24,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:16:24,879 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:16:24,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:16:24,880 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:16:24,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:16:24,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:16:24,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:16:24,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:16:24,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:16:24,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:16:24,881 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:16:24,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:16:24,881 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:16:24,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:16:24,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:16:24,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:16:24,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:16:24,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:16:24,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:16:24,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:16:24,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:16:24,884 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:16:24,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:16:24,884 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:16:24,884 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:16:24,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:16:24,885 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 -> 109f1b0f7b496206cc9c53b0a3b6a7c393044a874053b245259453c5fb39b930 [2022-02-20 18:16:25,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:16:25,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:16:25,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:16:25,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:16:25,074 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:16:25,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2022-02-20 18:16:25,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956000ac7/0e2f84027d944602aa1b3bfc0d3bf79b/FLAG7df06b565 [2022-02-20 18:16:25,480 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:16:25,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-2.c [2022-02-20 18:16:25,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956000ac7/0e2f84027d944602aa1b3bfc0d3bf79b/FLAG7df06b565 [2022-02-20 18:16:25,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956000ac7/0e2f84027d944602aa1b3bfc0d3bf79b [2022-02-20 18:16:25,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:16:25,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:16:25,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:16:25,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:16:25,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:16:25,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73dd677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25, skipping insertion in model container [2022-02-20 18:16:25,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:16:25,536 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:16:25,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-2.c[454,467] [2022-02-20 18:16:25,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:16:25,676 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:16:25,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-2.c[454,467] [2022-02-20 18:16:25,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:16:25,707 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:16:25,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25 WrapperNode [2022-02-20 18:16:25,708 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:16:25,709 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:16:25,709 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:16:25,709 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:16:25,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,735 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2022-02-20 18:16:25,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:16:25,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:16:25,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:16:25,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:16:25,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:16:25,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:16:25,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:16:25,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:16:25,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:16:25,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:25,776 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 18:16:25,777 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 18:16:25,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:16:25,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:16:25,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:16:25,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:16:25,805 INFO L130 BoogieDeclarations]: Found specification of procedure id [2022-02-20 18:16:25,806 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2022-02-20 18:16:25,846 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:16:25,847 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:16:25,920 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:16:25,925 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:16:25,939 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:16:25,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:16:25 BoogieIcfgContainer [2022-02-20 18:16:25,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:16:25,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:16:25,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:16:25,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:16:25,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:16:25" (1/3) ... [2022-02-20 18:16:25,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d852bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:16:25, skipping insertion in model container [2022-02-20 18:16:25,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (2/3) ... [2022-02-20 18:16:25,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d852bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:16:25, skipping insertion in model container [2022-02-20 18:16:25,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:16:25" (3/3) ... [2022-02-20 18:16:25,946 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i15_o15-2.c [2022-02-20 18:16:25,950 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:16:25,950 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:16:25,984 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:16:25,991 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 18:16:25,992 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:16:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:16:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 18:16:26,022 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:26,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:26,023 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:26,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:26,031 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2022-02-20 18:16:26,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:26,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423728953] [2022-02-20 18:16:26,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:26,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} ~x := #in~x; {26#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {27#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#(= |id_#in~x| 0)} assume true; {27#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#(= |id_#in~x| 0)} {21#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {20#false} is VALID [2022-02-20 18:16:26,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#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(15, 2);call #Ultimate.allocInit(12, 3); {19#true} is VALID [2022-02-20 18:16:26,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {21#(= |ULTIMATE.start_main_~input~0#1| 15)} is VALID [2022-02-20 18:16:26,241 INFO L272 TraceCheckUtils]: 2: Hoare triple {21#(= |ULTIMATE.start_main_~input~0#1| 15)} call main_#t~ret5#1 := id(main_~input~0#1); {19#true} is VALID [2022-02-20 18:16:26,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {19#true} ~x := #in~x; {26#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {27#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#(= |id_#in~x| 0)} assume true; {27#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,243 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {27#(= |id_#in~x| 0)} {21#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {20#false} is VALID [2022-02-20 18:16:26,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {20#false} is VALID [2022-02-20 18:16:26,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {20#false} assume 15 == main_~result~0#1; {20#false} is VALID [2022-02-20 18:16:26,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-02-20 18:16:26,245 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 18:16:26,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:26,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423728953] [2022-02-20 18:16:26,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423728953] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:16:26,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:16:26,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:16:26,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439027439] [2022-02-20 18:16:26,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:16:26,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-02-20 18:16:26,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:26,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:16:26,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:26,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:16:26,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:26,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:16:26,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:16:26,294 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:16:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:26,428 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-02-20 18:16:26,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:16:26,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-02-20 18:16:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:16:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 18:16:26,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:16:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 18:16:26,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-02-20 18:16:26,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:26,485 INFO L225 Difference]: With dead ends: 25 [2022-02-20 18:16:26,485 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 18:16:26,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:16:26,492 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:16:26,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:16:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 18:16:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 18:16:26,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:26,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:16:26,513 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:16:26,513 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:16:26,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:26,516 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-20 18:16:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 18:16:26,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:26,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:26,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 15 states. [2022-02-20 18:16:26,517 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 15 states. [2022-02-20 18:16:26,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:26,518 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-20 18:16:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 18:16:26,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:26,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:26,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:26,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:16:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-02-20 18:16:26,521 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-02-20 18:16:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:26,522 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-02-20 18:16:26,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:16:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 18:16:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 18:16:26,522 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:26,523 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:26,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:16:26,523 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:26,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:26,524 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2022-02-20 18:16:26,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:26,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067532704] [2022-02-20 18:16:26,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:26,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#true} ~x := #in~x; {121#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {127#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#(= |id_#in~x| 0)} assume true; {127#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#(= |id_#in~x| 0)} {121#(= |id_#in~x| id_~x)} #27#return; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#true} ~x := #in~x; {121#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#(= |id_#in~x| id_~x)} assume !(0 == ~x); {121#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,647 INFO L272 TraceCheckUtils]: 2: Hoare triple {121#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {108#true} is VALID [2022-02-20 18:16:26,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {108#true} ~x := #in~x; {121#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,648 INFO L290 TraceCheckUtils]: 4: Hoare triple {121#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {127#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#(= |id_#in~x| 0)} assume true; {127#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,649 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {127#(= |id_#in~x| 0)} {121#(= |id_#in~x| id_~x)} #27#return; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {126#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {126#(<= |id_#in~x| 1)} assume true; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,650 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {126#(<= |id_#in~x| 1)} {110#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {109#false} is VALID [2022-02-20 18:16:26,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#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(15, 2);call #Ultimate.allocInit(12, 3); {108#true} is VALID [2022-02-20 18:16:26,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {108#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {110#(= |ULTIMATE.start_main_~input~0#1| 15)} is VALID [2022-02-20 18:16:26,651 INFO L272 TraceCheckUtils]: 2: Hoare triple {110#(= |ULTIMATE.start_main_~input~0#1| 15)} call main_#t~ret5#1 := id(main_~input~0#1); {108#true} is VALID [2022-02-20 18:16:26,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {108#true} ~x := #in~x; {121#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {121#(= |id_#in~x| id_~x)} assume !(0 == ~x); {121#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,652 INFO L272 TraceCheckUtils]: 5: Hoare triple {121#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {108#true} is VALID [2022-02-20 18:16:26,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {108#true} ~x := #in~x; {121#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {121#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {127#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {127#(= |id_#in~x| 0)} assume true; {127#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,654 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {127#(= |id_#in~x| 0)} {121#(= |id_#in~x| id_~x)} #27#return; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {126#(<= |id_#in~x| 1)} assume true; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,656 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {126#(<= |id_#in~x| 1)} {110#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {109#false} is VALID [2022-02-20 18:16:26,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {109#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {109#false} is VALID [2022-02-20 18:16:26,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {109#false} assume 15 == main_~result~0#1; {109#false} is VALID [2022-02-20 18:16:26,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {109#false} assume !false; {109#false} is VALID [2022-02-20 18:16:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:16:26,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:26,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067532704] [2022-02-20 18:16:26,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067532704] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:26,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465893600] [2022-02-20 18:16:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:26,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:26,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:26,659 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 18:16:26,660 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 18:16:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 18:16:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:26,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#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(15, 2);call #Ultimate.allocInit(12, 3); {108#true} is VALID [2022-02-20 18:16:26,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {108#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {134#(<= 15 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:26,840 INFO L272 TraceCheckUtils]: 2: Hoare triple {134#(<= 15 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {108#true} is VALID [2022-02-20 18:16:26,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {108#true} ~x := #in~x; {141#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {141#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {141#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,841 INFO L272 TraceCheckUtils]: 5: Hoare triple {141#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {108#true} is VALID [2022-02-20 18:16:26,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {108#true} ~x := #in~x; {141#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {154#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#(<= |id_#in~x| 0)} assume true; {154#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,843 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {154#(<= |id_#in~x| 0)} {141#(<= |id_#in~x| id_~x)} #27#return; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {126#(<= |id_#in~x| 1)} assume true; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,845 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {126#(<= |id_#in~x| 1)} {134#(<= 15 |ULTIMATE.start_main_~input~0#1|)} #25#return; {109#false} is VALID [2022-02-20 18:16:26,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {109#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {109#false} is VALID [2022-02-20 18:16:26,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {109#false} assume 15 == main_~result~0#1; {109#false} is VALID [2022-02-20 18:16:26,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {109#false} assume !false; {109#false} is VALID [2022-02-20 18:16:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:16:26,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:27,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {109#false} assume !false; {109#false} is VALID [2022-02-20 18:16:27,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {109#false} assume 15 == main_~result~0#1; {109#false} is VALID [2022-02-20 18:16:27,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {109#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {109#false} is VALID [2022-02-20 18:16:27,308 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {126#(<= |id_#in~x| 1)} {188#(< 1 |ULTIMATE.start_main_~input~0#1|)} #25#return; {109#false} is VALID [2022-02-20 18:16:27,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {126#(<= |id_#in~x| 1)} assume true; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,310 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {154#(<= |id_#in~x| 0)} {201#(or (< 1 id_~x) (<= |id_#in~x| 1))} #27#return; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#(<= |id_#in~x| 0)} assume true; {154#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} assume 0 == ~x;#res := 0; {154#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {108#true} ~x := #in~x; {211#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} is VALID [2022-02-20 18:16:27,311 INFO L272 TraceCheckUtils]: 5: Hoare triple {201#(or (< 1 id_~x) (<= |id_#in~x| 1))} call #t~ret4 := id(~x - 1); {108#true} is VALID [2022-02-20 18:16:27,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {201#(or (< 1 id_~x) (<= |id_#in~x| 1))} assume !(0 == ~x); {201#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:27,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {108#true} ~x := #in~x; {201#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:27,312 INFO L272 TraceCheckUtils]: 2: Hoare triple {188#(< 1 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {108#true} is VALID [2022-02-20 18:16:27,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {108#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {188#(< 1 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:27,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#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(15, 2);call #Ultimate.allocInit(12, 3); {108#true} is VALID [2022-02-20 18:16:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:16:27,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465893600] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:27,313 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:27,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-02-20 18:16:27,314 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798171857] [2022-02-20 18:16:27,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:27,315 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) Word has length 16 [2022-02-20 18:16:27,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:27,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:16:27,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:27,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:16:27,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:27,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:16:27,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:16:27,337 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:16:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:27,446 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 18:16:27,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:16:27,446 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) Word has length 16 [2022-02-20 18:16:27,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:16:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 18:16:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:16:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 18:16:27,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-02-20 18:16:27,486 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 18:16:27,488 INFO L225 Difference]: With dead ends: 22 [2022-02-20 18:16:27,488 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 18:16:27,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:16:27,489 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:16:27,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 39 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:16:27,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 18:16:27,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 18:16:27,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:27,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 18:16:27,493 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 18:16:27,493 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 18:16:27,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:27,495 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 18:16:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 18:16:27,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:27,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:27,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 18 states. [2022-02-20 18:16:27,496 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 18 states. [2022-02-20 18:16:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:27,497 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 18:16:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 18:16:27,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:27,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:27,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:27,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 18:16:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-02-20 18:16:27,500 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-02-20 18:16:27,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:27,500 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-02-20 18:16:27,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:16:27,500 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 18:16:27,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 18:16:27,501 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:27,501 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:27,519 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 18:16:27,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:27,720 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:27,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2022-02-20 18:16:27,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:27,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52947987] [2022-02-20 18:16:27,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:27,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:27,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:27,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:27,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#(= |id_#in~x| 0)} assume true; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#(= |id_#in~x| 0)} {331#(= |id_#in~x| id_~x)} #27#return; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#(= |id_#in~x| id_~x)} assume !(0 == ~x); {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,848 INFO L272 TraceCheckUtils]: 2: Hoare triple {331#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:27,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,848 INFO L290 TraceCheckUtils]: 4: Hoare triple {331#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#(= |id_#in~x| 0)} assume true; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,849 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {348#(= |id_#in~x| 0)} {331#(= |id_#in~x| id_~x)} #27#return; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {347#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {347#(<= |id_#in~x| 1)} assume true; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,851 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {347#(<= |id_#in~x| 1)} {331#(= |id_#in~x| id_~x)} #27#return; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#(= |id_#in~x| id_~x)} assume !(0 == ~x); {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,852 INFO L272 TraceCheckUtils]: 2: Hoare triple {331#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:27,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {331#(= |id_#in~x| id_~x)} assume !(0 == ~x); {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,853 INFO L272 TraceCheckUtils]: 5: Hoare triple {331#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:27,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {348#(= |id_#in~x| 0)} assume true; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,854 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {348#(= |id_#in~x| 0)} {331#(= |id_#in~x| id_~x)} #27#return; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {347#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {347#(<= |id_#in~x| 1)} assume true; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,858 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {347#(<= |id_#in~x| 1)} {331#(= |id_#in~x| id_~x)} #27#return; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {342#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {342#(<= |id_#in~x| 2)} assume true; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,860 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {342#(<= |id_#in~x| 2)} {314#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {313#false} is VALID [2022-02-20 18:16:27,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#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(15, 2);call #Ultimate.allocInit(12, 3); {312#true} is VALID [2022-02-20 18:16:27,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {314#(= |ULTIMATE.start_main_~input~0#1| 15)} is VALID [2022-02-20 18:16:27,861 INFO L272 TraceCheckUtils]: 2: Hoare triple {314#(= |ULTIMATE.start_main_~input~0#1| 15)} call main_#t~ret5#1 := id(main_~input~0#1); {312#true} is VALID [2022-02-20 18:16:27,861 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,861 INFO L290 TraceCheckUtils]: 4: Hoare triple {331#(= |id_#in~x| id_~x)} assume !(0 == ~x); {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,861 INFO L272 TraceCheckUtils]: 5: Hoare triple {331#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:27,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(= |id_#in~x| id_~x)} assume !(0 == ~x); {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,863 INFO L272 TraceCheckUtils]: 8: Hoare triple {331#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:27,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {331#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {348#(= |id_#in~x| 0)} assume true; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,867 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {348#(= |id_#in~x| 0)} {331#(= |id_#in~x| id_~x)} #27#return; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#(<= |id_#in~x| 1)} assume true; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,879 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {347#(<= |id_#in~x| 1)} {331#(= |id_#in~x| id_~x)} #27#return; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {342#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {342#(<= |id_#in~x| 2)} assume true; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,880 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {342#(<= |id_#in~x| 2)} {314#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {313#false} is VALID [2022-02-20 18:16:27,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {313#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {313#false} is VALID [2022-02-20 18:16:27,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {313#false} assume 15 == main_~result~0#1; {313#false} is VALID [2022-02-20 18:16:27,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 18:16:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 18:16:27,881 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:27,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52947987] [2022-02-20 18:16:27,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52947987] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:27,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975081922] [2022-02-20 18:16:27,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 18:16:27,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:27,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:27,886 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:16:27,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 18:16:27,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 18:16:27,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:16:27,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 18:16:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:27,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:28,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#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(15, 2);call #Ultimate.allocInit(12, 3); {312#true} is VALID [2022-02-20 18:16:28,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {355#(<= 15 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:28,090 INFO L272 TraceCheckUtils]: 2: Hoare triple {355#(<= 15 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {312#true} is VALID [2022-02-20 18:16:28,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {362#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:28,090 INFO L290 TraceCheckUtils]: 4: Hoare triple {362#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {362#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:28,091 INFO L272 TraceCheckUtils]: 5: Hoare triple {362#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:28,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} ~x := #in~x; {362#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:28,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {362#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {362#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:28,091 INFO L272 TraceCheckUtils]: 8: Hoare triple {362#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:28,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#true} ~x := #in~x; {362#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:28,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {362#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {384#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:28,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {384#(<= |id_#in~x| 0)} assume true; {384#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:28,093 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {384#(<= |id_#in~x| 0)} {362#(<= |id_#in~x| id_~x)} #27#return; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:28,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:28,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#(<= |id_#in~x| 1)} assume true; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:28,095 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {347#(<= |id_#in~x| 1)} {362#(<= |id_#in~x| id_~x)} #27#return; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:28,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {342#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:28,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {342#(<= |id_#in~x| 2)} assume true; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:28,096 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {342#(<= |id_#in~x| 2)} {355#(<= 15 |ULTIMATE.start_main_~input~0#1|)} #25#return; {313#false} is VALID [2022-02-20 18:16:28,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {313#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {313#false} is VALID [2022-02-20 18:16:28,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {313#false} assume 15 == main_~result~0#1; {313#false} is VALID [2022-02-20 18:16:28,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 18:16:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 18:16:28,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:29,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 18:16:29,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {313#false} assume 15 == main_~result~0#1; {313#false} is VALID [2022-02-20 18:16:29,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {313#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {313#false} is VALID [2022-02-20 18:16:29,085 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {342#(<= |id_#in~x| 2)} {427#(< 2 |ULTIMATE.start_main_~input~0#1|)} #25#return; {313#false} is VALID [2022-02-20 18:16:29,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {342#(<= |id_#in~x| 2)} assume true; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {342#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,091 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {347#(<= |id_#in~x| 1)} {440#(or (<= |id_#in~x| 2) (< 2 id_~x))} #27#return; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#(<= |id_#in~x| 1)} assume true; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,092 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {384#(<= |id_#in~x| 0)} {453#(or (< 1 id_~x) (<= |id_#in~x| 1))} #27#return; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {384#(<= |id_#in~x| 0)} assume true; {384#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {463#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} assume 0 == ~x;#res := 0; {384#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#true} ~x := #in~x; {463#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} is VALID [2022-02-20 18:16:29,093 INFO L272 TraceCheckUtils]: 8: Hoare triple {453#(or (< 1 id_~x) (<= |id_#in~x| 1))} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:29,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {453#(or (< 1 id_~x) (<= |id_#in~x| 1))} assume !(0 == ~x); {453#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:29,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} ~x := #in~x; {453#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:29,094 INFO L272 TraceCheckUtils]: 5: Hoare triple {440#(or (<= |id_#in~x| 2) (< 2 id_~x))} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:29,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {440#(or (<= |id_#in~x| 2) (< 2 id_~x))} assume !(0 == ~x); {440#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:29,095 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {440#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:29,095 INFO L272 TraceCheckUtils]: 2: Hoare triple {427#(< 2 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {312#true} is VALID [2022-02-20 18:16:29,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {427#(< 2 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:29,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#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(15, 2);call #Ultimate.allocInit(12, 3); {312#true} is VALID [2022-02-20 18:16:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 18:16:29,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975081922] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:29,096 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:29,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 14 [2022-02-20 18:16:29,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668171963] [2022-02-20 18:16:29,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:29,097 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) Word has length 22 [2022-02-20 18:16:29,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:29,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 18:16:29,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:29,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 18:16:29,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:29,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 18:16:29,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:16:29,126 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 18:16:29,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:29,261 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-20 18:16:29,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:16:29,262 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) Word has length 22 [2022-02-20 18:16:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:29,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 18:16:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-02-20 18:16:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 18:16:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-02-20 18:16:29,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 26 transitions. [2022-02-20 18:16:29,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:29,291 INFO L225 Difference]: With dead ends: 25 [2022-02-20 18:16:29,291 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 18:16:29,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:16:29,292 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 39 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:16:29,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 36 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:16:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 18:16:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 18:16:29,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:29,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:16:29,295 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:16:29,295 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:16:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:29,296 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 18:16:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 18:16:29,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:29,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:29,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 21 states. [2022-02-20 18:16:29,297 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 21 states. [2022-02-20 18:16:29,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:29,298 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 18:16:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 18:16:29,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:29,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:29,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:29,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:16:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-02-20 18:16:29,300 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2022-02-20 18:16:29,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:29,300 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-02-20 18:16:29,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 18:16:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 18:16:29,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 18:16:29,301 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:29,301 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:29,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 18:16:29,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 18:16:29,518 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:29,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:29,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2022-02-20 18:16:29,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:29,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188847506] [2022-02-20 18:16:29,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:29,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:29,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:29,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:29,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:29,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:29,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {643#(= |id_#in~x| 0)} assume true; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {643#(= |id_#in~x| 0)} {609#(= |id_#in~x| id_~x)} #27#return; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,629 INFO L272 TraceCheckUtils]: 2: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {609#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {643#(= |id_#in~x| 0)} assume true; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,631 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {643#(= |id_#in~x| 0)} {609#(= |id_#in~x| id_~x)} #27#return; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {642#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {642#(<= |id_#in~x| 1)} assume true; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,632 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {642#(<= |id_#in~x| 1)} {609#(= |id_#in~x| id_~x)} #27#return; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,633 INFO L272 TraceCheckUtils]: 2: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,633 INFO L290 TraceCheckUtils]: 3: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,634 INFO L290 TraceCheckUtils]: 4: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,634 INFO L272 TraceCheckUtils]: 5: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {643#(= |id_#in~x| 0)} assume true; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,635 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {643#(= |id_#in~x| 0)} {609#(= |id_#in~x| id_~x)} #27#return; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {642#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {642#(<= |id_#in~x| 1)} assume true; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,636 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {642#(<= |id_#in~x| 1)} {609#(= |id_#in~x| id_~x)} #27#return; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {637#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {637#(<= |id_#in~x| 2)} assume true; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,638 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {637#(<= |id_#in~x| 2)} {609#(= |id_#in~x| id_~x)} #27#return; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,639 INFO L272 TraceCheckUtils]: 2: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,639 INFO L272 TraceCheckUtils]: 5: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,640 INFO L272 TraceCheckUtils]: 8: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {609#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {643#(= |id_#in~x| 0)} assume true; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,641 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {643#(= |id_#in~x| 0)} {609#(= |id_#in~x| id_~x)} #27#return; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {642#(<= |id_#in~x| 1)} assume true; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,643 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {642#(<= |id_#in~x| 1)} {609#(= |id_#in~x| id_~x)} #27#return; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {637#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {637#(<= |id_#in~x| 2)} assume true; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,644 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {637#(<= |id_#in~x| 2)} {609#(= |id_#in~x| id_~x)} #27#return; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {626#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {626#(<= |id_#in~x| 3)} assume true; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,645 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {626#(<= |id_#in~x| 3)} {586#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {585#false} is VALID [2022-02-20 18:16:29,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#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(15, 2);call #Ultimate.allocInit(12, 3); {584#true} is VALID [2022-02-20 18:16:29,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {586#(= |ULTIMATE.start_main_~input~0#1| 15)} is VALID [2022-02-20 18:16:29,646 INFO L272 TraceCheckUtils]: 2: Hoare triple {586#(= |ULTIMATE.start_main_~input~0#1| 15)} call main_#t~ret5#1 := id(main_~input~0#1); {584#true} is VALID [2022-02-20 18:16:29,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,646 INFO L290 TraceCheckUtils]: 4: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,646 INFO L272 TraceCheckUtils]: 5: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,647 INFO L272 TraceCheckUtils]: 8: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,648 INFO L272 TraceCheckUtils]: 11: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {609#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {643#(= |id_#in~x| 0)} assume true; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,649 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {643#(= |id_#in~x| 0)} {609#(= |id_#in~x| id_~x)} #27#return; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {642#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {642#(<= |id_#in~x| 1)} assume true; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,651 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {642#(<= |id_#in~x| 1)} {609#(= |id_#in~x| id_~x)} #27#return; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {637#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {637#(<= |id_#in~x| 2)} assume true; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,652 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {637#(<= |id_#in~x| 2)} {609#(= |id_#in~x| id_~x)} #27#return; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {626#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {626#(<= |id_#in~x| 3)} assume true; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,653 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {626#(<= |id_#in~x| 3)} {586#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {585#false} is VALID [2022-02-20 18:16:29,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {585#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {585#false} is VALID [2022-02-20 18:16:29,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {585#false} assume 15 == main_~result~0#1; {585#false} is VALID [2022-02-20 18:16:29,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {585#false} assume !false; {585#false} is VALID [2022-02-20 18:16:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 18:16:29,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:29,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188847506] [2022-02-20 18:16:29,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188847506] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:29,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520833805] [2022-02-20 18:16:29,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 18:16:29,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:29,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:29,655 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:16:29,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 18:16:29,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 18:16:29,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:16:29,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 18:16:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:29,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:29,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#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(15, 2);call #Ultimate.allocInit(12, 3); {584#true} is VALID [2022-02-20 18:16:29,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {584#true} is VALID [2022-02-20 18:16:29,892 INFO L272 TraceCheckUtils]: 2: Hoare triple {584#true} call main_#t~ret5#1 := id(main_~input~0#1); {584#true} is VALID [2022-02-20 18:16:29,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {584#true} ~x := #in~x; {584#true} is VALID [2022-02-20 18:16:29,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {584#true} assume !(0 == ~x); {584#true} is VALID [2022-02-20 18:16:29,893 INFO L272 TraceCheckUtils]: 5: Hoare triple {584#true} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} ~x := #in~x; {584#true} is VALID [2022-02-20 18:16:29,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {584#true} assume !(0 == ~x); {584#true} is VALID [2022-02-20 18:16:29,893 INFO L272 TraceCheckUtils]: 8: Hoare triple {584#true} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#true} ~x := #in~x; {584#true} is VALID [2022-02-20 18:16:29,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {584#true} assume !(0 == ~x); {584#true} is VALID [2022-02-20 18:16:29,893 INFO L272 TraceCheckUtils]: 11: Hoare triple {584#true} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {584#true} ~x := #in~x; {584#true} is VALID [2022-02-20 18:16:29,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {584#true} assume 0 == ~x;#res := 0; {686#(<= |id_#res| 0)} is VALID [2022-02-20 18:16:29,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {686#(<= |id_#res| 0)} assume true; {686#(<= |id_#res| 0)} is VALID [2022-02-20 18:16:29,895 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {686#(<= |id_#res| 0)} {584#true} #27#return; {693#(<= |id_#t~ret4| 0)} is VALID [2022-02-20 18:16:29,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {693#(<= |id_#t~ret4| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {697#(<= |id_#res| 1)} is VALID [2022-02-20 18:16:29,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {697#(<= |id_#res| 1)} assume true; {697#(<= |id_#res| 1)} is VALID [2022-02-20 18:16:29,897 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {697#(<= |id_#res| 1)} {584#true} #27#return; {704#(<= |id_#t~ret4| 1)} is VALID [2022-02-20 18:16:29,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {704#(<= |id_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {708#(<= |id_#res| 2)} is VALID [2022-02-20 18:16:29,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {708#(<= |id_#res| 2)} assume true; {708#(<= |id_#res| 2)} is VALID [2022-02-20 18:16:29,898 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {708#(<= |id_#res| 2)} {584#true} #27#return; {715#(<= |id_#t~ret4| 2)} is VALID [2022-02-20 18:16:29,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {715#(<= |id_#t~ret4| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {719#(<= |id_#res| 3)} is VALID [2022-02-20 18:16:29,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {719#(<= |id_#res| 3)} assume true; {719#(<= |id_#res| 3)} is VALID [2022-02-20 18:16:29,901 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {719#(<= |id_#res| 3)} {584#true} #25#return; {726#(<= |ULTIMATE.start_main_#t~ret5#1| 3)} is VALID [2022-02-20 18:16:29,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {726#(<= |ULTIMATE.start_main_#t~ret5#1| 3)} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {730#(<= |ULTIMATE.start_main_~result~0#1| 3)} is VALID [2022-02-20 18:16:29,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {730#(<= |ULTIMATE.start_main_~result~0#1| 3)} assume 15 == main_~result~0#1; {585#false} is VALID [2022-02-20 18:16:29,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {585#false} assume !false; {585#false} is VALID [2022-02-20 18:16:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 18:16:29,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:31,008 INFO L290 TraceCheckUtils]: 27: Hoare triple {585#false} assume !false; {585#false} is VALID [2022-02-20 18:16:31,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {740#(not (<= 15 |ULTIMATE.start_main_~result~0#1|))} assume 15 == main_~result~0#1; {585#false} is VALID [2022-02-20 18:16:31,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {744#(< |ULTIMATE.start_main_#t~ret5#1| 15)} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {740#(not (<= 15 |ULTIMATE.start_main_~result~0#1|))} is VALID [2022-02-20 18:16:31,010 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {751#(< |id_#res| 15)} {584#true} #25#return; {744#(< |ULTIMATE.start_main_#t~ret5#1| 15)} is VALID [2022-02-20 18:16:31,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {751#(< |id_#res| 15)} assume true; {751#(< |id_#res| 15)} is VALID [2022-02-20 18:16:31,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#(< |id_#t~ret4| 14)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {751#(< |id_#res| 15)} is VALID [2022-02-20 18:16:31,011 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {765#(< |id_#res| 14)} {584#true} #27#return; {758#(< |id_#t~ret4| 14)} is VALID [2022-02-20 18:16:31,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {765#(< |id_#res| 14)} assume true; {765#(< |id_#res| 14)} is VALID [2022-02-20 18:16:31,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {772#(< |id_#t~ret4| 13)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {765#(< |id_#res| 14)} is VALID [2022-02-20 18:16:31,014 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {779#(< |id_#res| 13)} {584#true} #27#return; {772#(< |id_#t~ret4| 13)} is VALID [2022-02-20 18:16:31,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {779#(< |id_#res| 13)} assume true; {779#(< |id_#res| 13)} is VALID [2022-02-20 18:16:31,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {786#(< |id_#t~ret4| 12)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {779#(< |id_#res| 13)} is VALID [2022-02-20 18:16:31,015 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {793#(< |id_#res| 12)} {584#true} #27#return; {786#(< |id_#t~ret4| 12)} is VALID [2022-02-20 18:16:31,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {793#(< |id_#res| 12)} assume true; {793#(< |id_#res| 12)} is VALID [2022-02-20 18:16:31,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {584#true} assume 0 == ~x;#res := 0; {793#(< |id_#res| 12)} is VALID [2022-02-20 18:16:31,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {584#true} ~x := #in~x; {584#true} is VALID [2022-02-20 18:16:31,016 INFO L272 TraceCheckUtils]: 11: Hoare triple {584#true} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:31,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {584#true} assume !(0 == ~x); {584#true} is VALID [2022-02-20 18:16:31,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#true} ~x := #in~x; {584#true} is VALID [2022-02-20 18:16:31,016 INFO L272 TraceCheckUtils]: 8: Hoare triple {584#true} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:31,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {584#true} assume !(0 == ~x); {584#true} is VALID [2022-02-20 18:16:31,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} ~x := #in~x; {584#true} is VALID [2022-02-20 18:16:31,016 INFO L272 TraceCheckUtils]: 5: Hoare triple {584#true} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:31,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {584#true} assume !(0 == ~x); {584#true} is VALID [2022-02-20 18:16:31,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {584#true} ~x := #in~x; {584#true} is VALID [2022-02-20 18:16:31,016 INFO L272 TraceCheckUtils]: 2: Hoare triple {584#true} call main_#t~ret5#1 := id(main_~input~0#1); {584#true} is VALID [2022-02-20 18:16:31,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {584#true} is VALID [2022-02-20 18:16:31,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#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(15, 2);call #Ultimate.allocInit(12, 3); {584#true} is VALID [2022-02-20 18:16:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 18:16:31,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520833805] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:31,017 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:31,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2022-02-20 18:16:31,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907398993] [2022-02-20 18:16:31,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:31,018 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) Word has length 28 [2022-02-20 18:16:31,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:31,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 18:16:31,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:31,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-20 18:16:31,060 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:31,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-20 18:16:31,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2022-02-20 18:16:31,061 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 18:16:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:31,430 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 18:16:31,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 18:16:31,431 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) Word has length 28 [2022-02-20 18:16:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 18:16:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2022-02-20 18:16:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 18:16:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2022-02-20 18:16:31,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 43 transitions. [2022-02-20 18:16:31,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:31,473 INFO L225 Difference]: With dead ends: 39 [2022-02-20 18:16:31,473 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 18:16:31,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1388, Unknown=0, NotChecked=0, Total=1640 [2022-02-20 18:16:31,475 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:16:31,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 87 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:16:31,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 18:16:31,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 18:16:31,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:31,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 18:16:31,479 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 18:16:31,479 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 18:16:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:31,482 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 18:16:31,482 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 18:16:31,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:31,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:31,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) Second operand 33 states. [2022-02-20 18:16:31,484 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) Second operand 33 states. [2022-02-20 18:16:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:31,487 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 18:16:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 18:16:31,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:31,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:31,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:31,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 18:16:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-02-20 18:16:31,492 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2022-02-20 18:16:31,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:31,492 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-02-20 18:16:31,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 18 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2022-02-20 18:16:31,494 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 18:16:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:16:31,495 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:31,495 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:31,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 18:16:31,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:31,711 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:31,712 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 4 times [2022-02-20 18:16:31,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:31,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136063537] [2022-02-20 18:16:31,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:31,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {1049#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#(= |id_#in~x| 0)} assume true; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#(= |id_#in~x| 0)} {1049#(= |id_#in~x| id_~x)} #27#return; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,939 INFO L272 TraceCheckUtils]: 2: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {1049#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#(= |id_#in~x| 0)} assume true; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,941 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1211#(= |id_#in~x| 0)} {1049#(= |id_#in~x| id_~x)} #27#return; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {1210#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {1210#(<= |id_#in~x| 1)} assume true; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,942 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1210#(<= |id_#in~x| 1)} {1049#(= |id_#in~x| id_~x)} #27#return; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,943 INFO L272 TraceCheckUtils]: 2: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,944 INFO L272 TraceCheckUtils]: 5: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {1049#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {1211#(= |id_#in~x| 0)} assume true; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,945 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1211#(= |id_#in~x| 0)} {1049#(= |id_#in~x| id_~x)} #27#return; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {1210#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {1210#(<= |id_#in~x| 1)} assume true; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,946 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1210#(<= |id_#in~x| 1)} {1049#(= |id_#in~x| id_~x)} #27#return; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {1205#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {1205#(<= |id_#in~x| 2)} assume true; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,947 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1205#(<= |id_#in~x| 2)} {1049#(= |id_#in~x| id_~x)} #27#return; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,949 INFO L272 TraceCheckUtils]: 2: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,950 INFO L290 TraceCheckUtils]: 4: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,950 INFO L272 TraceCheckUtils]: 5: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,950 INFO L272 TraceCheckUtils]: 8: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {1049#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {1211#(= |id_#in~x| 0)} assume true; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,952 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1211#(= |id_#in~x| 0)} {1049#(= |id_#in~x| id_~x)} #27#return; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {1210#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {1210#(<= |id_#in~x| 1)} assume true; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,953 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1210#(<= |id_#in~x| 1)} {1049#(= |id_#in~x| id_~x)} #27#return; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {1205#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {1205#(<= |id_#in~x| 2)} assume true; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,954 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1205#(<= |id_#in~x| 2)} {1049#(= |id_#in~x| id_~x)} #27#return; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {1194#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {1194#(<= |id_#in~x| 3)} assume true; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,956 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1194#(<= |id_#in~x| 3)} {1049#(= |id_#in~x| id_~x)} #27#return; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,957 INFO L272 TraceCheckUtils]: 2: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,957 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,957 INFO L290 TraceCheckUtils]: 4: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,957 INFO L272 TraceCheckUtils]: 5: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,958 INFO L272 TraceCheckUtils]: 8: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,963 INFO L272 TraceCheckUtils]: 11: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {1049#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {1211#(= |id_#in~x| 0)} assume true; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,969 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1211#(= |id_#in~x| 0)} {1049#(= |id_#in~x| id_~x)} #27#return; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {1210#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {1210#(<= |id_#in~x| 1)} assume true; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,971 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1210#(<= |id_#in~x| 1)} {1049#(= |id_#in~x| id_~x)} #27#return; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {1205#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {1205#(<= |id_#in~x| 2)} assume true; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,973 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1205#(<= |id_#in~x| 2)} {1049#(= |id_#in~x| id_~x)} #27#return; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {1194#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {1194#(<= |id_#in~x| 3)} assume true; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,976 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1194#(<= |id_#in~x| 3)} {1049#(= |id_#in~x| id_~x)} #27#return; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {1177#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {1177#(<= |id_#in~x| 4)} assume true; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,977 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1177#(<= |id_#in~x| 4)} {1049#(= |id_#in~x| id_~x)} #27#return; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:31,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,978 INFO L272 TraceCheckUtils]: 2: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,978 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,978 INFO L290 TraceCheckUtils]: 4: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,979 INFO L272 TraceCheckUtils]: 5: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,979 INFO L272 TraceCheckUtils]: 8: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,980 INFO L272 TraceCheckUtils]: 11: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,980 INFO L272 TraceCheckUtils]: 14: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {1049#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#(= |id_#in~x| 0)} assume true; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,982 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1211#(= |id_#in~x| 0)} {1049#(= |id_#in~x| id_~x)} #27#return; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {1210#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {1210#(<= |id_#in~x| 1)} assume true; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,983 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1210#(<= |id_#in~x| 1)} {1049#(= |id_#in~x| id_~x)} #27#return; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {1205#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {1205#(<= |id_#in~x| 2)} assume true; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,984 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1205#(<= |id_#in~x| 2)} {1049#(= |id_#in~x| id_~x)} #27#return; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {1194#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {1194#(<= |id_#in~x| 3)} assume true; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,985 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1194#(<= |id_#in~x| 3)} {1049#(= |id_#in~x| id_~x)} #27#return; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {1177#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {1177#(<= |id_#in~x| 4)} assume true; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,986 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1177#(<= |id_#in~x| 4)} {1049#(= |id_#in~x| id_~x)} #27#return; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:31,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {1154#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:31,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {1154#(<= |id_#in~x| 5)} assume true; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:31,987 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1154#(<= |id_#in~x| 5)} {1049#(= |id_#in~x| id_~x)} #27#return; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:31,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,988 INFO L272 TraceCheckUtils]: 2: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,988 INFO L272 TraceCheckUtils]: 5: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,989 INFO L272 TraceCheckUtils]: 8: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,990 INFO L272 TraceCheckUtils]: 11: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,991 INFO L272 TraceCheckUtils]: 14: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,992 INFO L272 TraceCheckUtils]: 17: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:31,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {1049#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {1211#(= |id_#in~x| 0)} assume true; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,996 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1211#(= |id_#in~x| 0)} {1049#(= |id_#in~x| id_~x)} #27#return; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {1210#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {1210#(<= |id_#in~x| 1)} assume true; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,997 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1210#(<= |id_#in~x| 1)} {1049#(= |id_#in~x| id_~x)} #27#return; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {1205#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {1205#(<= |id_#in~x| 2)} assume true; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,998 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1205#(<= |id_#in~x| 2)} {1049#(= |id_#in~x| id_~x)} #27#return; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {1194#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {1194#(<= |id_#in~x| 3)} assume true; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,999 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1194#(<= |id_#in~x| 3)} {1049#(= |id_#in~x| id_~x)} #27#return; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:32,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {1177#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:32,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {1177#(<= |id_#in~x| 4)} assume true; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:32,000 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1177#(<= |id_#in~x| 4)} {1049#(= |id_#in~x| id_~x)} #27#return; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:32,001 INFO L290 TraceCheckUtils]: 34: Hoare triple {1154#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:32,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {1154#(<= |id_#in~x| 5)} assume true; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:32,001 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1154#(<= |id_#in~x| 5)} {1049#(= |id_#in~x| id_~x)} #27#return; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:32,002 INFO L290 TraceCheckUtils]: 37: Hoare triple {1125#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:32,002 INFO L290 TraceCheckUtils]: 38: Hoare triple {1125#(<= |id_#in~x| 6)} assume true; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:32,002 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1125#(<= |id_#in~x| 6)} {1049#(= |id_#in~x| id_~x)} #27#return; {1090#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:32,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,003 INFO L272 TraceCheckUtils]: 2: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,004 INFO L272 TraceCheckUtils]: 5: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,004 INFO L272 TraceCheckUtils]: 8: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,005 INFO L272 TraceCheckUtils]: 11: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,006 INFO L272 TraceCheckUtils]: 14: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,006 INFO L272 TraceCheckUtils]: 17: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,007 INFO L272 TraceCheckUtils]: 20: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {1049#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:32,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {1211#(= |id_#in~x| 0)} assume true; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:32,008 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1211#(= |id_#in~x| 0)} {1049#(= |id_#in~x| id_~x)} #27#return; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:32,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {1210#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:32,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {1210#(<= |id_#in~x| 1)} assume true; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:32,009 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1210#(<= |id_#in~x| 1)} {1049#(= |id_#in~x| id_~x)} #27#return; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:32,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {1205#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:32,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {1205#(<= |id_#in~x| 2)} assume true; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:32,010 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1205#(<= |id_#in~x| 2)} {1049#(= |id_#in~x| id_~x)} #27#return; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:32,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {1194#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:32,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {1194#(<= |id_#in~x| 3)} assume true; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:32,011 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1194#(<= |id_#in~x| 3)} {1049#(= |id_#in~x| id_~x)} #27#return; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:32,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {1177#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:32,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {1177#(<= |id_#in~x| 4)} assume true; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:32,013 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1177#(<= |id_#in~x| 4)} {1049#(= |id_#in~x| id_~x)} #27#return; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:32,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {1154#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:32,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {1154#(<= |id_#in~x| 5)} assume true; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:32,016 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1154#(<= |id_#in~x| 5)} {1049#(= |id_#in~x| id_~x)} #27#return; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:32,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {1125#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:32,017 INFO L290 TraceCheckUtils]: 41: Hoare triple {1125#(<= |id_#in~x| 6)} assume true; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:32,018 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1125#(<= |id_#in~x| 6)} {1049#(= |id_#in~x| id_~x)} #27#return; {1090#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:32,018 INFO L290 TraceCheckUtils]: 43: Hoare triple {1090#(<= |id_#in~x| 7)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1090#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:32,018 INFO L290 TraceCheckUtils]: 44: Hoare triple {1090#(<= |id_#in~x| 7)} assume true; {1090#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:32,019 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1090#(<= |id_#in~x| 7)} {1002#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {1001#false} is VALID [2022-02-20 18:16:32,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#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(15, 2);call #Ultimate.allocInit(12, 3); {1000#true} is VALID [2022-02-20 18:16:32,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {1002#(= |ULTIMATE.start_main_~input~0#1| 15)} is VALID [2022-02-20 18:16:32,020 INFO L272 TraceCheckUtils]: 2: Hoare triple {1002#(= |ULTIMATE.start_main_~input~0#1| 15)} call main_#t~ret5#1 := id(main_~input~0#1); {1000#true} is VALID [2022-02-20 18:16:32,020 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,020 INFO L290 TraceCheckUtils]: 4: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,020 INFO L272 TraceCheckUtils]: 5: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,021 INFO L272 TraceCheckUtils]: 8: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,021 INFO L272 TraceCheckUtils]: 11: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,022 INFO L272 TraceCheckUtils]: 14: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,023 INFO L272 TraceCheckUtils]: 17: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,023 INFO L272 TraceCheckUtils]: 20: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {1049#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,024 INFO L272 TraceCheckUtils]: 23: Hoare triple {1049#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {1000#true} ~x := #in~x; {1049#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {1049#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:32,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {1211#(= |id_#in~x| 0)} assume true; {1211#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:32,025 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1211#(= |id_#in~x| 0)} {1049#(= |id_#in~x| id_~x)} #27#return; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:32,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {1210#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:32,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {1210#(<= |id_#in~x| 1)} assume true; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:32,026 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1210#(<= |id_#in~x| 1)} {1049#(= |id_#in~x| id_~x)} #27#return; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:32,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {1205#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:32,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {1205#(<= |id_#in~x| 2)} assume true; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:32,027 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1205#(<= |id_#in~x| 2)} {1049#(= |id_#in~x| id_~x)} #27#return; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:32,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {1194#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:32,029 INFO L290 TraceCheckUtils]: 35: Hoare triple {1194#(<= |id_#in~x| 3)} assume true; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:32,029 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1194#(<= |id_#in~x| 3)} {1049#(= |id_#in~x| id_~x)} #27#return; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:32,030 INFO L290 TraceCheckUtils]: 37: Hoare triple {1177#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:32,030 INFO L290 TraceCheckUtils]: 38: Hoare triple {1177#(<= |id_#in~x| 4)} assume true; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:32,030 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1177#(<= |id_#in~x| 4)} {1049#(= |id_#in~x| id_~x)} #27#return; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:32,031 INFO L290 TraceCheckUtils]: 40: Hoare triple {1154#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:32,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {1154#(<= |id_#in~x| 5)} assume true; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:32,031 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1154#(<= |id_#in~x| 5)} {1049#(= |id_#in~x| id_~x)} #27#return; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:32,032 INFO L290 TraceCheckUtils]: 43: Hoare triple {1125#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:32,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {1125#(<= |id_#in~x| 6)} assume true; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:32,033 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1125#(<= |id_#in~x| 6)} {1049#(= |id_#in~x| id_~x)} #27#return; {1090#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:32,033 INFO L290 TraceCheckUtils]: 46: Hoare triple {1090#(<= |id_#in~x| 7)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1090#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:32,033 INFO L290 TraceCheckUtils]: 47: Hoare triple {1090#(<= |id_#in~x| 7)} assume true; {1090#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:32,033 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1090#(<= |id_#in~x| 7)} {1002#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {1001#false} is VALID [2022-02-20 18:16:32,033 INFO L290 TraceCheckUtils]: 49: Hoare triple {1001#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {1001#false} is VALID [2022-02-20 18:16:32,034 INFO L290 TraceCheckUtils]: 50: Hoare triple {1001#false} assume 15 == main_~result~0#1; {1001#false} is VALID [2022-02-20 18:16:32,034 INFO L290 TraceCheckUtils]: 51: Hoare triple {1001#false} assume !false; {1001#false} is VALID [2022-02-20 18:16:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-02-20 18:16:32,034 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:32,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136063537] [2022-02-20 18:16:32,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136063537] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:32,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800598876] [2022-02-20 18:16:32,035 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 18:16:32,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:32,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:32,036 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:16:32,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 18:16:32,082 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 18:16:32,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:16:32,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 18:16:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:32,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:32,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#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(15, 2);call #Ultimate.allocInit(12, 3); {1000#true} is VALID [2022-02-20 18:16:32,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {1218#(<= 15 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:32,377 INFO L272 TraceCheckUtils]: 2: Hoare triple {1218#(<= 15 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {1000#true} is VALID [2022-02-20 18:16:32,377 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#true} ~x := #in~x; {1225#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {1225#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1225#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,378 INFO L272 TraceCheckUtils]: 5: Hoare triple {1225#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#true} ~x := #in~x; {1225#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {1225#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1225#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,378 INFO L272 TraceCheckUtils]: 8: Hoare triple {1225#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {1000#true} ~x := #in~x; {1225#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {1225#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1225#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,379 INFO L272 TraceCheckUtils]: 11: Hoare triple {1225#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {1000#true} ~x := #in~x; {1225#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {1225#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1225#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,380 INFO L272 TraceCheckUtils]: 14: Hoare triple {1225#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {1000#true} ~x := #in~x; {1225#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {1225#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1225#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,381 INFO L272 TraceCheckUtils]: 17: Hoare triple {1225#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {1000#true} ~x := #in~x; {1225#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {1225#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1225#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,381 INFO L272 TraceCheckUtils]: 20: Hoare triple {1225#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {1000#true} ~x := #in~x; {1225#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {1225#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1225#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,382 INFO L272 TraceCheckUtils]: 23: Hoare triple {1225#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:32,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {1000#true} ~x := #in~x; {1225#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:32,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {1225#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1292#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:32,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {1292#(<= |id_#in~x| 0)} assume true; {1292#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:32,384 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1292#(<= |id_#in~x| 0)} {1225#(<= |id_#in~x| id_~x)} #27#return; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:32,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {1210#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:32,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {1210#(<= |id_#in~x| 1)} assume true; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:32,385 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1210#(<= |id_#in~x| 1)} {1225#(<= |id_#in~x| id_~x)} #27#return; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:32,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {1205#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:32,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {1205#(<= |id_#in~x| 2)} assume true; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:32,386 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1205#(<= |id_#in~x| 2)} {1225#(<= |id_#in~x| id_~x)} #27#return; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:32,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {1194#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:32,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {1194#(<= |id_#in~x| 3)} assume true; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:32,387 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1194#(<= |id_#in~x| 3)} {1225#(<= |id_#in~x| id_~x)} #27#return; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:32,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {1177#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:32,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {1177#(<= |id_#in~x| 4)} assume true; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:32,388 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1177#(<= |id_#in~x| 4)} {1225#(<= |id_#in~x| id_~x)} #27#return; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:32,389 INFO L290 TraceCheckUtils]: 40: Hoare triple {1154#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:32,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {1154#(<= |id_#in~x| 5)} assume true; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:32,389 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1154#(<= |id_#in~x| 5)} {1225#(<= |id_#in~x| id_~x)} #27#return; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:32,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {1125#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:32,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {1125#(<= |id_#in~x| 6)} assume true; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:32,391 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1125#(<= |id_#in~x| 6)} {1225#(<= |id_#in~x| id_~x)} #27#return; {1090#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:32,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {1090#(<= |id_#in~x| 7)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1090#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:32,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {1090#(<= |id_#in~x| 7)} assume true; {1090#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:32,392 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1090#(<= |id_#in~x| 7)} {1218#(<= 15 |ULTIMATE.start_main_~input~0#1|)} #25#return; {1001#false} is VALID [2022-02-20 18:16:32,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {1001#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {1001#false} is VALID [2022-02-20 18:16:32,393 INFO L290 TraceCheckUtils]: 50: Hoare triple {1001#false} assume 15 == main_~result~0#1; {1001#false} is VALID [2022-02-20 18:16:32,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {1001#false} assume !false; {1001#false} is VALID [2022-02-20 18:16:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-02-20 18:16:32,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:39,295 INFO L290 TraceCheckUtils]: 51: Hoare triple {1001#false} assume !false; {1001#false} is VALID [2022-02-20 18:16:39,295 INFO L290 TraceCheckUtils]: 50: Hoare triple {1001#false} assume 15 == main_~result~0#1; {1001#false} is VALID [2022-02-20 18:16:39,295 INFO L290 TraceCheckUtils]: 49: Hoare triple {1001#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {1001#false} is VALID [2022-02-20 18:16:39,296 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1090#(<= |id_#in~x| 7)} {1380#(< 7 |ULTIMATE.start_main_~input~0#1|)} #25#return; {1001#false} is VALID [2022-02-20 18:16:39,296 INFO L290 TraceCheckUtils]: 47: Hoare triple {1090#(<= |id_#in~x| 7)} assume true; {1090#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:39,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {1090#(<= |id_#in~x| 7)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1090#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:39,297 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1125#(<= |id_#in~x| 6)} {1393#(or (< 7 id_~x) (<= |id_#in~x| 7))} #27#return; {1090#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:39,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {1125#(<= |id_#in~x| 6)} assume true; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:39,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {1125#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:39,298 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1154#(<= |id_#in~x| 5)} {1406#(or (< 6 id_~x) (<= |id_#in~x| 6))} #27#return; {1125#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:39,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {1154#(<= |id_#in~x| 5)} assume true; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:39,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {1154#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:39,300 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1177#(<= |id_#in~x| 4)} {1419#(or (< 5 id_~x) (<= |id_#in~x| 5))} #27#return; {1154#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:39,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {1177#(<= |id_#in~x| 4)} assume true; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {1177#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,301 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1194#(<= |id_#in~x| 3)} {1432#(or (<= |id_#in~x| 4) (< 4 id_~x))} #27#return; {1177#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {1194#(<= |id_#in~x| 3)} assume true; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {1194#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,302 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1205#(<= |id_#in~x| 2)} {1445#(or (< 3 id_~x) (<= |id_#in~x| 3))} #27#return; {1194#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {1205#(<= |id_#in~x| 2)} assume true; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {1205#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,303 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1210#(<= |id_#in~x| 1)} {1458#(or (<= |id_#in~x| 2) (< 2 id_~x))} #27#return; {1205#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {1210#(<= |id_#in~x| 1)} assume true; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {1210#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,304 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1292#(<= |id_#in~x| 0)} {1471#(or (< 1 id_~x) (<= |id_#in~x| 1))} #27#return; {1210#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {1292#(<= |id_#in~x| 0)} assume true; {1292#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {1481#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} assume 0 == ~x;#res := 0; {1292#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {1000#true} ~x := #in~x; {1481#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} is VALID [2022-02-20 18:16:39,305 INFO L272 TraceCheckUtils]: 23: Hoare triple {1471#(or (< 1 id_~x) (<= |id_#in~x| 1))} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:39,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {1471#(or (< 1 id_~x) (<= |id_#in~x| 1))} assume !(0 == ~x); {1471#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:39,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {1000#true} ~x := #in~x; {1471#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:39,306 INFO L272 TraceCheckUtils]: 20: Hoare triple {1458#(or (<= |id_#in~x| 2) (< 2 id_~x))} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:39,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {1458#(or (<= |id_#in~x| 2) (< 2 id_~x))} assume !(0 == ~x); {1458#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:39,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {1000#true} ~x := #in~x; {1458#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:39,307 INFO L272 TraceCheckUtils]: 17: Hoare triple {1445#(or (< 3 id_~x) (<= |id_#in~x| 3))} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:39,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {1445#(or (< 3 id_~x) (<= |id_#in~x| 3))} assume !(0 == ~x); {1445#(or (< 3 id_~x) (<= |id_#in~x| 3))} is VALID [2022-02-20 18:16:39,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {1000#true} ~x := #in~x; {1445#(or (< 3 id_~x) (<= |id_#in~x| 3))} is VALID [2022-02-20 18:16:39,308 INFO L272 TraceCheckUtils]: 14: Hoare triple {1432#(or (<= |id_#in~x| 4) (< 4 id_~x))} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:39,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {1432#(or (<= |id_#in~x| 4) (< 4 id_~x))} assume !(0 == ~x); {1432#(or (<= |id_#in~x| 4) (< 4 id_~x))} is VALID [2022-02-20 18:16:39,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {1000#true} ~x := #in~x; {1432#(or (<= |id_#in~x| 4) (< 4 id_~x))} is VALID [2022-02-20 18:16:39,308 INFO L272 TraceCheckUtils]: 11: Hoare triple {1419#(or (< 5 id_~x) (<= |id_#in~x| 5))} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:39,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {1419#(or (< 5 id_~x) (<= |id_#in~x| 5))} assume !(0 == ~x); {1419#(or (< 5 id_~x) (<= |id_#in~x| 5))} is VALID [2022-02-20 18:16:39,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {1000#true} ~x := #in~x; {1419#(or (< 5 id_~x) (<= |id_#in~x| 5))} is VALID [2022-02-20 18:16:39,309 INFO L272 TraceCheckUtils]: 8: Hoare triple {1406#(or (< 6 id_~x) (<= |id_#in~x| 6))} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:39,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {1406#(or (< 6 id_~x) (<= |id_#in~x| 6))} assume !(0 == ~x); {1406#(or (< 6 id_~x) (<= |id_#in~x| 6))} is VALID [2022-02-20 18:16:39,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#true} ~x := #in~x; {1406#(or (< 6 id_~x) (<= |id_#in~x| 6))} is VALID [2022-02-20 18:16:39,310 INFO L272 TraceCheckUtils]: 5: Hoare triple {1393#(or (< 7 id_~x) (<= |id_#in~x| 7))} call #t~ret4 := id(~x - 1); {1000#true} is VALID [2022-02-20 18:16:39,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {1393#(or (< 7 id_~x) (<= |id_#in~x| 7))} assume !(0 == ~x); {1393#(or (< 7 id_~x) (<= |id_#in~x| 7))} is VALID [2022-02-20 18:16:39,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#true} ~x := #in~x; {1393#(or (< 7 id_~x) (<= |id_#in~x| 7))} is VALID [2022-02-20 18:16:39,310 INFO L272 TraceCheckUtils]: 2: Hoare triple {1380#(< 7 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {1000#true} is VALID [2022-02-20 18:16:39,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {1380#(< 7 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:39,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#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(15, 2);call #Ultimate.allocInit(12, 3); {1000#true} is VALID [2022-02-20 18:16:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 18:16:39,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800598876] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:39,312 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:39,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 24 [2022-02-20 18:16:39,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471512615] [2022-02-20 18:16:39,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:39,316 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.142857142857143) internal successors, (45), 24 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) Word has length 52