./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i10_o10-1.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_i10_o10-1.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 9dc175bed280c85fbc7018a36f57353cd7d8c459346c67f95db055f6ec935a28 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:16:18,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:16:18,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:16:19,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:16:19,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:16:19,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:16:19,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:16:19,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:16:19,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:16:19,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:16:19,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:16:19,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:16:19,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:16:19,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:16:19,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:16:19,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:16:19,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:16:19,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:16:19,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:16:19,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:16:19,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:16:19,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:16:19,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:16:19,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:16:19,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:16:19,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:16:19,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:16:19,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:16:19,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:16:19,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:16:19,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:16:19,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:16:19,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:16:19,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:16:19,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:16:19,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:16:19,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:16:19,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:16:19,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:16:19,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:16:19,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:16:19,078 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:19,104 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:16:19,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:16:19,104 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:16:19,105 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:16:19,105 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:16:19,105 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:16:19,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:16:19,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:16:19,106 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:16:19,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:16:19,106 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:16:19,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:16:19,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:16:19,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:16:19,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:16:19,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:16:19,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:16:19,108 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:16:19,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:16:19,108 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:16:19,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:16:19,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:16:19,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:16:19,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:16:19,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:16:19,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:16:19,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:16:19,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:16:19,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:16:19,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:16:19,110 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:16:19,110 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:16:19,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:16:19,110 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 -> 9dc175bed280c85fbc7018a36f57353cd7d8c459346c67f95db055f6ec935a28 [2022-02-20 18:16:19,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:16:19,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:16:19,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:16:19,328 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:16:19,329 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:16:19,330 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i10_o10-1.c [2022-02-20 18:16:19,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b66376811/f749510bd69741aca27203233ae2f7e8/FLAG559ae50cf [2022-02-20 18:16:19,737 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:16:19,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i10_o10-1.c [2022-02-20 18:16:19,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b66376811/f749510bd69741aca27203233ae2f7e8/FLAG559ae50cf [2022-02-20 18:16:20,180 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b66376811/f749510bd69741aca27203233ae2f7e8 [2022-02-20 18:16:20,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:16:20,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:16:20,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:16:20,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:16:20,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:16:20,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:16:20" (1/1) ... [2022-02-20 18:16:20,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68997b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:20, skipping insertion in model container [2022-02-20 18:16:20,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:16:20" (1/1) ... [2022-02-20 18:16:20,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:16:20,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:16:20,470 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_i10_o10-1.c[454,467] [2022-02-20 18:16:20,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:16:20,501 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:16:20,515 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_i10_o10-1.c[454,467] [2022-02-20 18:16:20,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:16:20,531 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:16:20,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:20 WrapperNode [2022-02-20 18:16:20,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:16:20,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:16:20,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:16:20,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:16:20,539 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:20" (1/1) ... [2022-02-20 18:16:20,544 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:20" (1/1) ... [2022-02-20 18:16:20,560 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2022-02-20 18:16:20,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:16:20,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:16:20,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:16:20,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:16:20,571 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:20" (1/1) ... [2022-02-20 18:16:20,571 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:20" (1/1) ... [2022-02-20 18:16:20,573 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:20" (1/1) ... [2022-02-20 18:16:20,573 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:20" (1/1) ... [2022-02-20 18:16:20,577 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:20" (1/1) ... [2022-02-20 18:16:20,579 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:20" (1/1) ... [2022-02-20 18:16:20,584 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:20" (1/1) ... [2022-02-20 18:16:20,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:16:20,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:16:20,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:16:20,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:16:20,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:20" (1/1) ... [2022-02-20 18:16:20,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:16:20,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:20,624 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:20,689 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:20,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:16:20,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:16:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:16:20,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:16:20,703 INFO L130 BoogieDeclarations]: Found specification of procedure id [2022-02-20 18:16:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2022-02-20 18:16:20,750 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:16:20,751 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:16:20,831 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:16:20,836 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:16:20,836 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:16:20,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:16:20 BoogieIcfgContainer [2022-02-20 18:16:20,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:16:20,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:16:20,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:16:20,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:16:20,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:16:20" (1/3) ... [2022-02-20 18:16:20,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5e130c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:16:20, skipping insertion in model container [2022-02-20 18:16:20,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:20" (2/3) ... [2022-02-20 18:16:20,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5e130c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:16:20, skipping insertion in model container [2022-02-20 18:16:20,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:16:20" (3/3) ... [2022-02-20 18:16:20,847 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i10_o10-1.c [2022-02-20 18:16:20,851 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:16:20,852 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:16:20,888 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:16:20,893 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:20,894 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:16:20,910 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:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 18:16:20,922 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:20,922 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:20,923 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:20,928 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2022-02-20 18:16:20,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:20,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086130823] [2022-02-20 18:16:20,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:20,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:21,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:21,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} ~x := #in~x; {19#true} is VALID [2022-02-20 18:16:21,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume 0 == ~x;#res := 0; {27#(= |id_#res| 0)} is VALID [2022-02-20 18:16:21,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#(= |id_#res| 0)} assume true; {27#(= |id_#res| 0)} is VALID [2022-02-20 18:16:21,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#(= |id_#res| 0)} {19#true} #25#return; {25#(= |ULTIMATE.start_main_#t~ret5#1| 0)} is VALID [2022-02-20 18:16:21,131 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:21,131 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 := 10; {19#true} is VALID [2022-02-20 18:16:21,131 INFO L272 TraceCheckUtils]: 2: Hoare triple {19#true} call main_#t~ret5#1 := id(main_~input~0#1); {19#true} is VALID [2022-02-20 18:16:21,131 INFO L290 TraceCheckUtils]: 3: Hoare triple {19#true} ~x := #in~x; {19#true} is VALID [2022-02-20 18:16:21,132 INFO L290 TraceCheckUtils]: 4: Hoare triple {19#true} assume 0 == ~x;#res := 0; {27#(= |id_#res| 0)} is VALID [2022-02-20 18:16:21,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#(= |id_#res| 0)} assume true; {27#(= |id_#res| 0)} is VALID [2022-02-20 18:16:21,133 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {27#(= |id_#res| 0)} {19#true} #25#return; {25#(= |ULTIMATE.start_main_#t~ret5#1| 0)} is VALID [2022-02-20 18:16:21,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#(= |ULTIMATE.start_main_#t~ret5#1| 0)} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {26#(= |ULTIMATE.start_main_~result~0#1| 0)} is VALID [2022-02-20 18:16:21,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#(= |ULTIMATE.start_main_~result~0#1| 0)} assume 10 == main_~result~0#1; {20#false} is VALID [2022-02-20 18:16:21,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-02-20 18:16:21,135 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:21,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:21,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086130823] [2022-02-20 18:16:21,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086130823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:16:21,137 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:16:21,137 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:16:21,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394097660] [2022-02-20 18:16:21,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:16:21,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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:21,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:21,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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:21,161 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:21,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:16:21,161 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:21,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:16:21,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:16:21,179 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, 5 states have (on average 1.6) internal successors, (8), 4 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:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:21,279 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-02-20 18:16:21,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:16:21,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-20 18:16:21,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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:21,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-20 18:16:21,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-02-20 18:16:21,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:21,349 INFO L225 Difference]: With dead ends: 28 [2022-02-20 18:16:21,349 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 18:16:21,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:16:21,353 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:16:21,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 55 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:16:21,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 18:16:21,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 18:16:21,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:21,372 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:21,373 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:21,373 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:21,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:21,376 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-20 18:16:21,376 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 18:16:21,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:21,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:21,377 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:21,377 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:21,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:21,379 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-20 18:16:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 18:16:21,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:21,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:21,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:21,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:21,381 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:21,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-02-20 18:16:21,383 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-02-20 18:16:21,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:21,384 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-02-20 18:16:21,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 18:16:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 18:16:21,385 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:21,385 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:21,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:16:21,385 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:21,386 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2022-02-20 18:16:21,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:21,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256669811] [2022-02-20 18:16:21,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:21,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:21,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:21,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:21,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#true} ~x := #in~x; {122#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:21,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {122#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {128#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:21,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {128#(= |id_#in~x| 0)} assume true; {128#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:21,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128#(= |id_#in~x| 0)} {122#(= |id_#in~x| id_~x)} #27#return; {127#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:21,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#true} ~x := #in~x; {122#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:21,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {122#(= |id_#in~x| id_~x)} assume !(0 == ~x); {122#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:21,483 INFO L272 TraceCheckUtils]: 2: Hoare triple {122#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {109#true} is VALID [2022-02-20 18:16:21,484 INFO L290 TraceCheckUtils]: 3: Hoare triple {109#true} ~x := #in~x; {122#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:21,484 INFO L290 TraceCheckUtils]: 4: Hoare triple {122#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {128#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:21,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#(= |id_#in~x| 0)} assume true; {128#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:21,486 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {128#(= |id_#in~x| 0)} {122#(= |id_#in~x| id_~x)} #27#return; {127#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:21,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {127#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {127#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:21,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {127#(<= |id_#in~x| 1)} assume true; {127#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:21,491 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {127#(<= |id_#in~x| 1)} {111#(<= 10 |ULTIMATE.start_main_~input~0#1|)} #25#return; {110#false} is VALID [2022-02-20 18:16:21,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#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); {109#true} is VALID [2022-02-20 18:16:21,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#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 := 10; {111#(<= 10 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:21,492 INFO L272 TraceCheckUtils]: 2: Hoare triple {111#(<= 10 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {109#true} is VALID [2022-02-20 18:16:21,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {109#true} ~x := #in~x; {122#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:21,495 INFO L290 TraceCheckUtils]: 4: Hoare triple {122#(= |id_#in~x| id_~x)} assume !(0 == ~x); {122#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:21,495 INFO L272 TraceCheckUtils]: 5: Hoare triple {122#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {109#true} is VALID [2022-02-20 18:16:21,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {109#true} ~x := #in~x; {122#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:21,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {122#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {128#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:21,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {128#(= |id_#in~x| 0)} assume true; {128#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:21,506 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {128#(= |id_#in~x| 0)} {122#(= |id_#in~x| id_~x)} #27#return; {127#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:21,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {127#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {127#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:21,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {127#(<= |id_#in~x| 1)} assume true; {127#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:21,508 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {127#(<= |id_#in~x| 1)} {111#(<= 10 |ULTIMATE.start_main_~input~0#1|)} #25#return; {110#false} is VALID [2022-02-20 18:16:21,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {110#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; {110#false} is VALID [2022-02-20 18:16:21,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {110#false} assume 10 == main_~result~0#1; {110#false} is VALID [2022-02-20 18:16:21,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 18:16:21,509 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:21,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:21,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256669811] [2022-02-20 18:16:21,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256669811] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:21,512 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263754569] [2022-02-20 18:16:21,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:21,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:21,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:21,521 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:21,525 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:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:21,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 18:16:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:21,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:21,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#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); {109#true} is VALID [2022-02-20 18:16:21,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#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 := 10; {111#(<= 10 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:21,766 INFO L272 TraceCheckUtils]: 2: Hoare triple {111#(<= 10 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {109#true} is VALID [2022-02-20 18:16:21,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {109#true} ~x := #in~x; {141#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:21,766 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:21,767 INFO L272 TraceCheckUtils]: 5: Hoare triple {141#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {109#true} is VALID [2022-02-20 18:16:21,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {109#true} ~x := #in~x; {141#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:21,768 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:21,768 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:21,769 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {154#(<= |id_#in~x| 0)} {141#(<= |id_#in~x| id_~x)} #27#return; {127#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:21,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {127#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {127#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:21,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {127#(<= |id_#in~x| 1)} assume true; {127#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:21,771 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {127#(<= |id_#in~x| 1)} {111#(<= 10 |ULTIMATE.start_main_~input~0#1|)} #25#return; {110#false} is VALID [2022-02-20 18:16:21,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {110#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; {110#false} is VALID [2022-02-20 18:16:21,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {110#false} assume 10 == main_~result~0#1; {110#false} is VALID [2022-02-20 18:16:21,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 18:16:21,772 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:21,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:22,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 18:16:22,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {110#false} assume 10 == main_~result~0#1; {110#false} is VALID [2022-02-20 18:16:22,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {110#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; {110#false} is VALID [2022-02-20 18:16:22,250 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {127#(<= |id_#in~x| 1)} {188#(< 1 |ULTIMATE.start_main_~input~0#1|)} #25#return; {110#false} is VALID [2022-02-20 18:16:22,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {127#(<= |id_#in~x| 1)} assume true; {127#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:22,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {127#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {127#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:22,253 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {154#(<= |id_#in~x| 0)} {201#(or (< 1 id_~x) (<= |id_#in~x| 1))} #27#return; {127#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:22,253 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:22,254 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:22,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {109#true} ~x := #in~x; {211#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} is VALID [2022-02-20 18:16:22,254 INFO L272 TraceCheckUtils]: 5: Hoare triple {201#(or (< 1 id_~x) (<= |id_#in~x| 1))} call #t~ret4 := id(~x - 1); {109#true} is VALID [2022-02-20 18:16:22,255 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:22,256 INFO L290 TraceCheckUtils]: 3: Hoare triple {109#true} ~x := #in~x; {201#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:22,256 INFO L272 TraceCheckUtils]: 2: Hoare triple {188#(< 1 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {109#true} is VALID [2022-02-20 18:16:22,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#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 := 10; {188#(< 1 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:22,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#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); {109#true} is VALID [2022-02-20 18:16:22,257 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:22,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263754569] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:22,257 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:22,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2022-02-20 18:16:22,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856078888] [2022-02-20 18:16:22,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:22,259 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 16 [2022-02-20 18:16:22,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:22,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:16:22,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:22,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 18:16:22,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:22,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 18:16:22,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:16:22,284 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:16:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:22,388 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 18:16:22,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:16:22,388 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 16 [2022-02-20 18:16:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:16:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 18:16:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:16:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 18:16:22,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-02-20 18:16:22,410 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:22,411 INFO L225 Difference]: With dead ends: 22 [2022-02-20 18:16:22,411 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 18:16:22,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:16:22,412 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:16:22,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 34 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:16:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 18:16:22,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 18:16:22,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:22,416 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:22,416 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:22,417 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:22,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:22,418 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 18:16:22,418 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 18:16:22,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:22,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:22,419 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:22,419 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:22,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:22,420 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 18:16:22,421 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 18:16:22,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:22,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:22,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:22,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:22,422 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:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-02-20 18:16:22,423 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-02-20 18:16:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:22,423 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-02-20 18:16:22,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 18:16:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 18:16:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 18:16:22,424 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:22,424 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:22,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 18:16:22,639 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:22,640 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:22,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2022-02-20 18:16:22,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:22,641 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185440926] [2022-02-20 18:16:22,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:22,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:22,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:22,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:22,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:22,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:22,764 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:22,765 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:22,765 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:22,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:22,767 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:22,767 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:22,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:22,768 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:22,768 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:22,769 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:22,769 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:22,770 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:22,771 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:22,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:22,772 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:22,772 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:22,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:22,773 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:22,773 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:22,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:22,774 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:22,774 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:22,775 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:22,775 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:22,776 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:22,777 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:22,777 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:22,777 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:22,778 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {342#(<= |id_#in~x| 2)} {314#(<= 10 |ULTIMATE.start_main_~input~0#1|)} #25#return; {313#false} is VALID [2022-02-20 18:16:22,778 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:22,779 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 := 10; {314#(<= 10 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:22,780 INFO L272 TraceCheckUtils]: 2: Hoare triple {314#(<= 10 |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:22,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:22,781 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:22,781 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:22,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:22,783 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:22,783 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:22,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:22,784 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:22,785 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:22,787 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:22,787 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:22,788 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:22,791 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:22,792 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:22,792 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:22,793 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {342#(<= |id_#in~x| 2)} {314#(<= 10 |ULTIMATE.start_main_~input~0#1|)} #25#return; {313#false} is VALID [2022-02-20 18:16:22,793 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:22,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {313#false} assume 10 == main_~result~0#1; {313#false} is VALID [2022-02-20 18:16:22,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 18:16:22,794 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:22,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:22,795 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185440926] [2022-02-20 18:16:22,795 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185440926] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:22,795 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550081678] [2022-02-20 18:16:22,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 18:16:22,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:22,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:22,805 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:22,807 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:22,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 18:16:22,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:16:22,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 18:16:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:22,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:22,985 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:22,986 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 := 10; {314#(<= 10 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:22,986 INFO L272 TraceCheckUtils]: 2: Hoare triple {314#(<= 10 |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:22,986 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {361#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:22,987 INFO L290 TraceCheckUtils]: 4: Hoare triple {361#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {361#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:22,987 INFO L272 TraceCheckUtils]: 5: Hoare triple {361#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:22,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} ~x := #in~x; {361#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:22,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {361#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:22,988 INFO L272 TraceCheckUtils]: 8: Hoare triple {361#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:22,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#true} ~x := #in~x; {361#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:22,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {361#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {383#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:22,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {383#(<= |id_#in~x| 0)} assume true; {383#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:22,990 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {383#(<= |id_#in~x| 0)} {361#(<= |id_#in~x| id_~x)} #27#return; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:22,991 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:22,991 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:22,992 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {347#(<= |id_#in~x| 1)} {361#(<= |id_#in~x| id_~x)} #27#return; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:22,992 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:22,993 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:22,994 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {342#(<= |id_#in~x| 2)} {314#(<= 10 |ULTIMATE.start_main_~input~0#1|)} #25#return; {313#false} is VALID [2022-02-20 18:16:22,994 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:22,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {313#false} assume 10 == main_~result~0#1; {313#false} is VALID [2022-02-20 18:16:22,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 18:16:22,995 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:22,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:23,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 18:16:23,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {313#false} assume 10 == main_~result~0#1; {313#false} is VALID [2022-02-20 18:16:23,775 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:23,776 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {342#(<= |id_#in~x| 2)} {426#(< 2 |ULTIMATE.start_main_~input~0#1|)} #25#return; {313#false} is VALID [2022-02-20 18:16:23,777 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:23,781 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:23,782 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {347#(<= |id_#in~x| 1)} {439#(or (<= |id_#in~x| 2) (< 2 id_~x))} #27#return; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:23,783 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:23,783 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:23,784 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {383#(<= |id_#in~x| 0)} {452#(or (< 1 id_~x) (<= |id_#in~x| 1))} #27#return; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:23,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {383#(<= |id_#in~x| 0)} assume true; {383#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:23,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {462#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} assume 0 == ~x;#res := 0; {383#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:23,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#true} ~x := #in~x; {462#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} is VALID [2022-02-20 18:16:23,786 INFO L272 TraceCheckUtils]: 8: Hoare triple {452#(or (< 1 id_~x) (<= |id_#in~x| 1))} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:23,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#(or (< 1 id_~x) (<= |id_#in~x| 1))} assume !(0 == ~x); {452#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:23,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} ~x := #in~x; {452#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:23,787 INFO L272 TraceCheckUtils]: 5: Hoare triple {439#(or (<= |id_#in~x| 2) (< 2 id_~x))} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:23,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {439#(or (<= |id_#in~x| 2) (< 2 id_~x))} assume !(0 == ~x); {439#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:23,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {439#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:23,788 INFO L272 TraceCheckUtils]: 2: Hoare triple {426#(< 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:23,788 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 := 10; {426#(< 2 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:23,788 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:23,788 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:23,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550081678] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:23,789 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:23,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 13 [2022-02-20 18:16:23,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129947591] [2022-02-20 18:16:23,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:23,790 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 22 [2022-02-20 18:16:23,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:23,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:16:23,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:23,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:16:23,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:23,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:16:23,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:16:23,818 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:16:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:23,940 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-20 18:16:23,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:16:23,941 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 22 [2022-02-20 18:16:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:16:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-02-20 18:16:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:16:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-02-20 18:16:23,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 26 transitions. [2022-02-20 18:16:23,964 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:23,965 INFO L225 Difference]: With dead ends: 25 [2022-02-20 18:16:23,965 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 18:16:23,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-02-20 18:16:23,966 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:16:23,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 46 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:16:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 18:16:23,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 18:16:23,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:23,970 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:23,970 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:23,970 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:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:23,972 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 18:16:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 18:16:23,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:23,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:23,973 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:23,973 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:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:23,974 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 18:16:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 18:16:23,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:23,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:23,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:23,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:23,975 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:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-02-20 18:16:23,976 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2022-02-20 18:16:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:23,977 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-02-20 18:16:23,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-20 18:16:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 18:16:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 18:16:23,978 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:23,978 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:23,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 18:16:24,197 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:24,197 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2022-02-20 18:16:24,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:24,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842081153] [2022-02-20 18:16:24,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:24,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:24,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:24,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:24,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:24,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:24,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {642#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:24,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {642#(= |id_#in~x| 0)} assume true; {642#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:24,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {642#(= |id_#in~x| 0)} {608#(= |id_#in~x| id_~x)} #27#return; {641#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:24,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#(= |id_#in~x| id_~x)} assume !(0 == ~x); {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,319 INFO L272 TraceCheckUtils]: 2: Hoare triple {608#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:24,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {608#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {642#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:24,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {642#(= |id_#in~x| 0)} assume true; {642#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:24,321 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {642#(= |id_#in~x| 0)} {608#(= |id_#in~x| id_~x)} #27#return; {641#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:24,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {641#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {641#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:24,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#(<= |id_#in~x| 1)} assume true; {641#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:24,322 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {641#(<= |id_#in~x| 1)} {608#(= |id_#in~x| id_~x)} #27#return; {636#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:24,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#(= |id_#in~x| id_~x)} assume !(0 == ~x); {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,323 INFO L272 TraceCheckUtils]: 2: Hoare triple {608#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:24,324 INFO L290 TraceCheckUtils]: 3: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,324 INFO L290 TraceCheckUtils]: 4: Hoare triple {608#(= |id_#in~x| id_~x)} assume !(0 == ~x); {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,324 INFO L272 TraceCheckUtils]: 5: Hoare triple {608#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:24,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {608#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {642#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:24,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {642#(= |id_#in~x| 0)} assume true; {642#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:24,326 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {642#(= |id_#in~x| 0)} {608#(= |id_#in~x| id_~x)} #27#return; {641#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:24,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {641#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {641#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:24,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {641#(<= |id_#in~x| 1)} assume true; {641#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:24,327 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {641#(<= |id_#in~x| 1)} {608#(= |id_#in~x| id_~x)} #27#return; {636#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:24,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {636#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {636#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:24,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {636#(<= |id_#in~x| 2)} assume true; {636#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:24,329 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {636#(<= |id_#in~x| 2)} {608#(= |id_#in~x| id_~x)} #27#return; {625#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:24,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#(= |id_#in~x| id_~x)} assume !(0 == ~x); {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,330 INFO L272 TraceCheckUtils]: 2: Hoare triple {608#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:24,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,331 INFO L290 TraceCheckUtils]: 4: Hoare triple {608#(= |id_#in~x| id_~x)} assume !(0 == ~x); {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,331 INFO L272 TraceCheckUtils]: 5: Hoare triple {608#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:24,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {608#(= |id_#in~x| id_~x)} assume !(0 == ~x); {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,332 INFO L272 TraceCheckUtils]: 8: Hoare triple {608#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:24,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {642#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:24,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {642#(= |id_#in~x| 0)} assume true; {642#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:24,333 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {642#(= |id_#in~x| 0)} {608#(= |id_#in~x| id_~x)} #27#return; {641#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:24,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {641#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {641#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:24,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {641#(<= |id_#in~x| 1)} assume true; {641#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:24,335 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {641#(<= |id_#in~x| 1)} {608#(= |id_#in~x| id_~x)} #27#return; {636#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:24,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {636#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {636#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:24,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {636#(<= |id_#in~x| 2)} assume true; {636#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:24,336 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {636#(<= |id_#in~x| 2)} {608#(= |id_#in~x| id_~x)} #27#return; {625#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:24,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {625#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {625#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:24,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {625#(<= |id_#in~x| 3)} assume true; {625#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:24,338 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {625#(<= |id_#in~x| 3)} {585#(<= 10 |ULTIMATE.start_main_~input~0#1|)} #25#return; {584#false} is VALID [2022-02-20 18:16:24,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {583#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); {583#true} is VALID [2022-02-20 18:16:24,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {583#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 := 10; {585#(<= 10 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:24,339 INFO L272 TraceCheckUtils]: 2: Hoare triple {585#(<= 10 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {583#true} is VALID [2022-02-20 18:16:24,339 INFO L290 TraceCheckUtils]: 3: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,339 INFO L290 TraceCheckUtils]: 4: Hoare triple {608#(= |id_#in~x| id_~x)} assume !(0 == ~x); {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,339 INFO L272 TraceCheckUtils]: 5: Hoare triple {608#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:24,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {608#(= |id_#in~x| id_~x)} assume !(0 == ~x); {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,340 INFO L272 TraceCheckUtils]: 8: Hoare triple {608#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:24,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#(= |id_#in~x| id_~x)} assume !(0 == ~x); {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,341 INFO L272 TraceCheckUtils]: 11: Hoare triple {608#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:24,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:24,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {608#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {642#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:24,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {642#(= |id_#in~x| 0)} assume true; {642#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:24,343 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {642#(= |id_#in~x| 0)} {608#(= |id_#in~x| id_~x)} #27#return; {641#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:24,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {641#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {641#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:24,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {641#(<= |id_#in~x| 1)} assume true; {641#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:24,344 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {641#(<= |id_#in~x| 1)} {608#(= |id_#in~x| id_~x)} #27#return; {636#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:24,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {636#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {636#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:24,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {636#(<= |id_#in~x| 2)} assume true; {636#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:24,346 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {636#(<= |id_#in~x| 2)} {608#(= |id_#in~x| id_~x)} #27#return; {625#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:24,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {625#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {625#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:24,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {625#(<= |id_#in~x| 3)} assume true; {625#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:24,347 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {625#(<= |id_#in~x| 3)} {585#(<= 10 |ULTIMATE.start_main_~input~0#1|)} #25#return; {584#false} is VALID [2022-02-20 18:16:24,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {584#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; {584#false} is VALID [2022-02-20 18:16:24,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {584#false} assume 10 == main_~result~0#1; {584#false} is VALID [2022-02-20 18:16:24,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {584#false} assume !false; {584#false} is VALID [2022-02-20 18:16:24,348 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:24,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:24,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842081153] [2022-02-20 18:16:24,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842081153] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:24,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629492823] [2022-02-20 18:16:24,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 18:16:24,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:24,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:24,354 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:24,375 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:24,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 18:16:24,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:16:24,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 18:16:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:24,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:24,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {583#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); {583#true} is VALID [2022-02-20 18:16:24,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {583#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 := 10; {583#true} is VALID [2022-02-20 18:16:24,602 INFO L272 TraceCheckUtils]: 2: Hoare triple {583#true} call main_#t~ret5#1 := id(main_~input~0#1); {583#true} is VALID [2022-02-20 18:16:24,604 INFO L290 TraceCheckUtils]: 3: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:24,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {583#true} assume !(0 == ~x); {583#true} is VALID [2022-02-20 18:16:24,605 INFO L272 TraceCheckUtils]: 5: Hoare triple {583#true} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:24,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:24,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {583#true} assume !(0 == ~x); {583#true} is VALID [2022-02-20 18:16:24,605 INFO L272 TraceCheckUtils]: 8: Hoare triple {583#true} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:24,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:24,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {583#true} assume !(0 == ~x); {583#true} is VALID [2022-02-20 18:16:24,606 INFO L272 TraceCheckUtils]: 11: Hoare triple {583#true} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:24,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:24,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {583#true} assume 0 == ~x;#res := 0; {685#(<= |id_#res| 0)} is VALID [2022-02-20 18:16:24,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {685#(<= |id_#res| 0)} assume true; {685#(<= |id_#res| 0)} is VALID [2022-02-20 18:16:24,607 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {685#(<= |id_#res| 0)} {583#true} #27#return; {692#(<= |id_#t~ret4| 0)} is VALID [2022-02-20 18:16:24,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {692#(<= |id_#t~ret4| 0)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {696#(<= |id_#res| 1)} is VALID [2022-02-20 18:16:24,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {696#(<= |id_#res| 1)} assume true; {696#(<= |id_#res| 1)} is VALID [2022-02-20 18:16:24,609 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {696#(<= |id_#res| 1)} {583#true} #27#return; {703#(<= |id_#t~ret4| 1)} is VALID [2022-02-20 18:16:24,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {703#(<= |id_#t~ret4| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {707#(<= |id_#res| 2)} is VALID [2022-02-20 18:16:24,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {707#(<= |id_#res| 2)} assume true; {707#(<= |id_#res| 2)} is VALID [2022-02-20 18:16:24,610 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {707#(<= |id_#res| 2)} {583#true} #27#return; {714#(<= |id_#t~ret4| 2)} is VALID [2022-02-20 18:16:24,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {714#(<= |id_#t~ret4| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {718#(<= |id_#res| 3)} is VALID [2022-02-20 18:16:24,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {718#(<= |id_#res| 3)} assume true; {718#(<= |id_#res| 3)} is VALID [2022-02-20 18:16:24,612 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {718#(<= |id_#res| 3)} {583#true} #25#return; {725#(<= |ULTIMATE.start_main_#t~ret5#1| 3)} is VALID [2022-02-20 18:16:24,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {725#(<= |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; {729#(<= |ULTIMATE.start_main_~result~0#1| 3)} is VALID [2022-02-20 18:16:24,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {729#(<= |ULTIMATE.start_main_~result~0#1| 3)} assume 10 == main_~result~0#1; {584#false} is VALID [2022-02-20 18:16:24,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {584#false} assume !false; {584#false} is VALID [2022-02-20 18:16:24,614 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:24,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:25,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {584#false} assume !false; {584#false} is VALID [2022-02-20 18:16:25,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {739#(not (<= 10 |ULTIMATE.start_main_~result~0#1|))} assume 10 == main_~result~0#1; {584#false} is VALID [2022-02-20 18:16:25,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {743#(< |ULTIMATE.start_main_#t~ret5#1| 10)} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {739#(not (<= 10 |ULTIMATE.start_main_~result~0#1|))} is VALID [2022-02-20 18:16:25,659 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {750#(< |id_#res| 10)} {583#true} #25#return; {743#(< |ULTIMATE.start_main_#t~ret5#1| 10)} is VALID [2022-02-20 18:16:25,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {750#(< |id_#res| 10)} assume true; {750#(< |id_#res| 10)} is VALID [2022-02-20 18:16:25,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {757#(< |id_#t~ret4| 9)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {750#(< |id_#res| 10)} is VALID [2022-02-20 18:16:25,661 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {764#(< |id_#res| 9)} {583#true} #27#return; {757#(< |id_#t~ret4| 9)} is VALID [2022-02-20 18:16:25,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {764#(< |id_#res| 9)} assume true; {764#(< |id_#res| 9)} is VALID [2022-02-20 18:16:25,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {771#(< |id_#t~ret4| 8)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {764#(< |id_#res| 9)} is VALID [2022-02-20 18:16:25,662 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {778#(< |id_#res| 8)} {583#true} #27#return; {771#(< |id_#t~ret4| 8)} is VALID [2022-02-20 18:16:25,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {778#(< |id_#res| 8)} assume true; {778#(< |id_#res| 8)} is VALID [2022-02-20 18:16:25,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {785#(< |id_#t~ret4| 7)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {778#(< |id_#res| 8)} is VALID [2022-02-20 18:16:25,663 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {792#(< |id_#res| 7)} {583#true} #27#return; {785#(< |id_#t~ret4| 7)} is VALID [2022-02-20 18:16:25,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {792#(< |id_#res| 7)} assume true; {792#(< |id_#res| 7)} is VALID [2022-02-20 18:16:25,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {583#true} assume 0 == ~x;#res := 0; {792#(< |id_#res| 7)} is VALID [2022-02-20 18:16:25,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:25,664 INFO L272 TraceCheckUtils]: 11: Hoare triple {583#true} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:25,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {583#true} assume !(0 == ~x); {583#true} is VALID [2022-02-20 18:16:25,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:25,665 INFO L272 TraceCheckUtils]: 8: Hoare triple {583#true} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:25,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {583#true} assume !(0 == ~x); {583#true} is VALID [2022-02-20 18:16:25,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:25,665 INFO L272 TraceCheckUtils]: 5: Hoare triple {583#true} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:25,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {583#true} assume !(0 == ~x); {583#true} is VALID [2022-02-20 18:16:25,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:25,666 INFO L272 TraceCheckUtils]: 2: Hoare triple {583#true} call main_#t~ret5#1 := id(main_~input~0#1); {583#true} is VALID [2022-02-20 18:16:25,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {583#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 := 10; {583#true} is VALID [2022-02-20 18:16:25,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {583#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); {583#true} is VALID [2022-02-20 18:16:25,666 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:25,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629492823] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:25,667 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:25,667 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2022-02-20 18:16:25,667 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432056494] [2022-02-20 18:16:25,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:25,668 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:25,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:25,669 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:25,708 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:25,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-20 18:16:25,708 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:25,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-20 18:16:25,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2022-02-20 18:16:25,709 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:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:26,082 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 18:16:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 18:16:26,082 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:26,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:26,083 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:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2022-02-20 18:16:26,085 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:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2022-02-20 18:16:26,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 43 transitions. [2022-02-20 18:16:26,133 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:26,134 INFO L225 Difference]: With dead ends: 39 [2022-02-20 18:16:26,134 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 18:16:26,135 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:26,136 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:16:26,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 87 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:16:26,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 18:16:26,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 18:16:26,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:26,140 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:26,140 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:26,140 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:26,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:26,152 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 18:16:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 18:16:26,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:26,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:26,153 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:26,153 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:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:26,155 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 18:16:26,155 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 18:16:26,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:26,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:26,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:26,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:26,156 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:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-02-20 18:16:26,157 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2022-02-20 18:16:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:26,157 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-02-20 18:16:26,158 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:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 18:16:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:16:26,159 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:26,159 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:26,187 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:26,359 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:26,360 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:26,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:26,360 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 4 times [2022-02-20 18:16:26,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:26,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369585984] [2022-02-20 18:16:26,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:26,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {1210#(= |id_#in~x| 0)} assume true; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1210#(= |id_#in~x| 0)} {1048#(= |id_#in~x| id_~x)} #27#return; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,784 INFO L272 TraceCheckUtils]: 2: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {1048#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {1210#(= |id_#in~x| 0)} assume true; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,786 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1210#(= |id_#in~x| 0)} {1048#(= |id_#in~x| id_~x)} #27#return; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {1209#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {1209#(<= |id_#in~x| 1)} assume true; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,787 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1209#(<= |id_#in~x| 1)} {1048#(= |id_#in~x| id_~x)} #27#return; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,788 INFO L272 TraceCheckUtils]: 2: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,789 INFO L272 TraceCheckUtils]: 5: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {1210#(= |id_#in~x| 0)} assume true; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,791 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1210#(= |id_#in~x| 0)} {1048#(= |id_#in~x| id_~x)} #27#return; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {1209#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {1209#(<= |id_#in~x| 1)} assume true; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,792 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1209#(<= |id_#in~x| 1)} {1048#(= |id_#in~x| id_~x)} #27#return; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {1204#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {1204#(<= |id_#in~x| 2)} assume true; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,793 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1204#(<= |id_#in~x| 2)} {1048#(= |id_#in~x| id_~x)} #27#return; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,794 INFO L272 TraceCheckUtils]: 2: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,797 INFO L272 TraceCheckUtils]: 5: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,798 INFO L272 TraceCheckUtils]: 8: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {1048#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {1210#(= |id_#in~x| 0)} assume true; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,800 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1210#(= |id_#in~x| 0)} {1048#(= |id_#in~x| id_~x)} #27#return; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {1209#(<= |id_#in~x| 1)} assume true; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,801 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1209#(<= |id_#in~x| 1)} {1048#(= |id_#in~x| id_~x)} #27#return; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {1204#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {1204#(<= |id_#in~x| 2)} assume true; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,802 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1204#(<= |id_#in~x| 2)} {1048#(= |id_#in~x| id_~x)} #27#return; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {1193#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {1193#(<= |id_#in~x| 3)} assume true; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,804 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1193#(<= |id_#in~x| 3)} {1048#(= |id_#in~x| id_~x)} #27#return; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,805 INFO L272 TraceCheckUtils]: 2: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,805 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,805 INFO L290 TraceCheckUtils]: 4: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,806 INFO L272 TraceCheckUtils]: 5: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,806 INFO L272 TraceCheckUtils]: 8: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,807 INFO L272 TraceCheckUtils]: 11: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {1210#(= |id_#in~x| 0)} assume true; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,809 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1210#(= |id_#in~x| 0)} {1048#(= |id_#in~x| id_~x)} #27#return; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {1209#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {1209#(<= |id_#in~x| 1)} assume true; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,810 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1209#(<= |id_#in~x| 1)} {1048#(= |id_#in~x| id_~x)} #27#return; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {1204#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {1204#(<= |id_#in~x| 2)} assume true; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,811 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1204#(<= |id_#in~x| 2)} {1048#(= |id_#in~x| id_~x)} #27#return; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {1193#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {1193#(<= |id_#in~x| 3)} assume true; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,813 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1193#(<= |id_#in~x| 3)} {1048#(= |id_#in~x| id_~x)} #27#return; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {1176#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {1176#(<= |id_#in~x| 4)} assume true; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,814 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1176#(<= |id_#in~x| 4)} {1048#(= |id_#in~x| id_~x)} #27#return; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:26,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,815 INFO L272 TraceCheckUtils]: 2: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,815 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,815 INFO L290 TraceCheckUtils]: 4: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,816 INFO L272 TraceCheckUtils]: 5: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,816 INFO L272 TraceCheckUtils]: 8: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,817 INFO L272 TraceCheckUtils]: 11: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,818 INFO L272 TraceCheckUtils]: 14: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {1048#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {1210#(= |id_#in~x| 0)} assume true; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,820 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1210#(= |id_#in~x| 0)} {1048#(= |id_#in~x| id_~x)} #27#return; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {1209#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {1209#(<= |id_#in~x| 1)} assume true; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,821 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1209#(<= |id_#in~x| 1)} {1048#(= |id_#in~x| id_~x)} #27#return; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {1204#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {1204#(<= |id_#in~x| 2)} assume true; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,822 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1204#(<= |id_#in~x| 2)} {1048#(= |id_#in~x| id_~x)} #27#return; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {1193#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {1193#(<= |id_#in~x| 3)} assume true; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,823 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1193#(<= |id_#in~x| 3)} {1048#(= |id_#in~x| id_~x)} #27#return; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,824 INFO L290 TraceCheckUtils]: 28: Hoare triple {1176#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {1176#(<= |id_#in~x| 4)} assume true; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,825 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1176#(<= |id_#in~x| 4)} {1048#(= |id_#in~x| id_~x)} #27#return; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:26,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {1153#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:26,825 INFO L290 TraceCheckUtils]: 32: Hoare triple {1153#(<= |id_#in~x| 5)} assume true; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:26,826 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1153#(<= |id_#in~x| 5)} {1048#(= |id_#in~x| id_~x)} #27#return; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:26,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,827 INFO L272 TraceCheckUtils]: 2: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,827 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,827 INFO L290 TraceCheckUtils]: 4: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,828 INFO L272 TraceCheckUtils]: 5: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,828 INFO L272 TraceCheckUtils]: 8: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,829 INFO L272 TraceCheckUtils]: 11: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,830 INFO L272 TraceCheckUtils]: 14: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,831 INFO L272 TraceCheckUtils]: 17: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {1048#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {1210#(= |id_#in~x| 0)} assume true; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,832 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1210#(= |id_#in~x| 0)} {1048#(= |id_#in~x| id_~x)} #27#return; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {1209#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {1209#(<= |id_#in~x| 1)} assume true; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,833 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1209#(<= |id_#in~x| 1)} {1048#(= |id_#in~x| id_~x)} #27#return; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {1204#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {1204#(<= |id_#in~x| 2)} assume true; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,835 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1204#(<= |id_#in~x| 2)} {1048#(= |id_#in~x| id_~x)} #27#return; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {1193#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {1193#(<= |id_#in~x| 3)} assume true; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,836 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1193#(<= |id_#in~x| 3)} {1048#(= |id_#in~x| id_~x)} #27#return; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {1176#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {1176#(<= |id_#in~x| 4)} assume true; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,837 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1176#(<= |id_#in~x| 4)} {1048#(= |id_#in~x| id_~x)} #27#return; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:26,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {1153#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:26,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {1153#(<= |id_#in~x| 5)} assume true; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:26,838 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1153#(<= |id_#in~x| 5)} {1048#(= |id_#in~x| id_~x)} #27#return; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:26,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {1124#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:26,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {1124#(<= |id_#in~x| 6)} assume true; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:26,839 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1124#(<= |id_#in~x| 6)} {1048#(= |id_#in~x| id_~x)} #27#return; {1089#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:26,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,840 INFO L272 TraceCheckUtils]: 2: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,841 INFO L272 TraceCheckUtils]: 5: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,842 INFO L272 TraceCheckUtils]: 8: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,843 INFO L272 TraceCheckUtils]: 11: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,844 INFO L272 TraceCheckUtils]: 14: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,844 INFO L272 TraceCheckUtils]: 17: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,845 INFO L272 TraceCheckUtils]: 20: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {1210#(= |id_#in~x| 0)} assume true; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,847 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1210#(= |id_#in~x| 0)} {1048#(= |id_#in~x| id_~x)} #27#return; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {1209#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {1209#(<= |id_#in~x| 1)} assume true; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,848 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1209#(<= |id_#in~x| 1)} {1048#(= |id_#in~x| id_~x)} #27#return; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {1204#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {1204#(<= |id_#in~x| 2)} assume true; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,849 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1204#(<= |id_#in~x| 2)} {1048#(= |id_#in~x| id_~x)} #27#return; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {1193#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {1193#(<= |id_#in~x| 3)} assume true; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,850 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1193#(<= |id_#in~x| 3)} {1048#(= |id_#in~x| id_~x)} #27#return; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {1176#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {1176#(<= |id_#in~x| 4)} assume true; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,852 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1176#(<= |id_#in~x| 4)} {1048#(= |id_#in~x| id_~x)} #27#return; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:26,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {1153#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:26,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {1153#(<= |id_#in~x| 5)} assume true; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:26,853 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1153#(<= |id_#in~x| 5)} {1048#(= |id_#in~x| id_~x)} #27#return; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:26,853 INFO L290 TraceCheckUtils]: 40: Hoare triple {1124#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:26,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {1124#(<= |id_#in~x| 6)} assume true; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:26,854 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1124#(<= |id_#in~x| 6)} {1048#(= |id_#in~x| id_~x)} #27#return; {1089#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:26,856 INFO L290 TraceCheckUtils]: 43: Hoare triple {1089#(<= |id_#in~x| 7)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1089#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:26,856 INFO L290 TraceCheckUtils]: 44: Hoare triple {1089#(<= |id_#in~x| 7)} assume true; {1089#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:26,857 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1089#(<= |id_#in~x| 7)} {1001#(<= 10 |ULTIMATE.start_main_~input~0#1|)} #25#return; {1000#false} is VALID [2022-02-20 18:16:26,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#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); {999#true} is VALID [2022-02-20 18:16:26,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {999#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 := 10; {1001#(<= 10 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:26,857 INFO L272 TraceCheckUtils]: 2: Hoare triple {1001#(<= 10 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {999#true} is VALID [2022-02-20 18:16:26,858 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,858 INFO L290 TraceCheckUtils]: 4: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,858 INFO L272 TraceCheckUtils]: 5: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,859 INFO L272 TraceCheckUtils]: 8: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,860 INFO L272 TraceCheckUtils]: 11: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,860 INFO L272 TraceCheckUtils]: 14: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,861 INFO L272 TraceCheckUtils]: 17: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,862 INFO L272 TraceCheckUtils]: 20: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,862 INFO L272 TraceCheckUtils]: 23: Hoare triple {1048#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:26,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {1048#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {1210#(= |id_#in~x| 0)} assume true; {1210#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,864 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1210#(= |id_#in~x| 0)} {1048#(= |id_#in~x| id_~x)} #27#return; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {1209#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {1209#(<= |id_#in~x| 1)} assume true; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,865 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1209#(<= |id_#in~x| 1)} {1048#(= |id_#in~x| id_~x)} #27#return; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {1204#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {1204#(<= |id_#in~x| 2)} assume true; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:26,866 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1204#(<= |id_#in~x| 2)} {1048#(= |id_#in~x| id_~x)} #27#return; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {1193#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {1193#(<= |id_#in~x| 3)} assume true; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:26,872 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1193#(<= |id_#in~x| 3)} {1048#(= |id_#in~x| id_~x)} #27#return; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {1176#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {1176#(<= |id_#in~x| 4)} assume true; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:26,874 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1176#(<= |id_#in~x| 4)} {1048#(= |id_#in~x| id_~x)} #27#return; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:26,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {1153#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:26,874 INFO L290 TraceCheckUtils]: 41: Hoare triple {1153#(<= |id_#in~x| 5)} assume true; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:26,875 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1153#(<= |id_#in~x| 5)} {1048#(= |id_#in~x| id_~x)} #27#return; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:26,875 INFO L290 TraceCheckUtils]: 43: Hoare triple {1124#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:26,875 INFO L290 TraceCheckUtils]: 44: Hoare triple {1124#(<= |id_#in~x| 6)} assume true; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:26,876 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1124#(<= |id_#in~x| 6)} {1048#(= |id_#in~x| id_~x)} #27#return; {1089#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:26,876 INFO L290 TraceCheckUtils]: 46: Hoare triple {1089#(<= |id_#in~x| 7)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1089#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:26,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {1089#(<= |id_#in~x| 7)} assume true; {1089#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:26,877 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1089#(<= |id_#in~x| 7)} {1001#(<= 10 |ULTIMATE.start_main_~input~0#1|)} #25#return; {1000#false} is VALID [2022-02-20 18:16:26,877 INFO L290 TraceCheckUtils]: 49: Hoare triple {1000#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; {1000#false} is VALID [2022-02-20 18:16:26,877 INFO L290 TraceCheckUtils]: 50: Hoare triple {1000#false} assume 10 == main_~result~0#1; {1000#false} is VALID [2022-02-20 18:16:26,877 INFO L290 TraceCheckUtils]: 51: Hoare triple {1000#false} assume !false; {1000#false} is VALID [2022-02-20 18:16:26,878 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:26,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:26,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369585984] [2022-02-20 18:16:26,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369585984] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:26,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293869292] [2022-02-20 18:16:26,878 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 18:16:26,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:26,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:26,900 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:26,910 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:26,947 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 18:16:26,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:16:26,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 18:16:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:27,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#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); {999#true} is VALID [2022-02-20 18:16:27,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {999#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 := 10; {1001#(<= 10 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:27,266 INFO L272 TraceCheckUtils]: 2: Hoare triple {1001#(<= 10 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {999#true} is VALID [2022-02-20 18:16:27,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,266 INFO L290 TraceCheckUtils]: 4: Hoare triple {1223#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,266 INFO L272 TraceCheckUtils]: 5: Hoare triple {1223#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:27,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {1223#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,267 INFO L272 TraceCheckUtils]: 8: Hoare triple {1223#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:27,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {1223#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,268 INFO L272 TraceCheckUtils]: 11: Hoare triple {1223#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:27,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {1223#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,281 INFO L272 TraceCheckUtils]: 14: Hoare triple {1223#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:27,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {1223#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,284 INFO L272 TraceCheckUtils]: 17: Hoare triple {1223#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:27,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {1223#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,284 INFO L272 TraceCheckUtils]: 20: Hoare triple {1223#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:27,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {1223#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,285 INFO L272 TraceCheckUtils]: 23: Hoare triple {1223#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:27,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {1223#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1290#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {1290#(<= |id_#in~x| 0)} assume true; {1290#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,287 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1290#(<= |id_#in~x| 0)} {1223#(<= |id_#in~x| id_~x)} #27#return; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {1209#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {1209#(<= |id_#in~x| 1)} assume true; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,288 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1209#(<= |id_#in~x| 1)} {1223#(<= |id_#in~x| id_~x)} #27#return; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {1204#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {1204#(<= |id_#in~x| 2)} assume true; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,289 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1204#(<= |id_#in~x| 2)} {1223#(<= |id_#in~x| id_~x)} #27#return; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:27,289 INFO L290 TraceCheckUtils]: 34: Hoare triple {1193#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:27,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {1193#(<= |id_#in~x| 3)} assume true; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:27,299 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1193#(<= |id_#in~x| 3)} {1223#(<= |id_#in~x| id_~x)} #27#return; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:27,300 INFO L290 TraceCheckUtils]: 37: Hoare triple {1176#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:27,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {1176#(<= |id_#in~x| 4)} assume true; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:27,301 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1176#(<= |id_#in~x| 4)} {1223#(<= |id_#in~x| id_~x)} #27#return; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:27,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {1153#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:27,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {1153#(<= |id_#in~x| 5)} assume true; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:27,302 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1153#(<= |id_#in~x| 5)} {1223#(<= |id_#in~x| id_~x)} #27#return; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:27,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {1124#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:27,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {1124#(<= |id_#in~x| 6)} assume true; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:27,303 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1124#(<= |id_#in~x| 6)} {1223#(<= |id_#in~x| id_~x)} #27#return; {1089#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:27,303 INFO L290 TraceCheckUtils]: 46: Hoare triple {1089#(<= |id_#in~x| 7)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1089#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:27,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {1089#(<= |id_#in~x| 7)} assume true; {1089#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:27,304 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1089#(<= |id_#in~x| 7)} {1001#(<= 10 |ULTIMATE.start_main_~input~0#1|)} #25#return; {1000#false} is VALID [2022-02-20 18:16:27,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {1000#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; {1000#false} is VALID [2022-02-20 18:16:27,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {1000#false} assume 10 == main_~result~0#1; {1000#false} is VALID [2022-02-20 18:16:27,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {1000#false} assume !false; {1000#false} is VALID [2022-02-20 18:16:27,305 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:27,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:34,608 INFO L290 TraceCheckUtils]: 51: Hoare triple {1000#false} assume !false; {1000#false} is VALID [2022-02-20 18:16:34,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {1000#false} assume 10 == main_~result~0#1; {1000#false} is VALID [2022-02-20 18:16:34,609 INFO L290 TraceCheckUtils]: 49: Hoare triple {1000#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; {1000#false} is VALID [2022-02-20 18:16:34,610 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1089#(<= |id_#in~x| 7)} {1378#(< 7 |ULTIMATE.start_main_~input~0#1|)} #25#return; {1000#false} is VALID [2022-02-20 18:16:34,610 INFO L290 TraceCheckUtils]: 47: Hoare triple {1089#(<= |id_#in~x| 7)} assume true; {1089#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:34,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {1089#(<= |id_#in~x| 7)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1089#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:34,611 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1124#(<= |id_#in~x| 6)} {1391#(or (< 7 id_~x) (<= |id_#in~x| 7))} #27#return; {1089#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:16:34,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {1124#(<= |id_#in~x| 6)} assume true; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:34,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {1124#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:34,613 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1153#(<= |id_#in~x| 5)} {1404#(or (< 6 id_~x) (<= |id_#in~x| 6))} #27#return; {1124#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:34,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {1153#(<= |id_#in~x| 5)} assume true; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:34,613 INFO L290 TraceCheckUtils]: 40: Hoare triple {1153#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:34,614 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1176#(<= |id_#in~x| 4)} {1417#(or (< 5 id_~x) (<= |id_#in~x| 5))} #27#return; {1153#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:34,615 INFO L290 TraceCheckUtils]: 38: Hoare triple {1176#(<= |id_#in~x| 4)} assume true; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {1176#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,616 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1193#(<= |id_#in~x| 3)} {1430#(or (<= |id_#in~x| 4) (< 4 id_~x))} #27#return; {1176#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {1193#(<= |id_#in~x| 3)} assume true; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {1193#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,617 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1204#(<= |id_#in~x| 2)} {1443#(or (< 3 id_~x) (<= |id_#in~x| 3))} #27#return; {1193#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {1204#(<= |id_#in~x| 2)} assume true; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {1204#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,618 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1209#(<= |id_#in~x| 1)} {1456#(or (<= |id_#in~x| 2) (< 2 id_~x))} #27#return; {1204#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {1209#(<= |id_#in~x| 1)} assume true; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {1209#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,620 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1290#(<= |id_#in~x| 0)} {1469#(or (< 1 id_~x) (<= |id_#in~x| 1))} #27#return; {1209#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {1290#(<= |id_#in~x| 0)} assume true; {1290#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {1479#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} assume 0 == ~x;#res := 0; {1290#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#true} ~x := #in~x; {1479#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} is VALID [2022-02-20 18:16:34,621 INFO L272 TraceCheckUtils]: 23: Hoare triple {1469#(or (< 1 id_~x) (<= |id_#in~x| 1))} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:34,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {1469#(or (< 1 id_~x) (<= |id_#in~x| 1))} assume !(0 == ~x); {1469#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:34,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {999#true} ~x := #in~x; {1469#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:34,622 INFO L272 TraceCheckUtils]: 20: Hoare triple {1456#(or (<= |id_#in~x| 2) (< 2 id_~x))} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:34,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {1456#(or (<= |id_#in~x| 2) (< 2 id_~x))} assume !(0 == ~x); {1456#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:34,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {999#true} ~x := #in~x; {1456#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:34,623 INFO L272 TraceCheckUtils]: 17: Hoare triple {1443#(or (< 3 id_~x) (<= |id_#in~x| 3))} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:34,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {1443#(or (< 3 id_~x) (<= |id_#in~x| 3))} assume !(0 == ~x); {1443#(or (< 3 id_~x) (<= |id_#in~x| 3))} is VALID [2022-02-20 18:16:34,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#true} ~x := #in~x; {1443#(or (< 3 id_~x) (<= |id_#in~x| 3))} is VALID [2022-02-20 18:16:34,624 INFO L272 TraceCheckUtils]: 14: Hoare triple {1430#(or (<= |id_#in~x| 4) (< 4 id_~x))} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:34,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {1430#(or (<= |id_#in~x| 4) (< 4 id_~x))} assume !(0 == ~x); {1430#(or (<= |id_#in~x| 4) (< 4 id_~x))} is VALID [2022-02-20 18:16:34,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} ~x := #in~x; {1430#(or (<= |id_#in~x| 4) (< 4 id_~x))} is VALID [2022-02-20 18:16:34,625 INFO L272 TraceCheckUtils]: 11: Hoare triple {1417#(or (< 5 id_~x) (<= |id_#in~x| 5))} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:34,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {1417#(or (< 5 id_~x) (<= |id_#in~x| 5))} assume !(0 == ~x); {1417#(or (< 5 id_~x) (<= |id_#in~x| 5))} is VALID [2022-02-20 18:16:34,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} ~x := #in~x; {1417#(or (< 5 id_~x) (<= |id_#in~x| 5))} is VALID [2022-02-20 18:16:34,626 INFO L272 TraceCheckUtils]: 8: Hoare triple {1404#(or (< 6 id_~x) (<= |id_#in~x| 6))} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:34,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {1404#(or (< 6 id_~x) (<= |id_#in~x| 6))} assume !(0 == ~x); {1404#(or (< 6 id_~x) (<= |id_#in~x| 6))} is VALID [2022-02-20 18:16:34,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1404#(or (< 6 id_~x) (<= |id_#in~x| 6))} is VALID [2022-02-20 18:16:34,626 INFO L272 TraceCheckUtils]: 5: Hoare triple {1391#(or (< 7 id_~x) (<= |id_#in~x| 7))} call #t~ret4 := id(~x - 1); {999#true} is VALID [2022-02-20 18:16:34,627 INFO L290 TraceCheckUtils]: 4: Hoare triple {1391#(or (< 7 id_~x) (<= |id_#in~x| 7))} assume !(0 == ~x); {1391#(or (< 7 id_~x) (<= |id_#in~x| 7))} is VALID [2022-02-20 18:16:34,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1391#(or (< 7 id_~x) (<= |id_#in~x| 7))} is VALID [2022-02-20 18:16:34,627 INFO L272 TraceCheckUtils]: 2: Hoare triple {1378#(< 7 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {999#true} is VALID [2022-02-20 18:16:34,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {999#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 := 10; {1378#(< 7 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:34,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#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); {999#true} is VALID [2022-02-20 18:16:34,628 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:34,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293869292] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:34,629 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:34,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 23 [2022-02-20 18:16:34,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94507945] [2022-02-20 18:16:34,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:34,630 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) Word has length 52