./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80b250f44ccc89442200d93f4bf6653c7aad36a18be4f80bda8f239187e0714d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:16:25,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:16:25,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:16:25,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:16:25,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:16:25,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:16:25,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:16:25,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:16:25,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:16:25,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:16:25,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:16:25,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:16:25,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:16:25,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:16:25,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:16:25,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:16:25,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:16:25,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:16:25,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:16:25,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:16:25,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:16:25,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:16:25,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:16:25,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:16:25,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:16:25,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:16:25,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:16:25,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:16:25,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:16:25,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:16:25,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:16:25,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:16:25,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:16:25,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:16:25,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:16:25,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:16:25,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:16:25,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:16:25,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:16:25,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:16:25,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:16:25,926 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:25,966 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:16:25,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:16:25,967 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:16:25,968 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:16:25,969 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:16:25,969 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:16:25,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:16:25,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:16:25,975 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:16:25,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:16:25,976 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:16:25,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:16:25,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:16:25,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:16:25,977 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:16:25,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:16:25,977 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:16:25,978 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:16:25,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:16:25,978 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:16:25,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:16:25,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:16:25,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:16:25,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:16:25,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:16:25,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:16:25,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:16:25,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:16:25,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:16:25,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:16:25,980 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:16:25,981 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:16:25,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:16:25,981 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 -> 80b250f44ccc89442200d93f4bf6653c7aad36a18be4f80bda8f239187e0714d [2022-02-20 18:16:26,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:16:26,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:16:26,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:16:26,283 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:16:26,284 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:16:26,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c [2022-02-20 18:16:26,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0494d9ced/a414359bcf7b43faaf696bbd5bc7f6ff/FLAGcfa6d511a [2022-02-20 18:16:26,760 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:16:26,760 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i20_o20-2.c [2022-02-20 18:16:26,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0494d9ced/a414359bcf7b43faaf696bbd5bc7f6ff/FLAGcfa6d511a [2022-02-20 18:16:26,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0494d9ced/a414359bcf7b43faaf696bbd5bc7f6ff [2022-02-20 18:16:26,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:16:26,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:16:26,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:16:26,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:16:26,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:16:26,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:16:26" (1/1) ... [2022-02-20 18:16:26,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb245f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:26, skipping insertion in model container [2022-02-20 18:16:26,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:16:26" (1/1) ... [2022-02-20 18:16:26,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:16:26,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:16:26,950 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_i20_o20-2.c[454,467] [2022-02-20 18:16:26,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:16:26,973 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:16:26,994 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_i20_o20-2.c[454,467] [2022-02-20 18:16:26,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:16:27,010 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:16:27,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:27 WrapperNode [2022-02-20 18:16:27,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:16:27,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:16:27,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:16:27,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:16:27,019 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:27" (1/1) ... [2022-02-20 18:16:27,025 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:27" (1/1) ... [2022-02-20 18:16:27,041 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2022-02-20 18:16:27,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:16:27,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:16:27,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:16:27,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:16:27,049 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:27" (1/1) ... [2022-02-20 18:16:27,050 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:27" (1/1) ... [2022-02-20 18:16:27,051 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:27" (1/1) ... [2022-02-20 18:16:27,052 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:27" (1/1) ... [2022-02-20 18:16:27,056 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:27" (1/1) ... [2022-02-20 18:16:27,058 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:27" (1/1) ... [2022-02-20 18:16:27,062 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:27" (1/1) ... [2022-02-20 18:16:27,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:16:27,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:16:27,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:16:27,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:16:27,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:27" (1/1) ... [2022-02-20 18:16:27,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:16:27,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:27,100 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:27,123 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:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:16:27,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:16:27,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:16:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:16:27,140 INFO L130 BoogieDeclarations]: Found specification of procedure id [2022-02-20 18:16:27,140 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2022-02-20 18:16:27,195 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:16:27,197 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:16:27,320 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:16:27,333 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:16:27,334 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:16:27,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:16:27 BoogieIcfgContainer [2022-02-20 18:16:27,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:16:27,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:16:27,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:16:27,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:16:27,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:16:26" (1/3) ... [2022-02-20 18:16:27,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e27b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:16:27, skipping insertion in model container [2022-02-20 18:16:27,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:27" (2/3) ... [2022-02-20 18:16:27,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e27b0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:16:27, skipping insertion in model container [2022-02-20 18:16:27,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:16:27" (3/3) ... [2022-02-20 18:16:27,343 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i20_o20-2.c [2022-02-20 18:16:27,348 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:16:27,348 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:16:27,387 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:16:27,392 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:27,393 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:16:27,409 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:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 18:16:27,413 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:27,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:27,414 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:27,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:27,418 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2022-02-20 18:16:27,426 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:27,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103969664] [2022-02-20 18:16:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:27,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:27,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:27,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} ~x := #in~x; {19#true} is VALID [2022-02-20 18:16:27,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume 0 == ~x;#res := 0; {27#(= |id_#res| 0)} is VALID [2022-02-20 18:16:27,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#(= |id_#res| 0)} assume true; {27#(= |id_#res| 0)} is VALID [2022-02-20 18:16:27,705 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:27,706 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:27,707 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 := 20; {19#true} is VALID [2022-02-20 18:16:27,707 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:27,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {19#true} ~x := #in~x; {19#true} is VALID [2022-02-20 18:16:27,709 INFO L290 TraceCheckUtils]: 4: Hoare triple {19#true} assume 0 == ~x;#res := 0; {27#(= |id_#res| 0)} is VALID [2022-02-20 18:16:27,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#(= |id_#res| 0)} assume true; {27#(= |id_#res| 0)} is VALID [2022-02-20 18:16:27,711 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:27,712 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:27,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#(= |ULTIMATE.start_main_~result~0#1| 0)} assume 20 == main_~result~0#1; {20#false} is VALID [2022-02-20 18:16:27,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-02-20 18:16:27,714 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:27,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:27,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103969664] [2022-02-20 18:16:27,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103969664] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:16:27,718 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:16:27,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:16:27,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288862771] [2022-02-20 18:16:27,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:16:27,726 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:27,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:27,731 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:27,751 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:27,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:16:27,752 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:27,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:16:27,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:16:27,780 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:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:27,895 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-02-20 18:16:27,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:16:27,895 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:27,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:27,897 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:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-20 18:16:27,908 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:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-02-20 18:16:27,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-02-20 18:16:27,957 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:27,965 INFO L225 Difference]: With dead ends: 28 [2022-02-20 18:16:27,965 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 18:16:27,967 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:27,971 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:27,972 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:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 18:16:28,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 18:16:28,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:28,001 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:28,002 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:28,002 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:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:28,006 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-20 18:16:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 18:16:28,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:28,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:28,008 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:28,008 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:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:28,010 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-20 18:16:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 18:16:28,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:28,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:28,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:28,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:28,012 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:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-02-20 18:16:28,015 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-02-20 18:16:28,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:28,015 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-02-20 18:16:28,016 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:28,016 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 18:16:28,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 18:16:28,017 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:28,017 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:28,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:16:28,018 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:28,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:28,018 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2022-02-20 18:16:28,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:28,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889357142] [2022-02-20 18:16:28,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:28,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:28,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:28,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:28,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#true} ~x := #in~x; {122#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:28,133 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:28,134 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:28,135 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:28,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#true} ~x := #in~x; {122#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:28,137 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:28,138 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:28,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {109#true} ~x := #in~x; {122#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:28,145 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:28,145 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:28,147 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:28,147 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:28,150 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:28,151 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {127#(<= |id_#in~x| 1)} {111#(<= 20 |ULTIMATE.start_main_~input~0#1|)} #25#return; {110#false} is VALID [2022-02-20 18:16:28,152 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:28,152 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 := 20; {111#(<= 20 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:28,153 INFO L272 TraceCheckUtils]: 2: Hoare triple {111#(<= 20 |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:28,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {109#true} ~x := #in~x; {122#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:28,154 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:28,154 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:28,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {109#true} ~x := #in~x; {122#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:28,155 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:28,156 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:28,157 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:28,158 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:28,158 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:28,159 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {127#(<= |id_#in~x| 1)} {111#(<= 20 |ULTIMATE.start_main_~input~0#1|)} #25#return; {110#false} is VALID [2022-02-20 18:16:28,160 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:28,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {110#false} assume 20 == main_~result~0#1; {110#false} is VALID [2022-02-20 18:16:28,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 18:16:28,161 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:28,161 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:28,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889357142] [2022-02-20 18:16:28,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889357142] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:28,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008593855] [2022-02-20 18:16:28,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:28,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:28,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:28,167 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:28,179 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:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:28,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 18:16:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:28,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:28,486 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:28,487 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 := 20; {111#(<= 20 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:28,487 INFO L272 TraceCheckUtils]: 2: Hoare triple {111#(<= 20 |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:28,488 INFO L290 TraceCheckUtils]: 3: Hoare triple {109#true} ~x := #in~x; {141#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:28,488 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:28,488 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:28,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {109#true} ~x := #in~x; {141#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:28,489 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:28,490 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:28,491 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:28,492 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:28,492 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:28,493 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {127#(<= |id_#in~x| 1)} {111#(<= 20 |ULTIMATE.start_main_~input~0#1|)} #25#return; {110#false} is VALID [2022-02-20 18:16:28,493 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:28,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {110#false} assume 20 == main_~result~0#1; {110#false} is VALID [2022-02-20 18:16:28,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 18:16:28,494 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:28,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:29,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 18:16:29,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {110#false} assume 20 == main_~result~0#1; {110#false} is VALID [2022-02-20 18:16:29,158 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:29,159 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:29,160 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:29,161 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:29,163 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:29,163 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:29,164 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:29,164 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:29,165 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:29,165 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:29,166 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:29,166 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:29,170 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 := 20; {188#(< 1 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:29,171 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:29,171 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:29,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008593855] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:29,171 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:29,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2022-02-20 18:16:29,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078718466] [2022-02-20 18:16:29,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:29,174 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:29,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:29,175 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:29,206 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:29,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 18:16:29,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:29,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 18:16:29,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 18:16:29,208 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:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:29,343 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 18:16:29,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:16:29,344 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:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:29,345 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:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 18:16:29,347 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:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 18:16:29,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-02-20 18:16:29,368 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:29,369 INFO L225 Difference]: With dead ends: 22 [2022-02-20 18:16:29,369 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 18:16:29,370 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:29,371 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:29,371 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:29,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 18:16:29,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 18:16:29,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:29,375 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:29,376 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:29,376 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:29,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:29,378 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 18:16:29,378 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 18:16:29,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:29,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:29,379 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:29,379 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:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:29,381 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 18:16:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 18:16:29,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:29,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:29,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:29,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:29,382 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:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-02-20 18:16:29,384 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-02-20 18:16:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:29,384 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-02-20 18:16:29,384 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:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 18:16:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 18:16:29,385 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:29,385 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:29,412 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:29,608 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:29,609 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:29,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:29,609 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2022-02-20 18:16:29,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:29,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583076989] [2022-02-20 18:16:29,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:29,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:29,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:29,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:29,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,709 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:29,710 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:29,711 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:29,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,712 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:29,712 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:29,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,713 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:29,714 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:29,715 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:29,715 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:29,715 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:29,717 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:29,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,718 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:29,718 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:29,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,719 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:29,719 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:29,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,720 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:29,721 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:29,722 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:29,722 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:29,723 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:29,723 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:29,724 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:29,724 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:29,725 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {342#(<= |id_#in~x| 2)} {314#(<= 20 |ULTIMATE.start_main_~input~0#1|)} #25#return; {313#false} is VALID [2022-02-20 18:16:29,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {312#true} is VALID [2022-02-20 18:16:29,726 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 := 20; {314#(<= 20 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:29,726 INFO L272 TraceCheckUtils]: 2: Hoare triple {314#(<= 20 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {312#true} is VALID [2022-02-20 18:16:29,727 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,727 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:29,728 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:29,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,729 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:29,729 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:29,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,730 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:29,730 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:29,731 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:29,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#(<= |id_#in~x| 1)} assume true; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,733 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:29,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {342#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {342#(<= |id_#in~x| 2)} assume true; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,735 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {342#(<= |id_#in~x| 2)} {314#(<= 20 |ULTIMATE.start_main_~input~0#1|)} #25#return; {313#false} is VALID [2022-02-20 18:16:29,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {313#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {313#false} is VALID [2022-02-20 18:16:29,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {313#false} assume 20 == main_~result~0#1; {313#false} is VALID [2022-02-20 18:16:29,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 18:16:29,735 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:29,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:29,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583076989] [2022-02-20 18:16:29,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583076989] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:29,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60637547] [2022-02-20 18:16:29,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 18:16:29,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:29,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:29,738 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:29,763 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:29,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 18:16:29,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:16:29,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 18:16:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:29,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:30,065 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:30,066 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 := 20; {314#(<= 20 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:30,066 INFO L272 TraceCheckUtils]: 2: Hoare triple {314#(<= 20 |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:30,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {361#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:30,067 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:30,067 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:30,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} ~x := #in~x; {361#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:30,071 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:30,071 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:30,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#true} ~x := #in~x; {361#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:30,072 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:30,072 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:30,073 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:30,074 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:30,074 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:30,075 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:30,075 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:30,076 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:30,077 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {342#(<= |id_#in~x| 2)} {314#(<= 20 |ULTIMATE.start_main_~input~0#1|)} #25#return; {313#false} is VALID [2022-02-20 18:16:30,077 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:30,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {313#false} assume 20 == main_~result~0#1; {313#false} is VALID [2022-02-20 18:16:30,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 18:16:30,079 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:30,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:31,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 18:16:31,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {313#false} assume 20 == main_~result~0#1; {313#false} is VALID [2022-02-20 18:16:31,067 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:31,068 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:31,068 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:31,071 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:31,072 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:31,072 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:31,073 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:31,074 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:31,074 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:31,075 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:31,075 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:31,076 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:31,076 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:31,077 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:31,077 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:31,077 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:31,078 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:31,078 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:31,078 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 := 20; {426#(< 2 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:31,079 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:31,079 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:31,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60637547] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:31,080 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:31,080 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 13 [2022-02-20 18:16:31,080 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865857856] [2022-02-20 18:16:31,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:31,083 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:31,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:31,088 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:31,116 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:31,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 18:16:31,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:31,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 18:16:31,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-02-20 18:16:31,118 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:31,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:31,256 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-20 18:16:31,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:16:31,256 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:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:31,257 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:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-02-20 18:16:31,259 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:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-02-20 18:16:31,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 26 transitions. [2022-02-20 18:16:31,284 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:31,286 INFO L225 Difference]: With dead ends: 25 [2022-02-20 18:16:31,286 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 18:16:31,287 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:31,288 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:31,288 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:31,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 18:16:31,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 18:16:31,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:31,293 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:31,293 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:31,294 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:31,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:31,296 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 18:16:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 18:16:31,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:31,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:31,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 21 states. [2022-02-20 18:16:31,297 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 21 states. [2022-02-20 18:16:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:31,299 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 18:16:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 18:16:31,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:31,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:31,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:31,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:31,300 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:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-02-20 18:16:31,302 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2022-02-20 18:16:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:31,302 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-02-20 18:16:31,303 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:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 18:16:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 18:16:31,304 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:31,304 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:31,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 18:16:31,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 18:16:31,519 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:31,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2022-02-20 18:16:31,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:31,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932752543] [2022-02-20 18:16:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,665 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:31,665 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:31,666 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:31,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,668 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:31,668 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:31,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,669 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:31,671 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:31,674 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:31,674 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:31,675 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:31,676 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:31,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,677 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:31,677 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:31,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,678 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:31,679 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:31,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,679 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:31,680 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:31,681 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:31,681 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:31,682 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:31,685 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:31,686 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:31,686 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:31,687 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:31,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,689 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:31,689 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:31,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,690 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:31,690 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:31,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,691 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:31,692 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:31,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,692 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:31,693 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:31,694 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:31,694 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:31,694 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:31,699 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:31,700 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:31,700 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:31,701 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:31,701 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:31,702 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:31,702 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {625#(<= |id_#in~x| 3)} {585#(<= 20 |ULTIMATE.start_main_~input~0#1|)} #25#return; {584#false} is VALID [2022-02-20 18:16:31,703 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:31,703 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 := 20; {585#(<= 20 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:31,704 INFO L272 TraceCheckUtils]: 2: Hoare triple {585#(<= 20 |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:31,704 INFO L290 TraceCheckUtils]: 3: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,705 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:31,705 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:31,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,706 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:31,706 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:31,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,707 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:31,707 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:31,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {583#true} ~x := #in~x; {608#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,708 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:31,708 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:31,714 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:31,714 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:31,714 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:31,716 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:31,717 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:31,718 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:31,720 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:31,720 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:31,722 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:31,723 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {625#(<= |id_#in~x| 3)} {585#(<= 20 |ULTIMATE.start_main_~input~0#1|)} #25#return; {584#false} is VALID [2022-02-20 18:16:31,723 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:31,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {584#false} assume 20 == main_~result~0#1; {584#false} is VALID [2022-02-20 18:16:31,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {584#false} assume !false; {584#false} is VALID [2022-02-20 18:16:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 18:16:31,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:31,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932752543] [2022-02-20 18:16:31,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932752543] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:31,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673258864] [2022-02-20 18:16:31,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 18:16:31,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:31,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:31,731 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:31,732 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:31,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 18:16:31,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:16:31,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 18:16:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:31,987 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:31,987 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 := 20; {583#true} is VALID [2022-02-20 18:16:31,988 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:31,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:31,990 INFO L290 TraceCheckUtils]: 4: Hoare triple {583#true} assume !(0 == ~x); {583#true} is VALID [2022-02-20 18:16:31,990 INFO L272 TraceCheckUtils]: 5: Hoare triple {583#true} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:31,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:31,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {583#true} assume !(0 == ~x); {583#true} is VALID [2022-02-20 18:16:31,991 INFO L272 TraceCheckUtils]: 8: Hoare triple {583#true} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:31,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:31,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {583#true} assume !(0 == ~x); {583#true} is VALID [2022-02-20 18:16:31,991 INFO L272 TraceCheckUtils]: 11: Hoare triple {583#true} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:31,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:31,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {583#true} assume 0 == ~x;#res := 0; {685#(<= |id_#res| 0)} is VALID [2022-02-20 18:16:31,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {685#(<= |id_#res| 0)} assume true; {685#(<= |id_#res| 0)} is VALID [2022-02-20 18:16:31,994 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:31,994 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:31,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {696#(<= |id_#res| 1)} assume true; {696#(<= |id_#res| 1)} is VALID [2022-02-20 18:16:31,995 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:31,996 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:31,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {707#(<= |id_#res| 2)} assume true; {707#(<= |id_#res| 2)} is VALID [2022-02-20 18:16:31,997 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:31,998 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:31,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {718#(<= |id_#res| 3)} assume true; {718#(<= |id_#res| 3)} is VALID [2022-02-20 18:16:31,999 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:32,000 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:32,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {729#(<= |ULTIMATE.start_main_~result~0#1| 3)} assume 20 == main_~result~0#1; {584#false} is VALID [2022-02-20 18:16:32,001 INFO L290 TraceCheckUtils]: 27: Hoare triple {584#false} assume !false; {584#false} is VALID [2022-02-20 18:16:32,002 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:32,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:33,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {584#false} assume !false; {584#false} is VALID [2022-02-20 18:16:33,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {739#(not (<= 20 |ULTIMATE.start_main_~result~0#1|))} assume 20 == main_~result~0#1; {584#false} is VALID [2022-02-20 18:16:33,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {743#(< |ULTIMATE.start_main_#t~ret5#1| 20)} 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 (<= 20 |ULTIMATE.start_main_~result~0#1|))} is VALID [2022-02-20 18:16:33,310 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {750#(< |id_#res| 20)} {583#true} #25#return; {743#(< |ULTIMATE.start_main_#t~ret5#1| 20)} is VALID [2022-02-20 18:16:33,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {750#(< |id_#res| 20)} assume true; {750#(< |id_#res| 20)} is VALID [2022-02-20 18:16:33,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {757#(< |id_#t~ret4| 19)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {750#(< |id_#res| 20)} is VALID [2022-02-20 18:16:33,313 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {764#(< |id_#res| 19)} {583#true} #27#return; {757#(< |id_#t~ret4| 19)} is VALID [2022-02-20 18:16:33,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {764#(< |id_#res| 19)} assume true; {764#(< |id_#res| 19)} is VALID [2022-02-20 18:16:33,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {771#(< |id_#t~ret4| 18)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {764#(< |id_#res| 19)} is VALID [2022-02-20 18:16:33,315 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {778#(< |id_#res| 18)} {583#true} #27#return; {771#(< |id_#t~ret4| 18)} is VALID [2022-02-20 18:16:33,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {778#(< |id_#res| 18)} assume true; {778#(< |id_#res| 18)} is VALID [2022-02-20 18:16:33,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {785#(< |id_#t~ret4| 17)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {778#(< |id_#res| 18)} is VALID [2022-02-20 18:16:33,316 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {792#(< |id_#res| 17)} {583#true} #27#return; {785#(< |id_#t~ret4| 17)} is VALID [2022-02-20 18:16:33,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {792#(< |id_#res| 17)} assume true; {792#(< |id_#res| 17)} is VALID [2022-02-20 18:16:33,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {583#true} assume 0 == ~x;#res := 0; {792#(< |id_#res| 17)} is VALID [2022-02-20 18:16:33,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:33,318 INFO L272 TraceCheckUtils]: 11: Hoare triple {583#true} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:33,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {583#true} assume !(0 == ~x); {583#true} is VALID [2022-02-20 18:16:33,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:33,318 INFO L272 TraceCheckUtils]: 8: Hoare triple {583#true} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:33,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {583#true} assume !(0 == ~x); {583#true} is VALID [2022-02-20 18:16:33,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:33,319 INFO L272 TraceCheckUtils]: 5: Hoare triple {583#true} call #t~ret4 := id(~x - 1); {583#true} is VALID [2022-02-20 18:16:33,319 INFO L290 TraceCheckUtils]: 4: Hoare triple {583#true} assume !(0 == ~x); {583#true} is VALID [2022-02-20 18:16:33,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {583#true} ~x := #in~x; {583#true} is VALID [2022-02-20 18:16:33,319 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:33,319 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 := 20; {583#true} is VALID [2022-02-20 18:16:33,320 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:33,320 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:33,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673258864] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:33,320 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:33,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2022-02-20 18:16:33,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708884664] [2022-02-20 18:16:33,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:33,322 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:33,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:33,323 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:33,385 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:33,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-20 18:16:33,385 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:33,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-20 18:16:33,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2022-02-20 18:16:33,386 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:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:33,848 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-02-20 18:16:33,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 18:16:33,848 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:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:33,849 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:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2022-02-20 18:16:33,851 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:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2022-02-20 18:16:33,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 43 transitions. [2022-02-20 18:16:33,893 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:33,895 INFO L225 Difference]: With dead ends: 39 [2022-02-20 18:16:33,895 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 18:16:33,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=252, Invalid=1388, Unknown=0, NotChecked=0, Total=1640 [2022-02-20 18:16:33,897 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:33,897 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:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 18:16:33,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 18:16:33,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:33,902 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:33,902 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:33,903 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:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:33,905 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 18:16:33,905 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 18:16:33,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:33,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:33,906 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:33,906 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:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:33,909 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 18:16:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 18:16:33,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:33,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:33,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:33,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:33,910 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:33,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-02-20 18:16:33,912 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2022-02-20 18:16:33,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:33,912 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-02-20 18:16:33,912 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:33,913 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 18:16:33,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:16:33,914 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:33,914 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:33,939 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:34,139 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:34,140 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:34,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:34,140 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 4 times [2022-02-20 18:16:34,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:34,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560649920] [2022-02-20 18:16:34,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:34,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,459 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:34,459 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:34,460 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:34,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,461 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:34,461 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:34,462 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,463 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:34,463 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:34,464 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:34,464 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:34,464 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:34,465 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:34,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,466 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:34,466 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:34,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,467 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:34,467 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:34,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,468 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:34,469 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:34,472 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:34,473 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:34,473 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:34,474 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:34,474 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:34,474 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:34,475 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:34,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,476 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:34,476 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:34,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,477 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:34,477 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:34,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,478 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:34,478 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:34,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,479 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:34,480 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:34,480 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:34,481 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:34,481 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:34,482 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:34,482 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:34,483 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:34,484 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:34,485 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:34,485 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:34,486 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:34,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,487 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:34,487 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:34,487 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,488 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:34,488 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:34,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,489 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:34,489 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:34,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,490 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:34,491 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:34,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,494 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:34,495 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:34,495 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:34,496 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:34,496 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:34,498 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:34,498 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:34,499 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:34,500 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:34,500 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:34,500 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:34,501 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:34,501 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:34,502 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:34,503 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:34,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,503 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:34,504 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:34,504 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,504 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:34,504 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:34,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,505 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:34,505 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:34,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,506 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:34,506 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:34,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,507 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:34,507 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:34,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,508 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:34,508 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:34,509 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:34,509 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:34,510 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:34,510 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:34,511 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:34,511 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:34,512 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:34,512 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:34,513 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:34,513 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:34,514 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:34,514 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:34,515 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:34,515 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:34,516 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:34,516 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:34,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,528 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:34,528 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:34,529 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,529 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:34,529 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:34,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,530 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:34,530 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:34,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,531 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:34,531 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:34,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,532 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:34,532 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:34,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,533 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:34,533 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:34,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,533 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:34,534 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:34,534 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:34,535 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:34,535 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:34,536 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:34,536 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:34,537 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:34,537 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:34,538 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:34,538 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:34,539 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:34,539 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:34,540 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:34,540 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:34,541 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:34,541 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:34,542 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:34,542 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:34,543 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:34,543 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:34,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,544 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:34,544 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:34,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,545 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:34,545 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:34,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,546 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:34,546 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:34,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,547 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:34,547 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:34,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,548 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:34,548 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:34,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,548 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:34,549 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:34,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,549 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:34,550 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:34,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,550 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:34,551 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:34,551 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:34,552 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:34,552 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:34,553 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:34,553 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:34,553 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:34,554 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:34,554 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:34,555 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:34,555 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:34,556 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:34,556 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:34,557 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:34,557 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:34,558 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:34,558 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:34,559 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:34,559 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:34,560 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:34,560 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:34,560 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:34,561 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1089#(<= |id_#in~x| 7)} {1001#(<= 20 |ULTIMATE.start_main_~input~0#1|)} #25#return; {1000#false} is VALID [2022-02-20 18:16:34,561 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,562 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 := 20; {1001#(<= 20 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:34,562 INFO L272 TraceCheckUtils]: 2: Hoare triple {1001#(<= 20 |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,562 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,563 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:34,563 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:34,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,564 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:34,564 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:34,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,564 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:34,565 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:34,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,565 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:34,565 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:34,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,566 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:34,566 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:34,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,567 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:34,567 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:34,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,568 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:34,568 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:34,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#true} ~x := #in~x; {1048#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,569 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:34,569 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:34,570 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:34,570 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,570 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,571 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:34,572 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,572 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,573 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:34,573 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,573 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,574 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:34,574 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,575 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,576 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:34,576 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,576 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,577 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:34,577 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,578 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,578 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:34,579 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,579 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,580 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1089#(<= |id_#in~x| 7)} {1001#(<= 20 |ULTIMATE.start_main_~input~0#1|)} #25#return; {1000#false} is VALID [2022-02-20 18:16:34,580 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,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {1000#false} assume 20 == main_~result~0#1; {1000#false} is VALID [2022-02-20 18:16:34,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {1000#false} assume !false; {1000#false} is VALID [2022-02-20 18:16:34,581 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:34,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:34,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560649920] [2022-02-20 18:16:34,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560649920] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:34,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278797212] [2022-02-20 18:16:34,581 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 18:16:34,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:34,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:34,584 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:34,612 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:34,642 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 18:16:34,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:16:34,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 18:16:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:35,012 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:35,013 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 := 20; {1001#(<= 20 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:35,013 INFO L272 TraceCheckUtils]: 2: Hoare triple {1001#(<= 20 |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:35,014 INFO L290 TraceCheckUtils]: 3: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:35,014 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:35,014 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:35,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:35,015 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:35,015 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:35,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:35,016 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:35,016 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:35,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:35,017 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:35,017 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:35,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:35,018 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:35,018 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:35,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:35,019 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:35,019 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:35,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:35,020 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:35,020 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:35,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#true} ~x := #in~x; {1223#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:35,021 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:35,021 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:35,022 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:35,023 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:35,023 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:35,024 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:35,024 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:35,025 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:35,026 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:35,026 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:35,026 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:35,027 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:35,028 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:35,028 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:35,029 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:35,029 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:35,030 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:35,030 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:35,031 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:35,031 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:35,032 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:35,032 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:35,033 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:35,034 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1089#(<= |id_#in~x| 7)} {1001#(<= 20 |ULTIMATE.start_main_~input~0#1|)} #25#return; {1000#false} is VALID [2022-02-20 18:16:35,034 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:35,034 INFO L290 TraceCheckUtils]: 50: Hoare triple {1000#false} assume 20 == main_~result~0#1; {1000#false} is VALID [2022-02-20 18:16:35,034 INFO L290 TraceCheckUtils]: 51: Hoare triple {1000#false} assume !false; {1000#false} is VALID [2022-02-20 18:16:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-02-20 18:16:35,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:42,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {1000#false} assume !false; {1000#false} is VALID [2022-02-20 18:16:42,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {1000#false} assume 20 == main_~result~0#1; {1000#false} is VALID [2022-02-20 18:16:42,618 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:42,619 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:42,619 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:42,620 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:42,633 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:42,634 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:42,635 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:42,636 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:42,636 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:42,636 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:42,637 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:42,637 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:42,638 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:42,638 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:42,638 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:42,639 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:42,639 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:42,640 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:42,640 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:42,641 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:42,641 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:42,641 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:42,642 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:42,642 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:42,642 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:42,643 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:42,643 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:42,643 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:42,644 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:42,644 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:42,644 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:42,644 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:42,644 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:42,645 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:42,645 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:42,645 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:42,646 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:42,646 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:42,646 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:42,646 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:42,648 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:42,648 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:42,649 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:42,651 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:42,651 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:42,652 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:42,652 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:42,652 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:42,653 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 := 20; {1378#(< 7 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:42,653 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:42,653 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:42,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278797212] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:42,653 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:42,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 23 [2022-02-20 18:16:42,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395976118] [2022-02-20 18:16:42,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:42,655 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