./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/prefixsum_iter.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/verifythis/prefixsum_iter.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 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:10:36,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:10:37,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:10:37,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:10:37,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:10:37,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:10:37,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:10:37,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:10:37,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:10:37,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:10:37,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:10:37,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:10:37,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:10:37,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:10:37,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:10:37,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:10:37,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:10:37,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:10:37,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:10:37,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:10:37,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:10:37,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:10:37,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:10:37,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:10:37,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:10:37,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:10:37,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:10:37,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:10:37,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:10:37,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:10:37,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:10:37,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:10:37,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:10:37,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:10:37,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:10:37,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:10:37,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:10:37,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:10:37,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:10:37,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:10:37,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:10:37,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:10:37,111 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:10:37,112 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:10:37,112 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:10:37,112 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:10:37,113 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:10:37,113 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:10:37,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:10:37,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:10:37,114 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:10:37,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:10:37,115 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:10:37,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:10:37,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:10:37,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:10:37,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:10:37,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:10:37,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:10:37,116 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:10:37,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:10:37,116 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:10:37,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:10:37,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:10:37,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:10:37,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:10:37,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:10:37,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:10:37,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:10:37,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:10:37,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:10:37,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:10:37,118 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:10:37,118 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:10:37,118 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:10:37,118 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 -> 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d [2022-02-20 17:10:37,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:10:37,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:10:37,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:10:37,330 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:10:37,343 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:10:37,344 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_iter.c [2022-02-20 17:10:37,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4161e474/5eeb38ecaa434d838511ecb8d22e951a/FLAG01184966a [2022-02-20 17:10:37,770 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:10:37,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c [2022-02-20 17:10:37,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4161e474/5eeb38ecaa434d838511ecb8d22e951a/FLAG01184966a [2022-02-20 17:10:37,790 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4161e474/5eeb38ecaa434d838511ecb8d22e951a [2022-02-20 17:10:37,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:10:37,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:10:37,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:10:37,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:10:37,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:10:37,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:10:37" (1/1) ... [2022-02-20 17:10:37,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac40e99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:37, skipping insertion in model container [2022-02-20 17:10:37,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:10:37" (1/1) ... [2022-02-20 17:10:37,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:10:37,818 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:10:37,975 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/verifythis/prefixsum_iter.c[526,539] [2022-02-20 17:10:38,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:10:38,026 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:10:38,043 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/verifythis/prefixsum_iter.c[526,539] [2022-02-20 17:10:38,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:10:38,098 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:10:38,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:38 WrapperNode [2022-02-20 17:10:38,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:10:38,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:10:38,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:10:38,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:10:38,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:38" (1/1) ... [2022-02-20 17:10:38,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:38" (1/1) ... [2022-02-20 17:10:38,145 INFO L137 Inliner]: procedures = 22, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 125 [2022-02-20 17:10:38,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:10:38,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:10:38,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:10:38,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:10:38,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:38" (1/1) ... [2022-02-20 17:10:38,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:38" (1/1) ... [2022-02-20 17:10:38,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:38" (1/1) ... [2022-02-20 17:10:38,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:38" (1/1) ... [2022-02-20 17:10:38,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:38" (1/1) ... [2022-02-20 17:10:38,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:38" (1/1) ... [2022-02-20 17:10:38,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:38" (1/1) ... [2022-02-20 17:10:38,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:10:38,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:10:38,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:10:38,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:10:38,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:38" (1/1) ... [2022-02-20 17:10:38,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:10:38,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:38,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:10:38,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:10:38,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:10:38,250 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:10:38,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:10:38,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:10:38,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 17:10:38,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 17:10:38,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:10:38,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:10:38,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 17:10:38,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 17:10:38,254 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 17:10:38,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 17:10:38,336 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:10:38,337 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:10:38,624 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:10:38,631 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:10:38,634 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-02-20 17:10:38,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:10:38 BoogieIcfgContainer [2022-02-20 17:10:38,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:10:38,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:10:38,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:10:38,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:10:38,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:10:37" (1/3) ... [2022-02-20 17:10:38,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f78a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:10:38, skipping insertion in model container [2022-02-20 17:10:38,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:10:38" (2/3) ... [2022-02-20 17:10:38,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f78a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:10:38, skipping insertion in model container [2022-02-20 17:10:38,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:10:38" (3/3) ... [2022-02-20 17:10:38,643 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2022-02-20 17:10:38,647 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:10:38,647 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:10:38,680 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:10:38,685 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:10:38,685 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:10:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:10:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 17:10:38,703 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:38,704 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:38,704 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:38,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash -750888739, now seen corresponding path program 1 times [2022-02-20 17:10:38,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:38,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27758917] [2022-02-20 17:10:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:38,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:38,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:10:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:38,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#true} ~cond := #in~cond; {45#true} is VALID [2022-02-20 17:10:38,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume 0 == ~cond;assume false; {46#false} is VALID [2022-02-20 17:10:38,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#false} assume true; {46#false} is VALID [2022-02-20 17:10:38,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46#false} {45#true} #129#return; {46#false} is VALID [2022-02-20 17:10:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 17:10:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:38,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#true} ~cond := #in~cond; {45#true} is VALID [2022-02-20 17:10:38,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume 0 == ~cond;assume false; {46#false} is VALID [2022-02-20 17:10:38,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#false} assume true; {46#false} is VALID [2022-02-20 17:10:38,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46#false} {46#false} #131#return; {46#false} is VALID [2022-02-20 17:10:38,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 17:10:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:38,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {45#true} is VALID [2022-02-20 17:10:38,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2022-02-20 17:10:38,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45#true} {46#false} #133#return; {46#false} is VALID [2022-02-20 17:10:38,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 17:10:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:38,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {45#true} is VALID [2022-02-20 17:10:38,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume true; {45#true} is VALID [2022-02-20 17:10:38,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45#true} {46#false} #135#return; {46#false} is VALID [2022-02-20 17:10:38,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#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(17, 2);call #Ultimate.allocInit(12, 3); {45#true} is VALID [2022-02-20 17:10:38,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {45#true} is VALID [2022-02-20 17:10:38,906 INFO L272 TraceCheckUtils]: 2: Hoare triple {45#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {45#true} is VALID [2022-02-20 17:10:38,906 INFO L290 TraceCheckUtils]: 3: Hoare triple {45#true} ~cond := #in~cond; {45#true} is VALID [2022-02-20 17:10:38,907 INFO L290 TraceCheckUtils]: 4: Hoare triple {45#true} assume 0 == ~cond;assume false; {46#false} is VALID [2022-02-20 17:10:38,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#false} assume true; {46#false} is VALID [2022-02-20 17:10:38,907 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {46#false} {45#true} #129#return; {46#false} is VALID [2022-02-20 17:10:38,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#false} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {46#false} is VALID [2022-02-20 17:10:38,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#false} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {46#false} is VALID [2022-02-20 17:10:38,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {46#false} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {46#false} is VALID [2022-02-20 17:10:38,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {46#false} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {46#false} is VALID [2022-02-20 17:10:38,908 INFO L272 TraceCheckUtils]: 11: Hoare triple {46#false} call assume_abort_if_not(main_#t~ret14#1); {45#true} is VALID [2022-02-20 17:10:38,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {45#true} ~cond := #in~cond; {45#true} is VALID [2022-02-20 17:10:38,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {45#true} assume 0 == ~cond;assume false; {46#false} is VALID [2022-02-20 17:10:38,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {46#false} assume true; {46#false} is VALID [2022-02-20 17:10:38,909 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {46#false} {46#false} #131#return; {46#false} is VALID [2022-02-20 17:10:38,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {46#false} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {46#false} is VALID [2022-02-20 17:10:38,909 INFO L272 TraceCheckUtils]: 17: Hoare triple {46#false} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {61#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:10:38,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {61#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {45#true} is VALID [2022-02-20 17:10:38,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {45#true} assume true; {45#true} is VALID [2022-02-20 17:10:38,910 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {45#true} {46#false} #133#return; {46#false} is VALID [2022-02-20 17:10:38,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {46#false} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {46#false} is VALID [2022-02-20 17:10:38,910 INFO L272 TraceCheckUtils]: 22: Hoare triple {46#false} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {61#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:10:38,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {61#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {45#true} is VALID [2022-02-20 17:10:38,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {45#true} assume true; {45#true} is VALID [2022-02-20 17:10:38,911 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {45#true} {46#false} #135#return; {46#false} is VALID [2022-02-20 17:10:38,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {46#false} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {46#false} is VALID [2022-02-20 17:10:38,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 17:10:38,912 INFO L290 TraceCheckUtils]: 28: Hoare triple {46#false} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {46#false} is VALID [2022-02-20 17:10:38,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {46#false} assume !(upsweep_~space~0#1 < upsweep_~n#1); {46#false} is VALID [2022-02-20 17:10:38,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {46#false} upsweep_#res#1 := upsweep_~space~0#1; {46#false} is VALID [2022-02-20 17:10:38,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {46#false} main_#t~ret19#1 := upsweep_#res#1;assume { :end_inline_upsweep } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647;main_~space~1#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_downsweep } true;downsweep_#in~a#1.base, downsweep_#in~a#1.offset, downsweep_#in~n#1, downsweep_#in~space#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~space~1#1;havoc downsweep_#t~mem7#1, downsweep_#t~mem8#1, downsweep_#t~mem9#1, downsweep_~left~1#1, downsweep_~temp~0#1, downsweep_~right~1#1, downsweep_~a#1.base, downsweep_~a#1.offset, downsweep_~n#1, downsweep_~space#1;downsweep_~a#1.base, downsweep_~a#1.offset := downsweep_#in~a#1.base, downsweep_#in~a#1.offset;downsweep_~n#1 := downsweep_#in~n#1;downsweep_~space#1 := downsweep_#in~space#1;call write~int(0, downsweep_~a#1.base, downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1), 4);downsweep_~space#1 := (if downsweep_~space#1 < 0 && 0 != downsweep_~space#1 % 2 then 1 + downsweep_~space#1 / 2 else downsweep_~space#1 / 2); {46#false} is VALID [2022-02-20 17:10:38,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {46#false} assume !(downsweep_~space#1 > 0); {46#false} is VALID [2022-02-20 17:10:38,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {46#false} assume { :end_inline_downsweep } true;assume { :begin_inline_check } true;check_#in~a0#1.base, check_#in~a0#1.offset, check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1 := main_~a0~0#1.base, main_~a0~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc check_#t~mem11#1, check_#t~mem12#1, check_#t~post10#1, check_~a0#1.base, check_~a0#1.offset, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~i~0#1, check_~sum~0#1;check_~a0#1.base, check_~a0#1.offset := check_#in~a0#1.base, check_#in~a0#1.offset;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;havoc check_~i~0#1;check_~sum~0#1 := 0;check_~i~0#1 := 0; {46#false} is VALID [2022-02-20 17:10:38,913 INFO L290 TraceCheckUtils]: 34: Hoare triple {46#false} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {46#false} is VALID [2022-02-20 17:10:38,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {46#false} assume 0 == __VERIFIER_assert_~cond#1; {46#false} is VALID [2022-02-20 17:10:38,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-02-20 17:10:38,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 17:10:38,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:38,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27758917] [2022-02-20 17:10:38,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27758917] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:10:38,915 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:10:38,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:10:38,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767952746] [2022-02-20 17:10:38,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:10:38,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-02-20 17:10:38,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:38,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:10:38,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:38,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:10:38,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:38,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:10:38,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:10:38,971 INFO L87 Difference]: Start difference. First operand has 42 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:10:41,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:41,256 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2022-02-20 17:10:41,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:10:41,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-02-20 17:10:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:10:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2022-02-20 17:10:41,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:10:41,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2022-02-20 17:10:41,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2022-02-20 17:10:41,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:41,369 INFO L225 Difference]: With dead ends: 81 [2022-02-20 17:10:41,369 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 17:10:41,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:10:41,373 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:41,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:10:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 17:10:41,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 17:10:41,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:41,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:10:41,394 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:10:41,395 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:10:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:41,398 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-02-20 17:10:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-02-20 17:10:41,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:41,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:41,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 38 states. [2022-02-20 17:10:41,400 INFO L87 Difference]: Start difference. First operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 38 states. [2022-02-20 17:10:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:41,402 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-02-20 17:10:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-02-20 17:10:41,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:41,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:41,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:41,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:10:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-02-20 17:10:41,406 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2022-02-20 17:10:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:41,407 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-02-20 17:10:41,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:10:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-02-20 17:10:41,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 17:10:41,408 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:41,408 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:41,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:10:41,409 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:41,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:41,409 INFO L85 PathProgramCache]: Analyzing trace with hash 221792227, now seen corresponding path program 1 times [2022-02-20 17:10:41,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:41,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972678795] [2022-02-20 17:10:41,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:41,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:41,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:10:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:41,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {305#true} ~cond := #in~cond; {305#true} is VALID [2022-02-20 17:10:41,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#true} assume !(0 == ~cond); {305#true} is VALID [2022-02-20 17:10:41,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#true} assume true; {305#true} is VALID [2022-02-20 17:10:41,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} #129#return; {305#true} is VALID [2022-02-20 17:10:41,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 17:10:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:41,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {305#true} ~cond := #in~cond; {305#true} is VALID [2022-02-20 17:10:41,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#true} assume !(0 == ~cond); {305#true} is VALID [2022-02-20 17:10:41,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {305#true} assume true; {305#true} is VALID [2022-02-20 17:10:41,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} #131#return; {305#true} is VALID [2022-02-20 17:10:41,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 17:10:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:41,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {325#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {305#true} is VALID [2022-02-20 17:10:41,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#true} assume true; {305#true} is VALID [2022-02-20 17:10:41,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {305#true} {305#true} #133#return; {305#true} is VALID [2022-02-20 17:10:41,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 17:10:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:41,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {325#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {305#true} is VALID [2022-02-20 17:10:41,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#true} assume true; {305#true} is VALID [2022-02-20 17:10:41,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {305#true} {305#true} #135#return; {305#true} is VALID [2022-02-20 17:10:41,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {305#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(17, 2);call #Ultimate.allocInit(12, 3); {305#true} is VALID [2022-02-20 17:10:41,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {305#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {305#true} is VALID [2022-02-20 17:10:41,564 INFO L272 TraceCheckUtils]: 2: Hoare triple {305#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {305#true} is VALID [2022-02-20 17:10:41,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {305#true} ~cond := #in~cond; {305#true} is VALID [2022-02-20 17:10:41,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {305#true} assume !(0 == ~cond); {305#true} is VALID [2022-02-20 17:10:41,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#true} assume true; {305#true} is VALID [2022-02-20 17:10:41,565 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {305#true} {305#true} #129#return; {305#true} is VALID [2022-02-20 17:10:41,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {305#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {311#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:10:41,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {311#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {311#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:10:41,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {311#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {305#true} is VALID [2022-02-20 17:10:41,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {305#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {305#true} is VALID [2022-02-20 17:10:41,566 INFO L272 TraceCheckUtils]: 11: Hoare triple {305#true} call assume_abort_if_not(main_#t~ret14#1); {305#true} is VALID [2022-02-20 17:10:41,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#true} ~cond := #in~cond; {305#true} is VALID [2022-02-20 17:10:41,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#true} assume !(0 == ~cond); {305#true} is VALID [2022-02-20 17:10:41,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#true} assume true; {305#true} is VALID [2022-02-20 17:10:41,567 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {305#true} {305#true} #131#return; {305#true} is VALID [2022-02-20 17:10:41,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {305#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {305#true} is VALID [2022-02-20 17:10:41,568 INFO L272 TraceCheckUtils]: 17: Hoare triple {305#true} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {325#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:10:41,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {325#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {305#true} is VALID [2022-02-20 17:10:41,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {305#true} assume true; {305#true} is VALID [2022-02-20 17:10:41,569 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {305#true} {305#true} #133#return; {305#true} is VALID [2022-02-20 17:10:41,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {305#true} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {305#true} is VALID [2022-02-20 17:10:41,570 INFO L272 TraceCheckUtils]: 22: Hoare triple {305#true} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {325#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:10:41,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {325#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {305#true} is VALID [2022-02-20 17:10:41,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {305#true} assume true; {305#true} is VALID [2022-02-20 17:10:41,571 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {305#true} {305#true} #135#return; {305#true} is VALID [2022-02-20 17:10:41,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {305#true} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {322#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:10:41,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {322#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(main_~i~1#1 < main_~n~0#1); {323#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 17:10:41,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {323#(<= |ULTIMATE.start_main_~n~0#1| 0)} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {323#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 17:10:41,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {323#(<= |ULTIMATE.start_main_~n~0#1| 0)} assume !(upsweep_~space~0#1 < upsweep_~n#1); {323#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 17:10:41,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {323#(<= |ULTIMATE.start_main_~n~0#1| 0)} upsweep_#res#1 := upsweep_~space~0#1; {323#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 17:10:41,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {323#(<= |ULTIMATE.start_main_~n~0#1| 0)} main_#t~ret19#1 := upsweep_#res#1;assume { :end_inline_upsweep } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647;main_~space~1#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_downsweep } true;downsweep_#in~a#1.base, downsweep_#in~a#1.offset, downsweep_#in~n#1, downsweep_#in~space#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~space~1#1;havoc downsweep_#t~mem7#1, downsweep_#t~mem8#1, downsweep_#t~mem9#1, downsweep_~left~1#1, downsweep_~temp~0#1, downsweep_~right~1#1, downsweep_~a#1.base, downsweep_~a#1.offset, downsweep_~n#1, downsweep_~space#1;downsweep_~a#1.base, downsweep_~a#1.offset := downsweep_#in~a#1.base, downsweep_#in~a#1.offset;downsweep_~n#1 := downsweep_#in~n#1;downsweep_~space#1 := downsweep_#in~space#1;call write~int(0, downsweep_~a#1.base, downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1), 4);downsweep_~space#1 := (if downsweep_~space#1 < 0 && 0 != downsweep_~space#1 % 2 then 1 + downsweep_~space#1 / 2 else downsweep_~space#1 / 2); {323#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 17:10:41,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {323#(<= |ULTIMATE.start_main_~n~0#1| 0)} assume !(downsweep_~space#1 > 0); {323#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 17:10:41,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {323#(<= |ULTIMATE.start_main_~n~0#1| 0)} assume { :end_inline_downsweep } true;assume { :begin_inline_check } true;check_#in~a0#1.base, check_#in~a0#1.offset, check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1 := main_~a0~0#1.base, main_~a0~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc check_#t~mem11#1, check_#t~mem12#1, check_#t~post10#1, check_~a0#1.base, check_~a0#1.offset, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~i~0#1, check_~sum~0#1;check_~a0#1.base, check_~a0#1.offset := check_#in~a0#1.base, check_#in~a0#1.offset;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;havoc check_~i~0#1;check_~sum~0#1 := 0;check_~i~0#1 := 0; {324#(and (= |ULTIMATE.start_check_~i~0#1| 0) (<= |ULTIMATE.start_check_~n#1| 0))} is VALID [2022-02-20 17:10:41,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {324#(and (= |ULTIMATE.start_check_~i~0#1| 0) (<= |ULTIMATE.start_check_~n#1| 0))} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {306#false} is VALID [2022-02-20 17:10:41,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {306#false} assume 0 == __VERIFIER_assert_~cond#1; {306#false} is VALID [2022-02-20 17:10:41,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {306#false} assume !false; {306#false} is VALID [2022-02-20 17:10:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 17:10:41,577 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:41,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972678795] [2022-02-20 17:10:41,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972678795] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:10:41,577 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:10:41,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 17:10:41,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858162178] [2022-02-20 17:10:41,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:10:41,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-02-20 17:10:41,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:41,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:10:41,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:41,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:10:41,623 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:41,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:10:41,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:10:41,624 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:10:43,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:10:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:44,301 INFO L93 Difference]: Finished difference Result 97 states and 124 transitions. [2022-02-20 17:10:44,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:10:44,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-02-20 17:10:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:44,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:10:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2022-02-20 17:10:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:10:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2022-02-20 17:10:44,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 124 transitions. [2022-02-20 17:10:44,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:44,404 INFO L225 Difference]: With dead ends: 97 [2022-02-20 17:10:44,404 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 17:10:44,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:10:44,405 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 97 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:44,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 188 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 17:10:44,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 17:10:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2022-02-20 17:10:44,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:44,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:10:44,410 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:10:44,410 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:10:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:44,413 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2022-02-20 17:10:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2022-02-20 17:10:44,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:44,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:44,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 69 states. [2022-02-20 17:10:44,414 INFO L87 Difference]: Start difference. First operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 69 states. [2022-02-20 17:10:44,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:44,416 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2022-02-20 17:10:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2022-02-20 17:10:44,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:44,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:44,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:44,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:10:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-02-20 17:10:44,419 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 37 [2022-02-20 17:10:44,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:44,419 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-02-20 17:10:44,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:10:44,420 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-02-20 17:10:44,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 17:10:44,420 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:44,421 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:44,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:10:44,421 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:44,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:44,421 INFO L85 PathProgramCache]: Analyzing trace with hash 747513669, now seen corresponding path program 1 times [2022-02-20 17:10:44,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:44,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494782658] [2022-02-20 17:10:44,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:44,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:44,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:10:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:44,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-02-20 17:10:44,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-02-20 17:10:44,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} assume true; {670#true} is VALID [2022-02-20 17:10:44,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} #129#return; {670#true} is VALID [2022-02-20 17:10:44,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 17:10:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:44,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-02-20 17:10:44,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-02-20 17:10:44,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} assume true; {670#true} is VALID [2022-02-20 17:10:44,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} #131#return; {670#true} is VALID [2022-02-20 17:10:44,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 17:10:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:44,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {692#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {693#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-02-20 17:10:44,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {693#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-02-20 17:10:44,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {693#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {680#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} #133#return; {684#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1))} is VALID [2022-02-20 17:10:44,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 17:10:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:44,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {692#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {694#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-02-20 17:10:44,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {694#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {694#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-02-20 17:10:44,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {694#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {685#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} #135#return; {685#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 17:10:44,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {670#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(17, 2);call #Ultimate.allocInit(12, 3); {670#true} is VALID [2022-02-20 17:10:44,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {670#true} is VALID [2022-02-20 17:10:44,699 INFO L272 TraceCheckUtils]: 2: Hoare triple {670#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {670#true} is VALID [2022-02-20 17:10:44,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-02-20 17:10:44,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-02-20 17:10:44,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} assume true; {670#true} is VALID [2022-02-20 17:10:44,699 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {670#true} {670#true} #129#return; {670#true} is VALID [2022-02-20 17:10:44,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {670#true} is VALID [2022-02-20 17:10:44,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {670#true} is VALID [2022-02-20 17:10:44,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {670#true} is VALID [2022-02-20 17:10:44,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {670#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {670#true} is VALID [2022-02-20 17:10:44,700 INFO L272 TraceCheckUtils]: 11: Hoare triple {670#true} call assume_abort_if_not(main_#t~ret14#1); {670#true} is VALID [2022-02-20 17:10:44,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-02-20 17:10:44,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-02-20 17:10:44,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} assume true; {670#true} is VALID [2022-02-20 17:10:44,701 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {670#true} {670#true} #131#return; {670#true} is VALID [2022-02-20 17:10:44,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {680#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} is VALID [2022-02-20 17:10:44,702 INFO L272 TraceCheckUtils]: 17: Hoare triple {680#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {692#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:10:44,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {692#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {693#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-02-20 17:10:44,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {693#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {693#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-02-20 17:10:44,704 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {693#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {680#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} #133#return; {684#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1))} is VALID [2022-02-20 17:10:44,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {684#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1))} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {685#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 17:10:44,705 INFO L272 TraceCheckUtils]: 22: Hoare triple {685#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {692#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:10:44,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {692#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {694#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-02-20 17:10:44,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {694#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {694#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-02-20 17:10:44,707 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {694#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {685#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} #135#return; {685#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 17:10:44,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {685#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 17:10:44,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem18#1; {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 17:10:44,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 17:10:44,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !(main_~i~1#1 < main_~n~0#1); {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 17:10:44,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 17:10:44,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !(upsweep_~space~0#1 < upsweep_~n#1); {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 17:10:44,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} upsweep_#res#1 := upsweep_~space~0#1; {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 17:10:44,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_#t~ret19#1 := upsweep_#res#1;assume { :end_inline_upsweep } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647;main_~space~1#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_downsweep } true;downsweep_#in~a#1.base, downsweep_#in~a#1.offset, downsweep_#in~n#1, downsweep_#in~space#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~space~1#1;havoc downsweep_#t~mem7#1, downsweep_#t~mem8#1, downsweep_#t~mem9#1, downsweep_~left~1#1, downsweep_~temp~0#1, downsweep_~right~1#1, downsweep_~a#1.base, downsweep_~a#1.offset, downsweep_~n#1, downsweep_~space#1;downsweep_~a#1.base, downsweep_~a#1.offset := downsweep_#in~a#1.base, downsweep_#in~a#1.offset;downsweep_~n#1 := downsweep_#in~n#1;downsweep_~space#1 := downsweep_#in~space#1;call write~int(0, downsweep_~a#1.base, downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1), 4);downsweep_~space#1 := (if downsweep_~space#1 < 0 && 0 != downsweep_~space#1 % 2 then 1 + downsweep_~space#1 / 2 else downsweep_~space#1 / 2); {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 17:10:44,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !(downsweep_~space#1 > 0); {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 17:10:44,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume { :end_inline_downsweep } true;assume { :begin_inline_check } true;check_#in~a0#1.base, check_#in~a0#1.offset, check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1 := main_~a0~0#1.base, main_~a0~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc check_#t~mem11#1, check_#t~mem12#1, check_#t~post10#1, check_~a0#1.base, check_~a0#1.offset, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~i~0#1, check_~sum~0#1;check_~a0#1.base, check_~a0#1.offset := check_#in~a0#1.base, check_#in~a0#1.offset;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;havoc check_~i~0#1;check_~sum~0#1 := 0;check_~i~0#1 := 0; {690#(= |ULTIMATE.start_check_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_check_~a#1.base|) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4))))} is VALID [2022-02-20 17:10:44,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {690#(= |ULTIMATE.start_check_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_check_~a#1.base|) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4))))} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {691#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:10:44,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {691#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {671#false} is VALID [2022-02-20 17:10:44,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {671#false} assume !false; {671#false} is VALID [2022-02-20 17:10:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:10:44,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:44,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494782658] [2022-02-20 17:10:44,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494782658] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:10:44,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270300181] [2022-02-20 17:10:44,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:44,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:44,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:44,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:10:44,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:10:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:44,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-20 17:10:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:44,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:10:44,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 17:10:44,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-02-20 17:10:45,019 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 17:10:45,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 17:10:45,046 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_45 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_45))) is different from true [2022-02-20 17:10:45,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-02-20 17:10:45,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-02-20 17:10:45,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-02-20 17:10:45,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-02-20 17:10:45,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {670#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(17, 2);call #Ultimate.allocInit(12, 3); {670#true} is VALID [2022-02-20 17:10:45,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {670#true} is VALID [2022-02-20 17:10:45,288 INFO L272 TraceCheckUtils]: 2: Hoare triple {670#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {670#true} is VALID [2022-02-20 17:10:45,289 INFO L290 TraceCheckUtils]: 3: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-02-20 17:10:45,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-02-20 17:10:45,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} assume true; {670#true} is VALID [2022-02-20 17:10:45,289 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {670#true} {670#true} #129#return; {670#true} is VALID [2022-02-20 17:10:45,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {670#true} is VALID [2022-02-20 17:10:45,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {670#true} is VALID [2022-02-20 17:10:45,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#true} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {670#true} is VALID [2022-02-20 17:10:45,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {670#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {670#true} is VALID [2022-02-20 17:10:45,290 INFO L272 TraceCheckUtils]: 11: Hoare triple {670#true} call assume_abort_if_not(main_#t~ret14#1); {670#true} is VALID [2022-02-20 17:10:45,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-02-20 17:10:45,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-02-20 17:10:45,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#true} assume true; {670#true} is VALID [2022-02-20 17:10:45,290 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {670#true} {670#true} #131#return; {670#true} is VALID [2022-02-20 17:10:45,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {680#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} is VALID [2022-02-20 17:10:45,292 INFO L272 TraceCheckUtils]: 17: Hoare triple {680#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {749#(exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1|) 1))} is VALID [2022-02-20 17:10:45,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {749#(exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1|) 1))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {753#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1|) 1)))} is VALID [2022-02-20 17:10:45,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {753#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1|) 1)))} assume true; {753#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1|) 1)))} is VALID [2022-02-20 17:10:45,295 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {753#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (exists ((|v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1| Int)) (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc15#1.base_BEFORE_CALL_1|) 1)))} {680#(= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1)} #133#return; {684#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1))} is VALID [2022-02-20 17:10:45,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {684#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_#t~malloc15#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc15#1.base|) 1))} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {685#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 17:10:45,297 INFO L272 TraceCheckUtils]: 22: Hoare triple {685#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {692#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:10:45,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {692#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {769#(exists ((v_ArrVal_45 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| v_ArrVal_45)))} is VALID [2022-02-20 17:10:45,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {769#(exists ((v_ArrVal_45 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| v_ArrVal_45)))} assume true; {769#(exists ((v_ArrVal_45 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| v_ArrVal_45)))} is VALID [2022-02-20 17:10:45,299 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {769#(exists ((v_ArrVal_45 (Array Int Int))) (= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| v_ArrVal_45)))} {685#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} #135#return; {685#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 17:10:45,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {685#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc16#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 17:10:45,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {689#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~a0~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem18#1; {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} is VALID [2022-02-20 17:10:45,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} is VALID [2022-02-20 17:10:45,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} assume !(main_~i~1#1 < main_~n~0#1); {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} is VALID [2022-02-20 17:10:45,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} is VALID [2022-02-20 17:10:45,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} assume !(upsweep_~space~0#1 < upsweep_~n#1); {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} is VALID [2022-02-20 17:10:45,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} upsweep_#res#1 := upsweep_~space~0#1; {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} is VALID [2022-02-20 17:10:45,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} main_#t~ret19#1 := upsweep_#res#1;assume { :end_inline_upsweep } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647;main_~space~1#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_downsweep } true;downsweep_#in~a#1.base, downsweep_#in~a#1.offset, downsweep_#in~n#1, downsweep_#in~space#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~space~1#1;havoc downsweep_#t~mem7#1, downsweep_#t~mem8#1, downsweep_#t~mem9#1, downsweep_~left~1#1, downsweep_~temp~0#1, downsweep_~right~1#1, downsweep_~a#1.base, downsweep_~a#1.offset, downsweep_~n#1, downsweep_~space#1;downsweep_~a#1.base, downsweep_~a#1.offset := downsweep_#in~a#1.base, downsweep_#in~a#1.offset;downsweep_~n#1 := downsweep_#in~n#1;downsweep_~space#1 := downsweep_#in~space#1;call write~int(0, downsweep_~a#1.base, downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1), 4);downsweep_~space#1 := (if downsweep_~space#1 < 0 && 0 != downsweep_~space#1 % 2 then 1 + downsweep_~space#1 / 2 else downsweep_~space#1 / 2); {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} is VALID [2022-02-20 17:10:45,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} assume !(downsweep_~space#1 > 0); {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} is VALID [2022-02-20 17:10:45,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {782#(= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|))} assume { :end_inline_downsweep } true;assume { :begin_inline_check } true;check_#in~a0#1.base, check_#in~a0#1.offset, check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1 := main_~a0~0#1.base, main_~a0~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc check_#t~mem11#1, check_#t~mem12#1, check_#t~post10#1, check_~a0#1.base, check_~a0#1.offset, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~i~0#1, check_~sum~0#1;check_~a0#1.base, check_~a0#1.offset := check_#in~a0#1.base, check_#in~a0#1.offset;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;havoc check_~i~0#1;check_~sum~0#1 := 0;check_~i~0#1 := 0; {807#(and (= |ULTIMATE.start_check_~sum~0#1| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)))} is VALID [2022-02-20 17:10:45,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {807#(and (= |ULTIMATE.start_check_~sum~0#1| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_check_~a#1.base|)))} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {811#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 17:10:45,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {811#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {671#false} is VALID [2022-02-20 17:10:45,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {671#false} assume !false; {671#false} is VALID [2022-02-20 17:10:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-02-20 17:10:45,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:11:08,170 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_check_~a#1.offset| Int) (|v_ULTIMATE.start_downsweep_~a#1.offset_4| Int) (|v_ULTIMATE.start_downsweep_~n#1_5| Int) (|ULTIMATE.start_check_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (- 4) |v_ULTIMATE.start_downsweep_~a#1.offset_4| (* |v_ULTIMATE.start_downsweep_~n#1_5| 4)) 0) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4))) 0)) is different from false [2022-02-20 17:11:08,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_check_~a#1.offset| Int) (|v_ULTIMATE.start_downsweep_~a#1.offset_4| Int) (|v_ULTIMATE.start_downsweep_~n#1_5| Int) (v_ArrVal_46 (Array Int Int)) (|ULTIMATE.start_check_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a0~0#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (- 4) |v_ULTIMATE.start_downsweep_~a#1.offset_4| (* |v_ULTIMATE.start_downsweep_~n#1_5| 4)) 0) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4))) 0)) is different from false [2022-02-20 17:11:08,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_check_~a#1.offset| Int) (|v_ULTIMATE.start_downsweep_~a#1.offset_4| Int) (|v_ULTIMATE.start_downsweep_~n#1_5| Int) (v_ArrVal_46 (Array Int Int)) (|ULTIMATE.start_check_~i~0#1| Int)) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~malloc16#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (- 4) |v_ULTIMATE.start_downsweep_~a#1.offset_4| (* |v_ULTIMATE.start_downsweep_~n#1_5| 4)) 0) (+ |ULTIMATE.start_check_~a#1.offset| (* |ULTIMATE.start_check_~i~0#1| 4))))) is different from false [2022-02-20 17:11:08,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270300181] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:11:08,626 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:11:08,626 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 17 [2022-02-20 17:11:08,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108634719] [2022-02-20 17:11:08,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:11:08,627 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-02-20 17:11:08,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:11:08,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 17:11:08,668 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 17:11:08,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 17:11:08,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:11:08,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 17:11:08,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=251, Unknown=15, NotChecked=140, Total=462 [2022-02-20 17:11:08,670 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 17:11:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:11:36,238 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-02-20 17:11:36,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 17:11:36,238 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-02-20 17:11:36,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:11:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 17:11:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2022-02-20 17:11:36,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 17:11:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2022-02-20 17:11:36,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 55 transitions. [2022-02-20 17:11:36,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:11:36,292 INFO L225 Difference]: With dead ends: 49 [2022-02-20 17:11:36,292 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 17:11:36,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=121, Invalid=525, Unknown=20, NotChecked=204, Total=870 [2022-02-20 17:11:36,293 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 51 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:11:36,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 206 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 123 Invalid, 0 Unknown, 71 Unchecked, 0.1s Time] [2022-02-20 17:11:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 17:11:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2022-02-20 17:11:36,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:11:36,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 44 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:36,298 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 44 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:36,298 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 44 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:11:36,300 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-02-20 17:11:36,300 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-02-20 17:11:36,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:11:36,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:11:36,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-02-20 17:11:36,301 INFO L87 Difference]: Start difference. First operand has 44 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-02-20 17:11:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:11:36,302 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-02-20 17:11:36,303 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-02-20 17:11:36,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:11:36,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:11:36,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:11:36,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:11:36,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:36,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-02-20 17:11:36,305 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 39 [2022-02-20 17:11:36,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:11:36,305 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-02-20 17:11:36,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 17:11:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-02-20 17:11:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 17:11:36,306 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:11:36,306 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:11:36,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:11:36,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:11:36,523 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:11:36,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:11:36,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1715230204, now seen corresponding path program 1 times [2022-02-20 17:11:36,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:11:36,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081078534] [2022-02-20 17:11:36,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:11:36,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:11:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:36,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:11:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:36,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {1105#true} ~cond := #in~cond; {1105#true} is VALID [2022-02-20 17:11:36,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#true} assume !(0 == ~cond); {1105#true} is VALID [2022-02-20 17:11:36,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:36,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1105#true} {1105#true} #129#return; {1105#true} is VALID [2022-02-20 17:11:36,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 17:11:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:36,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {1105#true} ~cond := #in~cond; {1105#true} is VALID [2022-02-20 17:11:36,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#true} assume !(0 == ~cond); {1105#true} is VALID [2022-02-20 17:11:36,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:36,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1105#true} {1105#true} #131#return; {1105#true} is VALID [2022-02-20 17:11:36,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 17:11:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:36,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {1127#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1105#true} is VALID [2022-02-20 17:11:36,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:36,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1105#true} {1105#true} #133#return; {1105#true} is VALID [2022-02-20 17:11:36,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 17:11:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:36,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {1127#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1105#true} is VALID [2022-02-20 17:11:36,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:36,673 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1105#true} {1105#true} #135#return; {1105#true} is VALID [2022-02-20 17:11:36,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {1105#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(17, 2);call #Ultimate.allocInit(12, 3); {1105#true} is VALID [2022-02-20 17:11:36,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1105#true} is VALID [2022-02-20 17:11:36,673 INFO L272 TraceCheckUtils]: 2: Hoare triple {1105#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {1105#true} is VALID [2022-02-20 17:11:36,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {1105#true} ~cond := #in~cond; {1105#true} is VALID [2022-02-20 17:11:36,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {1105#true} assume !(0 == ~cond); {1105#true} is VALID [2022-02-20 17:11:36,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:36,674 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1105#true} {1105#true} #129#return; {1105#true} is VALID [2022-02-20 17:11:36,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {1105#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {1111#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:11:36,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {1111#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {1111#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:11:36,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {1111#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {1105#true} is VALID [2022-02-20 17:11:36,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {1105#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {1105#true} is VALID [2022-02-20 17:11:36,675 INFO L272 TraceCheckUtils]: 11: Hoare triple {1105#true} call assume_abort_if_not(main_#t~ret14#1); {1105#true} is VALID [2022-02-20 17:11:36,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {1105#true} ~cond := #in~cond; {1105#true} is VALID [2022-02-20 17:11:36,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {1105#true} assume !(0 == ~cond); {1105#true} is VALID [2022-02-20 17:11:36,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:36,676 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1105#true} {1105#true} #131#return; {1105#true} is VALID [2022-02-20 17:11:36,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {1105#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {1105#true} is VALID [2022-02-20 17:11:36,677 INFO L272 TraceCheckUtils]: 17: Hoare triple {1105#true} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {1127#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:11:36,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {1127#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1105#true} is VALID [2022-02-20 17:11:36,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:36,677 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1105#true} {1105#true} #133#return; {1105#true} is VALID [2022-02-20 17:11:36,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {1105#true} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {1105#true} is VALID [2022-02-20 17:11:36,678 INFO L272 TraceCheckUtils]: 22: Hoare triple {1105#true} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {1127#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:11:36,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {1127#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1105#true} is VALID [2022-02-20 17:11:36,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:36,678 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1105#true} {1105#true} #135#return; {1105#true} is VALID [2022-02-20 17:11:36,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {1105#true} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {1122#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:11:36,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {1122#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem18#1; {1122#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:11:36,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {1122#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1123#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 17:11:36,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {1123#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < main_~n~0#1); {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:36,680 INFO L290 TraceCheckUtils]: 30: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:36,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !(upsweep_~space~0#1 < upsweep_~n#1); {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:36,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} upsweep_#res#1 := upsweep_~space~0#1; {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:36,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} main_#t~ret19#1 := upsweep_#res#1;assume { :end_inline_upsweep } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647;main_~space~1#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_downsweep } true;downsweep_#in~a#1.base, downsweep_#in~a#1.offset, downsweep_#in~n#1, downsweep_#in~space#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~space~1#1;havoc downsweep_#t~mem7#1, downsweep_#t~mem8#1, downsweep_#t~mem9#1, downsweep_~left~1#1, downsweep_~temp~0#1, downsweep_~right~1#1, downsweep_~a#1.base, downsweep_~a#1.offset, downsweep_~n#1, downsweep_~space#1;downsweep_~a#1.base, downsweep_~a#1.offset := downsweep_#in~a#1.base, downsweep_#in~a#1.offset;downsweep_~n#1 := downsweep_#in~n#1;downsweep_~space#1 := downsweep_#in~space#1;call write~int(0, downsweep_~a#1.base, downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1), 4);downsweep_~space#1 := (if downsweep_~space#1 < 0 && 0 != downsweep_~space#1 % 2 then 1 + downsweep_~space#1 / 2 else downsweep_~space#1 / 2); {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:36,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !(downsweep_~space#1 > 0); {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:36,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume { :end_inline_downsweep } true;assume { :begin_inline_check } true;check_#in~a0#1.base, check_#in~a0#1.offset, check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1 := main_~a0~0#1.base, main_~a0~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc check_#t~mem11#1, check_#t~mem12#1, check_#t~post10#1, check_~a0#1.base, check_~a0#1.offset, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~i~0#1, check_~sum~0#1;check_~a0#1.base, check_~a0#1.offset := check_#in~a0#1.base, check_#in~a0#1.offset;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;havoc check_~i~0#1;check_~sum~0#1 := 0;check_~i~0#1 := 0; {1125#(and (<= |ULTIMATE.start_check_~n#1| 1) (= |ULTIMATE.start_check_~i~0#1| 0))} is VALID [2022-02-20 17:11:36,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {1125#(and (<= |ULTIMATE.start_check_~n#1| 1) (= |ULTIMATE.start_check_~i~0#1| 0))} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1125#(and (<= |ULTIMATE.start_check_~n#1| 1) (= |ULTIMATE.start_check_~i~0#1| 0))} is VALID [2022-02-20 17:11:36,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {1125#(and (<= |ULTIMATE.start_check_~n#1| 1) (= |ULTIMATE.start_check_~i~0#1| 0))} assume !(0 == __VERIFIER_assert_~cond#1); {1125#(and (<= |ULTIMATE.start_check_~n#1| 1) (= |ULTIMATE.start_check_~i~0#1| 0))} is VALID [2022-02-20 17:11:36,688 INFO L290 TraceCheckUtils]: 38: Hoare triple {1125#(and (<= |ULTIMATE.start_check_~n#1| 1) (= |ULTIMATE.start_check_~i~0#1| 0))} assume { :end_inline___VERIFIER_assert } true;havoc check_#t~mem11#1;call check_#t~mem12#1 := read~int(check_~a0#1.base, check_~a0#1.offset + 4 * check_~i~0#1, 4);check_~sum~0#1 := check_~sum~0#1 + check_#t~mem12#1;havoc check_#t~mem12#1; {1125#(and (<= |ULTIMATE.start_check_~n#1| 1) (= |ULTIMATE.start_check_~i~0#1| 0))} is VALID [2022-02-20 17:11:36,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {1125#(and (<= |ULTIMATE.start_check_~n#1| 1) (= |ULTIMATE.start_check_~i~0#1| 0))} check_#t~post10#1 := check_~i~0#1;check_~i~0#1 := 1 + check_#t~post10#1;havoc check_#t~post10#1; {1126#(<= |ULTIMATE.start_check_~n#1| |ULTIMATE.start_check_~i~0#1|)} is VALID [2022-02-20 17:11:36,689 INFO L290 TraceCheckUtils]: 40: Hoare triple {1126#(<= |ULTIMATE.start_check_~n#1| |ULTIMATE.start_check_~i~0#1|)} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1106#false} is VALID [2022-02-20 17:11:36,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {1106#false} assume 0 == __VERIFIER_assert_~cond#1; {1106#false} is VALID [2022-02-20 17:11:36,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {1106#false} assume !false; {1106#false} is VALID [2022-02-20 17:11:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 17:11:36,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:11:36,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081078534] [2022-02-20 17:11:36,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081078534] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:11:36,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108043090] [2022-02-20 17:11:36,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:11:36,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:11:36,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:11:36,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:11:36,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:11:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:36,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 17:11:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:36,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:11:37,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {1105#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(17, 2);call #Ultimate.allocInit(12, 3); {1105#true} is VALID [2022-02-20 17:11:37,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1105#true} is VALID [2022-02-20 17:11:37,027 INFO L272 TraceCheckUtils]: 2: Hoare triple {1105#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {1105#true} is VALID [2022-02-20 17:11:37,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {1105#true} ~cond := #in~cond; {1105#true} is VALID [2022-02-20 17:11:37,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {1105#true} assume !(0 == ~cond); {1105#true} is VALID [2022-02-20 17:11:37,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:37,027 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1105#true} {1105#true} #129#return; {1105#true} is VALID [2022-02-20 17:11:37,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {1105#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {1105#true} is VALID [2022-02-20 17:11:37,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {1105#true} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {1105#true} is VALID [2022-02-20 17:11:37,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {1105#true} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {1105#true} is VALID [2022-02-20 17:11:37,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {1105#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {1105#true} is VALID [2022-02-20 17:11:37,028 INFO L272 TraceCheckUtils]: 11: Hoare triple {1105#true} call assume_abort_if_not(main_#t~ret14#1); {1105#true} is VALID [2022-02-20 17:11:37,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {1105#true} ~cond := #in~cond; {1105#true} is VALID [2022-02-20 17:11:37,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {1105#true} assume !(0 == ~cond); {1105#true} is VALID [2022-02-20 17:11:37,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:37,029 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1105#true} {1105#true} #131#return; {1105#true} is VALID [2022-02-20 17:11:37,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {1105#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {1105#true} is VALID [2022-02-20 17:11:37,029 INFO L272 TraceCheckUtils]: 17: Hoare triple {1105#true} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {1105#true} is VALID [2022-02-20 17:11:37,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {1105#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1105#true} is VALID [2022-02-20 17:11:37,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:37,029 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1105#true} {1105#true} #133#return; {1105#true} is VALID [2022-02-20 17:11:37,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {1105#true} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {1105#true} is VALID [2022-02-20 17:11:37,029 INFO L272 TraceCheckUtils]: 22: Hoare triple {1105#true} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {1105#true} is VALID [2022-02-20 17:11:37,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {1105#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1105#true} is VALID [2022-02-20 17:11:37,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:37,030 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1105#true} {1105#true} #135#return; {1105#true} is VALID [2022-02-20 17:11:37,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {1105#true} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {1209#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:11:37,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {1209#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem18#1; {1209#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:11:37,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {1209#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1123#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 17:11:37,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {1123#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < main_~n~0#1); {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:37,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:37,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !(upsweep_~space~0#1 < upsweep_~n#1); {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:37,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} upsweep_#res#1 := upsweep_~space~0#1; {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:37,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} main_#t~ret19#1 := upsweep_#res#1;assume { :end_inline_upsweep } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647;main_~space~1#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_downsweep } true;downsweep_#in~a#1.base, downsweep_#in~a#1.offset, downsweep_#in~n#1, downsweep_#in~space#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~space~1#1;havoc downsweep_#t~mem7#1, downsweep_#t~mem8#1, downsweep_#t~mem9#1, downsweep_~left~1#1, downsweep_~temp~0#1, downsweep_~right~1#1, downsweep_~a#1.base, downsweep_~a#1.offset, downsweep_~n#1, downsweep_~space#1;downsweep_~a#1.base, downsweep_~a#1.offset := downsweep_#in~a#1.base, downsweep_#in~a#1.offset;downsweep_~n#1 := downsweep_#in~n#1;downsweep_~space#1 := downsweep_#in~space#1;call write~int(0, downsweep_~a#1.base, downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1), 4);downsweep_~space#1 := (if downsweep_~space#1 < 0 && 0 != downsweep_~space#1 % 2 then 1 + downsweep_~space#1 / 2 else downsweep_~space#1 / 2); {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:37,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !(downsweep_~space#1 > 0); {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:37,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume { :end_inline_downsweep } true;assume { :begin_inline_check } true;check_#in~a0#1.base, check_#in~a0#1.offset, check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1 := main_~a0~0#1.base, main_~a0~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc check_#t~mem11#1, check_#t~mem12#1, check_#t~post10#1, check_~a0#1.base, check_~a0#1.offset, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~i~0#1, check_~sum~0#1;check_~a0#1.base, check_~a0#1.offset := check_#in~a0#1.base, check_#in~a0#1.offset;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;havoc check_~i~0#1;check_~sum~0#1 := 0;check_~i~0#1 := 0; {1237#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} is VALID [2022-02-20 17:11:37,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {1237#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1237#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} is VALID [2022-02-20 17:11:37,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {1237#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {1237#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} is VALID [2022-02-20 17:11:37,035 INFO L290 TraceCheckUtils]: 38: Hoare triple {1237#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} assume { :end_inline___VERIFIER_assert } true;havoc check_#t~mem11#1;call check_#t~mem12#1 := read~int(check_~a0#1.base, check_~a0#1.offset + 4 * check_~i~0#1, 4);check_~sum~0#1 := check_~sum~0#1 + check_#t~mem12#1;havoc check_#t~mem12#1; {1237#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} is VALID [2022-02-20 17:11:37,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {1237#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} check_#t~post10#1 := check_~i~0#1;check_~i~0#1 := 1 + check_#t~post10#1;havoc check_#t~post10#1; {1250#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 1 |ULTIMATE.start_check_~i~0#1|))} is VALID [2022-02-20 17:11:37,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {1250#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 1 |ULTIMATE.start_check_~i~0#1|))} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1106#false} is VALID [2022-02-20 17:11:37,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {1106#false} assume 0 == __VERIFIER_assert_~cond#1; {1106#false} is VALID [2022-02-20 17:11:37,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {1106#false} assume !false; {1106#false} is VALID [2022-02-20 17:11:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 17:11:37,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:11:37,231 INFO L290 TraceCheckUtils]: 42: Hoare triple {1106#false} assume !false; {1106#false} is VALID [2022-02-20 17:11:37,231 INFO L290 TraceCheckUtils]: 41: Hoare triple {1106#false} assume 0 == __VERIFIER_assert_~cond#1; {1106#false} is VALID [2022-02-20 17:11:37,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {1126#(<= |ULTIMATE.start_check_~n#1| |ULTIMATE.start_check_~i~0#1|)} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1106#false} is VALID [2022-02-20 17:11:37,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {1269#(<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~i~0#1| 1))} check_#t~post10#1 := check_~i~0#1;check_~i~0#1 := 1 + check_#t~post10#1;havoc check_#t~post10#1; {1126#(<= |ULTIMATE.start_check_~n#1| |ULTIMATE.start_check_~i~0#1|)} is VALID [2022-02-20 17:11:37,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {1269#(<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~i~0#1| 1))} assume { :end_inline___VERIFIER_assert } true;havoc check_#t~mem11#1;call check_#t~mem12#1 := read~int(check_~a0#1.base, check_~a0#1.offset + 4 * check_~i~0#1, 4);check_~sum~0#1 := check_~sum~0#1 + check_#t~mem12#1;havoc check_#t~mem12#1; {1269#(<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~i~0#1| 1))} is VALID [2022-02-20 17:11:37,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {1269#(<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~i~0#1| 1))} assume !(0 == __VERIFIER_assert_~cond#1); {1269#(<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~i~0#1| 1))} is VALID [2022-02-20 17:11:37,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {1269#(<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~i~0#1| 1))} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1269#(<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~i~0#1| 1))} is VALID [2022-02-20 17:11:37,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume { :end_inline_downsweep } true;assume { :begin_inline_check } true;check_#in~a0#1.base, check_#in~a0#1.offset, check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1 := main_~a0~0#1.base, main_~a0~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc check_#t~mem11#1, check_#t~mem12#1, check_#t~post10#1, check_~a0#1.base, check_~a0#1.offset, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~i~0#1, check_~sum~0#1;check_~a0#1.base, check_~a0#1.offset := check_#in~a0#1.base, check_#in~a0#1.offset;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;havoc check_~i~0#1;check_~sum~0#1 := 0;check_~i~0#1 := 0; {1269#(<= |ULTIMATE.start_check_~n#1| (+ |ULTIMATE.start_check_~i~0#1| 1))} is VALID [2022-02-20 17:11:37,234 INFO L290 TraceCheckUtils]: 34: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !(downsweep_~space#1 > 0); {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:37,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} main_#t~ret19#1 := upsweep_#res#1;assume { :end_inline_upsweep } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647;main_~space~1#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_downsweep } true;downsweep_#in~a#1.base, downsweep_#in~a#1.offset, downsweep_#in~n#1, downsweep_#in~space#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~space~1#1;havoc downsweep_#t~mem7#1, downsweep_#t~mem8#1, downsweep_#t~mem9#1, downsweep_~left~1#1, downsweep_~temp~0#1, downsweep_~right~1#1, downsweep_~a#1.base, downsweep_~a#1.offset, downsweep_~n#1, downsweep_~space#1;downsweep_~a#1.base, downsweep_~a#1.offset := downsweep_#in~a#1.base, downsweep_#in~a#1.offset;downsweep_~n#1 := downsweep_#in~n#1;downsweep_~space#1 := downsweep_#in~space#1;call write~int(0, downsweep_~a#1.base, downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1), 4);downsweep_~space#1 := (if downsweep_~space#1 < 0 && 0 != downsweep_~space#1 % 2 then 1 + downsweep_~space#1 / 2 else downsweep_~space#1 / 2); {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:37,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} upsweep_#res#1 := upsweep_~space~0#1; {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:37,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !(upsweep_~space~0#1 < upsweep_~n#1); {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:37,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:37,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {1123#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < main_~n~0#1); {1124#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:37,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {1209#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1123#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 17:11:37,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {1209#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem18#1; {1209#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:11:37,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {1105#true} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {1209#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:11:37,238 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1105#true} {1105#true} #135#return; {1105#true} is VALID [2022-02-20 17:11:37,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:37,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {1105#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1105#true} is VALID [2022-02-20 17:11:37,238 INFO L272 TraceCheckUtils]: 22: Hoare triple {1105#true} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {1105#true} is VALID [2022-02-20 17:11:37,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {1105#true} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {1105#true} is VALID [2022-02-20 17:11:37,238 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1105#true} {1105#true} #133#return; {1105#true} is VALID [2022-02-20 17:11:37,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:37,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {1105#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1105#true} is VALID [2022-02-20 17:11:37,239 INFO L272 TraceCheckUtils]: 17: Hoare triple {1105#true} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {1105#true} is VALID [2022-02-20 17:11:37,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {1105#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {1105#true} is VALID [2022-02-20 17:11:37,239 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1105#true} {1105#true} #131#return; {1105#true} is VALID [2022-02-20 17:11:37,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:37,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {1105#true} assume !(0 == ~cond); {1105#true} is VALID [2022-02-20 17:11:37,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {1105#true} ~cond := #in~cond; {1105#true} is VALID [2022-02-20 17:11:37,239 INFO L272 TraceCheckUtils]: 11: Hoare triple {1105#true} call assume_abort_if_not(main_#t~ret14#1); {1105#true} is VALID [2022-02-20 17:11:37,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {1105#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {1105#true} is VALID [2022-02-20 17:11:37,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {1105#true} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {1105#true} is VALID [2022-02-20 17:11:37,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {1105#true} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {1105#true} is VALID [2022-02-20 17:11:37,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {1105#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {1105#true} is VALID [2022-02-20 17:11:37,240 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1105#true} {1105#true} #129#return; {1105#true} is VALID [2022-02-20 17:11:37,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {1105#true} assume true; {1105#true} is VALID [2022-02-20 17:11:37,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {1105#true} assume !(0 == ~cond); {1105#true} is VALID [2022-02-20 17:11:37,240 INFO L290 TraceCheckUtils]: 3: Hoare triple {1105#true} ~cond := #in~cond; {1105#true} is VALID [2022-02-20 17:11:37,240 INFO L272 TraceCheckUtils]: 2: Hoare triple {1105#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {1105#true} is VALID [2022-02-20 17:11:37,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1105#true} is VALID [2022-02-20 17:11:37,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {1105#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(17, 2);call #Ultimate.allocInit(12, 3); {1105#true} is VALID [2022-02-20 17:11:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 17:11:37,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108043090] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:11:37,241 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:11:37,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-02-20 17:11:37,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406488297] [2022-02-20 17:11:37,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:11:37,243 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-02-20 17:11:37,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:11:37,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:37,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:11:37,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:11:37,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:11:37,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:11:37,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:11:37,285 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:39,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:11:40,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:11:40,246 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-02-20 17:11:40,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 17:11:40,246 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-02-20 17:11:40,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:11:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 136 transitions. [2022-02-20 17:11:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 136 transitions. [2022-02-20 17:11:40,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 136 transitions. [2022-02-20 17:11:40,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:11:40,347 INFO L225 Difference]: With dead ends: 116 [2022-02-20 17:11:40,347 INFO L226 Difference]: Without dead ends: 80 [2022-02-20 17:11:40,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-02-20 17:11:40,348 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 83 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:11:40,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 354 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 227 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 17:11:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-20 17:11:40,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 46. [2022-02-20 17:11:40,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:11:40,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:40,353 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:40,354 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:11:40,356 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2022-02-20 17:11:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2022-02-20 17:11:40,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:11:40,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:11:40,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 80 states. [2022-02-20 17:11:40,357 INFO L87 Difference]: Start difference. First operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 80 states. [2022-02-20 17:11:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:11:40,359 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2022-02-20 17:11:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2022-02-20 17:11:40,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:11:40,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:11:40,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:11:40,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:11:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-02-20 17:11:40,361 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 43 [2022-02-20 17:11:40,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:11:40,361 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-02-20 17:11:40,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-02-20 17:11:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 17:11:40,362 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:11:40,363 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:11:40,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:11:40,584 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,SelfDestructingSolverStorable3 [2022-02-20 17:11:40,585 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:11:40,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:11:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1080974370, now seen corresponding path program 2 times [2022-02-20 17:11:40,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:11:40,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242862658] [2022-02-20 17:11:40,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:11:40,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:11:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:40,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:11:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:40,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:11:40,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:11:40,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:11:40,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1792#true} {1792#true} #129#return; {1792#true} is VALID [2022-02-20 17:11:40,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 17:11:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:40,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:11:40,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:11:40,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:11:40,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1792#true} {1792#true} #131#return; {1792#true} is VALID [2022-02-20 17:11:40,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 17:11:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:40,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {1813#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1792#true} is VALID [2022-02-20 17:11:40,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:11:40,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1792#true} {1792#true} #133#return; {1792#true} is VALID [2022-02-20 17:11:40,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 17:11:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:40,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {1813#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1792#true} is VALID [2022-02-20 17:11:40,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:11:40,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1792#true} {1792#true} #135#return; {1792#true} is VALID [2022-02-20 17:11:40,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {1792#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(17, 2);call #Ultimate.allocInit(12, 3); {1792#true} is VALID [2022-02-20 17:11:40,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1792#true} is VALID [2022-02-20 17:11:40,680 INFO L272 TraceCheckUtils]: 2: Hoare triple {1792#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:11:40,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:11:40,680 INFO L290 TraceCheckUtils]: 4: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:11:40,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:11:40,680 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1792#true} {1792#true} #129#return; {1792#true} is VALID [2022-02-20 17:11:40,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {1792#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {1798#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:11:40,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {1798#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {1798#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:11:40,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {1798#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {1792#true} is VALID [2022-02-20 17:11:40,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {1792#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {1792#true} is VALID [2022-02-20 17:11:40,681 INFO L272 TraceCheckUtils]: 11: Hoare triple {1792#true} call assume_abort_if_not(main_#t~ret14#1); {1792#true} is VALID [2022-02-20 17:11:40,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:11:40,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:11:40,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:11:40,682 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1792#true} {1792#true} #131#return; {1792#true} is VALID [2022-02-20 17:11:40,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {1792#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {1792#true} is VALID [2022-02-20 17:11:40,683 INFO L272 TraceCheckUtils]: 17: Hoare triple {1792#true} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {1813#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:11:40,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {1813#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1792#true} is VALID [2022-02-20 17:11:40,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:11:40,683 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1792#true} {1792#true} #133#return; {1792#true} is VALID [2022-02-20 17:11:40,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {1792#true} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {1792#true} is VALID [2022-02-20 17:11:40,684 INFO L272 TraceCheckUtils]: 22: Hoare triple {1792#true} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {1813#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:11:40,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {1813#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1792#true} is VALID [2022-02-20 17:11:40,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:11:40,684 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1792#true} {1792#true} #135#return; {1792#true} is VALID [2022-02-20 17:11:40,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {1792#true} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {1809#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:11:40,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {1809#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem18#1; {1809#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:11:40,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {1809#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1810#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 17:11:40,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {1810#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem18#1; {1811#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:11:40,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {1811#(<= 2 |ULTIMATE.start_main_~n~0#1|)} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1811#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:11:40,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {1811#(<= 2 |ULTIMATE.start_main_~n~0#1|)} assume !(main_~i~1#1 < main_~n~0#1); {1811#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:11:40,687 INFO L290 TraceCheckUtils]: 32: Hoare triple {1811#(<= 2 |ULTIMATE.start_main_~n~0#1|)} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {1812#(and (= (+ (- 1) |ULTIMATE.start_upsweep_~space~0#1|) 0) (<= 2 |ULTIMATE.start_upsweep_~n#1|))} is VALID [2022-02-20 17:11:40,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {1812#(and (= (+ (- 1) |ULTIMATE.start_upsweep_~space~0#1|) 0) (<= 2 |ULTIMATE.start_upsweep_~n#1|))} assume !(upsweep_~space~0#1 < upsweep_~n#1); {1793#false} is VALID [2022-02-20 17:11:40,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {1793#false} upsweep_#res#1 := upsweep_~space~0#1; {1793#false} is VALID [2022-02-20 17:11:40,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {1793#false} main_#t~ret19#1 := upsweep_#res#1;assume { :end_inline_upsweep } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647;main_~space~1#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_downsweep } true;downsweep_#in~a#1.base, downsweep_#in~a#1.offset, downsweep_#in~n#1, downsweep_#in~space#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~space~1#1;havoc downsweep_#t~mem7#1, downsweep_#t~mem8#1, downsweep_#t~mem9#1, downsweep_~left~1#1, downsweep_~temp~0#1, downsweep_~right~1#1, downsweep_~a#1.base, downsweep_~a#1.offset, downsweep_~n#1, downsweep_~space#1;downsweep_~a#1.base, downsweep_~a#1.offset := downsweep_#in~a#1.base, downsweep_#in~a#1.offset;downsweep_~n#1 := downsweep_#in~n#1;downsweep_~space#1 := downsweep_#in~space#1;call write~int(0, downsweep_~a#1.base, downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1), 4);downsweep_~space#1 := (if downsweep_~space#1 < 0 && 0 != downsweep_~space#1 % 2 then 1 + downsweep_~space#1 / 2 else downsweep_~space#1 / 2); {1793#false} is VALID [2022-02-20 17:11:40,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {1793#false} assume !(downsweep_~space#1 > 0); {1793#false} is VALID [2022-02-20 17:11:40,688 INFO L290 TraceCheckUtils]: 37: Hoare triple {1793#false} assume { :end_inline_downsweep } true;assume { :begin_inline_check } true;check_#in~a0#1.base, check_#in~a0#1.offset, check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1 := main_~a0~0#1.base, main_~a0~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc check_#t~mem11#1, check_#t~mem12#1, check_#t~post10#1, check_~a0#1.base, check_~a0#1.offset, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~i~0#1, check_~sum~0#1;check_~a0#1.base, check_~a0#1.offset := check_#in~a0#1.base, check_#in~a0#1.offset;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;havoc check_~i~0#1;check_~sum~0#1 := 0;check_~i~0#1 := 0; {1793#false} is VALID [2022-02-20 17:11:40,688 INFO L290 TraceCheckUtils]: 38: Hoare triple {1793#false} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1793#false} is VALID [2022-02-20 17:11:40,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {1793#false} assume !(0 == __VERIFIER_assert_~cond#1); {1793#false} is VALID [2022-02-20 17:11:40,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {1793#false} assume { :end_inline___VERIFIER_assert } true;havoc check_#t~mem11#1;call check_#t~mem12#1 := read~int(check_~a0#1.base, check_~a0#1.offset + 4 * check_~i~0#1, 4);check_~sum~0#1 := check_~sum~0#1 + check_#t~mem12#1;havoc check_#t~mem12#1; {1793#false} is VALID [2022-02-20 17:11:40,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {1793#false} check_#t~post10#1 := check_~i~0#1;check_~i~0#1 := 1 + check_#t~post10#1;havoc check_#t~post10#1; {1793#false} is VALID [2022-02-20 17:11:40,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {1793#false} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1793#false} is VALID [2022-02-20 17:11:40,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {1793#false} assume 0 == __VERIFIER_assert_~cond#1; {1793#false} is VALID [2022-02-20 17:11:40,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-02-20 17:11:40,689 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 17:11:40,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:11:40,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242862658] [2022-02-20 17:11:40,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242862658] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:11:40,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486311787] [2022-02-20 17:11:40,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:11:40,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:11:40,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:11:40,690 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 17:11:40,696 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 17:11:40,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:11:40,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:11:40,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:11:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:40,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:11:40,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {1792#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(17, 2);call #Ultimate.allocInit(12, 3); {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L272 TraceCheckUtils]: 2: Hoare triple {1792#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L290 TraceCheckUtils]: 4: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1792#true} {1792#true} #129#return; {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {1792#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {1792#true} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {1792#true} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {1792#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L272 TraceCheckUtils]: 11: Hoare triple {1792#true} call assume_abort_if_not(main_#t~ret14#1); {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {1792#true} ~cond := #in~cond; {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {1792#true} assume !(0 == ~cond); {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1792#true} {1792#true} #131#return; {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {1792#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {1792#true} is VALID [2022-02-20 17:11:40,990 INFO L272 TraceCheckUtils]: 17: Hoare triple {1792#true} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {1792#true} is VALID [2022-02-20 17:11:40,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {1792#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1792#true} is VALID [2022-02-20 17:11:40,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:11:40,991 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1792#true} {1792#true} #133#return; {1792#true} is VALID [2022-02-20 17:11:40,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {1792#true} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {1792#true} is VALID [2022-02-20 17:11:40,991 INFO L272 TraceCheckUtils]: 22: Hoare triple {1792#true} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {1792#true} is VALID [2022-02-20 17:11:40,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {1792#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1792#true} is VALID [2022-02-20 17:11:40,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {1792#true} assume true; {1792#true} is VALID [2022-02-20 17:11:40,991 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1792#true} {1792#true} #135#return; {1792#true} is VALID [2022-02-20 17:11:40,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {1792#true} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {1792#true} is VALID [2022-02-20 17:11:40,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {1792#true} assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem18#1; {1792#true} is VALID [2022-02-20 17:11:40,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {1792#true} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1792#true} is VALID [2022-02-20 17:11:40,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {1792#true} assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem18#1; {1792#true} is VALID [2022-02-20 17:11:40,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {1792#true} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1792#true} is VALID [2022-02-20 17:11:40,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {1792#true} assume !(main_~i~1#1 < main_~n~0#1); {1792#true} is VALID [2022-02-20 17:11:40,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {1792#true} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {1913#(and (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_upsweep_~n#1|) (<= |ULTIMATE.start_upsweep_~space~0#1| 1))} is VALID [2022-02-20 17:11:40,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {1913#(and (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_upsweep_~n#1|) (<= |ULTIMATE.start_upsweep_~space~0#1| 1))} assume !(upsweep_~space~0#1 < upsweep_~n#1); {1917#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:40,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {1917#(<= |ULTIMATE.start_main_~n~0#1| 1)} upsweep_#res#1 := upsweep_~space~0#1; {1917#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:40,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {1917#(<= |ULTIMATE.start_main_~n~0#1| 1)} main_#t~ret19#1 := upsweep_#res#1;assume { :end_inline_upsweep } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647;main_~space~1#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_downsweep } true;downsweep_#in~a#1.base, downsweep_#in~a#1.offset, downsweep_#in~n#1, downsweep_#in~space#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~space~1#1;havoc downsweep_#t~mem7#1, downsweep_#t~mem8#1, downsweep_#t~mem9#1, downsweep_~left~1#1, downsweep_~temp~0#1, downsweep_~right~1#1, downsweep_~a#1.base, downsweep_~a#1.offset, downsweep_~n#1, downsweep_~space#1;downsweep_~a#1.base, downsweep_~a#1.offset := downsweep_#in~a#1.base, downsweep_#in~a#1.offset;downsweep_~n#1 := downsweep_#in~n#1;downsweep_~space#1 := downsweep_#in~space#1;call write~int(0, downsweep_~a#1.base, downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1), 4);downsweep_~space#1 := (if downsweep_~space#1 < 0 && 0 != downsweep_~space#1 % 2 then 1 + downsweep_~space#1 / 2 else downsweep_~space#1 / 2); {1917#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:40,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {1917#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !(downsweep_~space#1 > 0); {1917#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 17:11:40,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {1917#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume { :end_inline_downsweep } true;assume { :begin_inline_check } true;check_#in~a0#1.base, check_#in~a0#1.offset, check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1 := main_~a0~0#1.base, main_~a0~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc check_#t~mem11#1, check_#t~mem12#1, check_#t~post10#1, check_~a0#1.base, check_~a0#1.offset, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~i~0#1, check_~sum~0#1;check_~a0#1.base, check_~a0#1.offset := check_#in~a0#1.base, check_#in~a0#1.offset;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;havoc check_~i~0#1;check_~sum~0#1 := 0;check_~i~0#1 := 0; {1930#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} is VALID [2022-02-20 17:11:40,994 INFO L290 TraceCheckUtils]: 38: Hoare triple {1930#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1930#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} is VALID [2022-02-20 17:11:40,995 INFO L290 TraceCheckUtils]: 39: Hoare triple {1930#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {1930#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} is VALID [2022-02-20 17:11:40,995 INFO L290 TraceCheckUtils]: 40: Hoare triple {1930#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} assume { :end_inline___VERIFIER_assert } true;havoc check_#t~mem11#1;call check_#t~mem12#1 := read~int(check_~a0#1.base, check_~a0#1.offset + 4 * check_~i~0#1, 4);check_~sum~0#1 := check_~sum~0#1 + check_#t~mem12#1;havoc check_#t~mem12#1; {1930#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} is VALID [2022-02-20 17:11:40,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {1930#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 0 |ULTIMATE.start_check_~i~0#1|))} check_#t~post10#1 := check_~i~0#1;check_~i~0#1 := 1 + check_#t~post10#1;havoc check_#t~post10#1; {1943#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 1 |ULTIMATE.start_check_~i~0#1|))} is VALID [2022-02-20 17:11:40,996 INFO L290 TraceCheckUtils]: 42: Hoare triple {1943#(and (<= |ULTIMATE.start_check_~n#1| 1) (<= 1 |ULTIMATE.start_check_~i~0#1|))} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1793#false} is VALID [2022-02-20 17:11:40,996 INFO L290 TraceCheckUtils]: 43: Hoare triple {1793#false} assume 0 == __VERIFIER_assert_~cond#1; {1793#false} is VALID [2022-02-20 17:11:40,996 INFO L290 TraceCheckUtils]: 44: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-02-20 17:11:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 17:11:40,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:11:40,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486311787] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:11:40,997 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:11:40,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2022-02-20 17:11:40,997 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580056581] [2022-02-20 17:11:40,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:11:40,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2022-02-20 17:11:40,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:11:40,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:41,023 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 17:11:41,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:11:41,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:11:41,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:11:41,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:11:41,024 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:11:51,931 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-02-20 17:11:51,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:11:51,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2022-02-20 17:11:51,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:11:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:51,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-02-20 17:11:51,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-02-20 17:11:51,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-02-20 17:11:51,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:11:51,984 INFO L225 Difference]: With dead ends: 66 [2022-02-20 17:11:51,984 INFO L226 Difference]: Without dead ends: 49 [2022-02-20 17:11:51,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:11:51,986 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 23 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:11:51,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 169 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:11:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-20 17:11:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-02-20 17:11:52,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:11:52,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:52,008 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:52,008 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:11:52,010 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-02-20 17:11:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-02-20 17:11:52,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:11:52,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:11:52,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 49 states. [2022-02-20 17:11:52,012 INFO L87 Difference]: Start difference. First operand has 47 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 49 states. [2022-02-20 17:11:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:11:52,013 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-02-20 17:11:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-02-20 17:11:52,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:11:52,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:11:52,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:11:52,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:11:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-02-20 17:11:52,015 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 45 [2022-02-20 17:11:52,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:11:52,016 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-02-20 17:11:52,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-02-20 17:11:52,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 17:11:52,018 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:11:52,018 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:11:52,049 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 17:11:52,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:11:52,236 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:11:52,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:11:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1924122647, now seen corresponding path program 1 times [2022-02-20 17:11:52,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:11:52,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664370633] [2022-02-20 17:11:52,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:11:52,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:11:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:52,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:11:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:52,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {2216#true} ~cond := #in~cond; {2216#true} is VALID [2022-02-20 17:11:52,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {2216#true} assume !(0 == ~cond); {2216#true} is VALID [2022-02-20 17:11:52,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-02-20 17:11:52,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2216#true} {2216#true} #129#return; {2216#true} is VALID [2022-02-20 17:11:52,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 17:11:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:52,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {2216#true} ~cond := #in~cond; {2216#true} is VALID [2022-02-20 17:11:52,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {2216#true} assume !(0 == ~cond); {2216#true} is VALID [2022-02-20 17:11:52,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-02-20 17:11:52,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2216#true} {2216#true} #131#return; {2216#true} is VALID [2022-02-20 17:11:52,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 17:11:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:52,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {2233#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2216#true} is VALID [2022-02-20 17:11:52,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-02-20 17:11:52,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2216#true} {2216#true} #133#return; {2216#true} is VALID [2022-02-20 17:11:52,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 17:11:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:52,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {2233#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2216#true} is VALID [2022-02-20 17:11:52,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-02-20 17:11:52,294 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2216#true} {2216#true} #135#return; {2216#true} is VALID [2022-02-20 17:11:52,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {2216#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(17, 2);call #Ultimate.allocInit(12, 3); {2216#true} is VALID [2022-02-20 17:11:52,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {2216#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {2216#true} is VALID [2022-02-20 17:11:52,295 INFO L272 TraceCheckUtils]: 2: Hoare triple {2216#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {2216#true} is VALID [2022-02-20 17:11:52,295 INFO L290 TraceCheckUtils]: 3: Hoare triple {2216#true} ~cond := #in~cond; {2216#true} is VALID [2022-02-20 17:11:52,295 INFO L290 TraceCheckUtils]: 4: Hoare triple {2216#true} assume !(0 == ~cond); {2216#true} is VALID [2022-02-20 17:11:52,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-02-20 17:11:52,295 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2216#true} {2216#true} #129#return; {2216#true} is VALID [2022-02-20 17:11:52,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {2216#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {2216#true} is VALID [2022-02-20 17:11:52,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {2216#true} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {2216#true} is VALID [2022-02-20 17:11:52,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {2216#true} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {2216#true} is VALID [2022-02-20 17:11:52,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {2216#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {2216#true} is VALID [2022-02-20 17:11:52,296 INFO L272 TraceCheckUtils]: 11: Hoare triple {2216#true} call assume_abort_if_not(main_#t~ret14#1); {2216#true} is VALID [2022-02-20 17:11:52,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {2216#true} ~cond := #in~cond; {2216#true} is VALID [2022-02-20 17:11:52,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {2216#true} assume !(0 == ~cond); {2216#true} is VALID [2022-02-20 17:11:52,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-02-20 17:11:52,296 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2216#true} {2216#true} #131#return; {2216#true} is VALID [2022-02-20 17:11:52,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {2216#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {2216#true} is VALID [2022-02-20 17:11:52,297 INFO L272 TraceCheckUtils]: 17: Hoare triple {2216#true} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {2233#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:11:52,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {2233#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2216#true} is VALID [2022-02-20 17:11:52,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-02-20 17:11:52,297 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2216#true} {2216#true} #133#return; {2216#true} is VALID [2022-02-20 17:11:52,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {2216#true} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {2216#true} is VALID [2022-02-20 17:11:52,298 INFO L272 TraceCheckUtils]: 22: Hoare triple {2216#true} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {2233#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:11:52,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {2233#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2216#true} is VALID [2022-02-20 17:11:52,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {2216#true} assume true; {2216#true} is VALID [2022-02-20 17:11:52,299 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2216#true} {2216#true} #135#return; {2216#true} is VALID [2022-02-20 17:11:52,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {2216#true} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {2216#true} is VALID [2022-02-20 17:11:52,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {2216#true} assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem18#1; {2216#true} is VALID [2022-02-20 17:11:52,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {2216#true} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2216#true} is VALID [2022-02-20 17:11:52,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {2216#true} assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem18#1; {2216#true} is VALID [2022-02-20 17:11:52,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {2216#true} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2216#true} is VALID [2022-02-20 17:11:52,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {2216#true} assume !(main_~i~1#1 < main_~n~0#1); {2216#true} is VALID [2022-02-20 17:11:52,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {2216#true} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {2216#true} is VALID [2022-02-20 17:11:52,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {2216#true} assume !!(upsweep_~space~0#1 < upsweep_~n#1);upsweep_~left~0#1 := upsweep_~space~0#1 - 1; {2232#(<= (+ 2 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~n#1|)} is VALID [2022-02-20 17:11:52,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {2232#(<= (+ 2 |ULTIMATE.start_upsweep_~left~0#1|) |ULTIMATE.start_upsweep_~n#1|)} assume !(upsweep_~left~0#1 < upsweep_~n#1); {2217#false} is VALID [2022-02-20 17:11:52,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {2217#false} upsweep_~space~0#1 := 2 * upsweep_~space~0#1; {2217#false} is VALID [2022-02-20 17:11:52,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {2217#false} assume !(upsweep_~space~0#1 < upsweep_~n#1); {2217#false} is VALID [2022-02-20 17:11:52,301 INFO L290 TraceCheckUtils]: 37: Hoare triple {2217#false} upsweep_#res#1 := upsweep_~space~0#1; {2217#false} is VALID [2022-02-20 17:11:52,301 INFO L290 TraceCheckUtils]: 38: Hoare triple {2217#false} main_#t~ret19#1 := upsweep_#res#1;assume { :end_inline_upsweep } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647;main_~space~1#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_downsweep } true;downsweep_#in~a#1.base, downsweep_#in~a#1.offset, downsweep_#in~n#1, downsweep_#in~space#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~space~1#1;havoc downsweep_#t~mem7#1, downsweep_#t~mem8#1, downsweep_#t~mem9#1, downsweep_~left~1#1, downsweep_~temp~0#1, downsweep_~right~1#1, downsweep_~a#1.base, downsweep_~a#1.offset, downsweep_~n#1, downsweep_~space#1;downsweep_~a#1.base, downsweep_~a#1.offset := downsweep_#in~a#1.base, downsweep_#in~a#1.offset;downsweep_~n#1 := downsweep_#in~n#1;downsweep_~space#1 := downsweep_#in~space#1;call write~int(0, downsweep_~a#1.base, downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1), 4);downsweep_~space#1 := (if downsweep_~space#1 < 0 && 0 != downsweep_~space#1 % 2 then 1 + downsweep_~space#1 / 2 else downsweep_~space#1 / 2); {2217#false} is VALID [2022-02-20 17:11:52,301 INFO L290 TraceCheckUtils]: 39: Hoare triple {2217#false} assume !(downsweep_~space#1 > 0); {2217#false} is VALID [2022-02-20 17:11:52,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {2217#false} assume { :end_inline_downsweep } true;assume { :begin_inline_check } true;check_#in~a0#1.base, check_#in~a0#1.offset, check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1 := main_~a0~0#1.base, main_~a0~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc check_#t~mem11#1, check_#t~mem12#1, check_#t~post10#1, check_~a0#1.base, check_~a0#1.offset, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~i~0#1, check_~sum~0#1;check_~a0#1.base, check_~a0#1.offset := check_#in~a0#1.base, check_#in~a0#1.offset;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;havoc check_~i~0#1;check_~sum~0#1 := 0;check_~i~0#1 := 0; {2217#false} is VALID [2022-02-20 17:11:52,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {2217#false} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2217#false} is VALID [2022-02-20 17:11:52,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {2217#false} assume !(0 == __VERIFIER_assert_~cond#1); {2217#false} is VALID [2022-02-20 17:11:52,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {2217#false} assume { :end_inline___VERIFIER_assert } true;havoc check_#t~mem11#1;call check_#t~mem12#1 := read~int(check_~a0#1.base, check_~a0#1.offset + 4 * check_~i~0#1, 4);check_~sum~0#1 := check_~sum~0#1 + check_#t~mem12#1;havoc check_#t~mem12#1; {2217#false} is VALID [2022-02-20 17:11:52,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {2217#false} check_#t~post10#1 := check_~i~0#1;check_~i~0#1 := 1 + check_#t~post10#1;havoc check_#t~post10#1; {2217#false} is VALID [2022-02-20 17:11:52,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {2217#false} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2217#false} is VALID [2022-02-20 17:11:52,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {2217#false} assume 0 == __VERIFIER_assert_~cond#1; {2217#false} is VALID [2022-02-20 17:11:52,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {2217#false} assume !false; {2217#false} is VALID [2022-02-20 17:11:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-20 17:11:52,302 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:11:52,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664370633] [2022-02-20 17:11:52,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664370633] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:11:52,302 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:11:52,303 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:11:52,303 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194220105] [2022-02-20 17:11:52,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:11:52,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-02-20 17:11:52,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:11:52,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:52,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:11:52,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:11:52,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:11:52,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:11:52,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:11:52,329 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:11:56,706 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-02-20 17:11:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:11:56,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-02-20 17:11:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:11:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-02-20 17:11:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-02-20 17:11:56,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2022-02-20 17:11:56,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:11:56,752 INFO L225 Difference]: With dead ends: 65 [2022-02-20 17:11:56,752 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:11:56,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:11:56,753 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 3 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:11:56,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 108 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:11:56,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:11:56,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-20 17:11:56,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:11:56,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:56,761 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:56,761 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:11:56,763 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-02-20 17:11:56,763 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-02-20 17:11:56,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:11:56,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:11:56,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 48 states. [2022-02-20 17:11:56,763 INFO L87 Difference]: Start difference. First operand has 48 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 48 states. [2022-02-20 17:11:56,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:11:56,764 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-02-20 17:11:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-02-20 17:11:56,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:11:56,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:11:56,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:11:56,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:11:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:11:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-02-20 17:11:56,766 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 48 [2022-02-20 17:11:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:11:56,766 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-02-20 17:11:56,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-02-20 17:11:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 17:11:56,767 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:11:56,767 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:11:56,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 17:11:56,768 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:11:56,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:11:56,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1397539149, now seen corresponding path program 1 times [2022-02-20 17:11:56,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:11:56,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855923572] [2022-02-20 17:11:56,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:11:56,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:11:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:56,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:11:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:56,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {2494#true} ~cond := #in~cond; {2494#true} is VALID [2022-02-20 17:11:56,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {2494#true} assume !(0 == ~cond); {2494#true} is VALID [2022-02-20 17:11:56,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {2494#true} assume true; {2494#true} is VALID [2022-02-20 17:11:56,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2494#true} {2494#true} #129#return; {2494#true} is VALID [2022-02-20 17:11:56,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 17:11:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:56,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {2494#true} ~cond := #in~cond; {2494#true} is VALID [2022-02-20 17:11:56,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {2494#true} assume !(0 == ~cond); {2494#true} is VALID [2022-02-20 17:11:56,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {2494#true} assume true; {2494#true} is VALID [2022-02-20 17:11:56,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2494#true} {2494#true} #131#return; {2494#true} is VALID [2022-02-20 17:11:56,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 17:11:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:56,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {2518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2494#true} is VALID [2022-02-20 17:11:56,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {2494#true} assume true; {2494#true} is VALID [2022-02-20 17:11:56,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2494#true} {2494#true} #133#return; {2494#true} is VALID [2022-02-20 17:11:56,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 17:11:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:56,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {2518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2494#true} is VALID [2022-02-20 17:11:56,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {2494#true} assume true; {2494#true} is VALID [2022-02-20 17:11:56,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2494#true} {2494#true} #135#return; {2494#true} is VALID [2022-02-20 17:11:56,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {2494#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(17, 2);call #Ultimate.allocInit(12, 3); {2494#true} is VALID [2022-02-20 17:11:56,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {2494#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {2494#true} is VALID [2022-02-20 17:11:56,897 INFO L272 TraceCheckUtils]: 2: Hoare triple {2494#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {2494#true} is VALID [2022-02-20 17:11:56,898 INFO L290 TraceCheckUtils]: 3: Hoare triple {2494#true} ~cond := #in~cond; {2494#true} is VALID [2022-02-20 17:11:56,898 INFO L290 TraceCheckUtils]: 4: Hoare triple {2494#true} assume !(0 == ~cond); {2494#true} is VALID [2022-02-20 17:11:56,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {2494#true} assume true; {2494#true} is VALID [2022-02-20 17:11:56,898 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2494#true} {2494#true} #129#return; {2494#true} is VALID [2022-02-20 17:11:56,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {2494#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {2500#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:11:56,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {2500#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {2500#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:11:56,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {2500#(= |ULTIMATE.start_is_pow2_~x#1| |ULTIMATE.start_main_~n~0#1|)} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {2494#true} is VALID [2022-02-20 17:11:56,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {2494#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {2494#true} is VALID [2022-02-20 17:11:56,899 INFO L272 TraceCheckUtils]: 11: Hoare triple {2494#true} call assume_abort_if_not(main_#t~ret14#1); {2494#true} is VALID [2022-02-20 17:11:56,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {2494#true} ~cond := #in~cond; {2494#true} is VALID [2022-02-20 17:11:56,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#true} assume !(0 == ~cond); {2494#true} is VALID [2022-02-20 17:11:56,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {2494#true} assume true; {2494#true} is VALID [2022-02-20 17:11:56,899 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2494#true} {2494#true} #131#return; {2494#true} is VALID [2022-02-20 17:11:56,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {2494#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {2494#true} is VALID [2022-02-20 17:11:56,900 INFO L272 TraceCheckUtils]: 17: Hoare triple {2494#true} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {2518#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:11:56,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {2518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2494#true} is VALID [2022-02-20 17:11:56,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {2494#true} assume true; {2494#true} is VALID [2022-02-20 17:11:56,901 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2494#true} {2494#true} #133#return; {2494#true} is VALID [2022-02-20 17:11:56,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {2494#true} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {2494#true} is VALID [2022-02-20 17:11:56,901 INFO L272 TraceCheckUtils]: 22: Hoare triple {2494#true} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {2518#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 17:11:56,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {2518#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2494#true} is VALID [2022-02-20 17:11:56,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {2494#true} assume true; {2494#true} is VALID [2022-02-20 17:11:56,902 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2494#true} {2494#true} #135#return; {2494#true} is VALID [2022-02-20 17:11:56,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {2494#true} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {2511#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:11:56,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {2511#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem18#1; {2511#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:11:56,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {2511#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2512#(<= 1 |ULTIMATE.start_main_~i~1#1|)} is VALID [2022-02-20 17:11:56,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {2512#(<= 1 |ULTIMATE.start_main_~i~1#1|)} assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem18#1; {2513#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:11:56,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {2513#(<= 2 |ULTIMATE.start_main_~n~0#1|)} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2513#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:11:56,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {2513#(<= 2 |ULTIMATE.start_main_~n~0#1|)} assume !(main_~i~1#1 < main_~n~0#1); {2513#(<= 2 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:11:56,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {2513#(<= 2 |ULTIMATE.start_main_~n~0#1|)} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {2514#(<= 2 |ULTIMATE.start_upsweep_~n#1|)} is VALID [2022-02-20 17:11:56,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {2514#(<= 2 |ULTIMATE.start_upsweep_~n#1|)} assume !!(upsweep_~space~0#1 < upsweep_~n#1);upsweep_~left~0#1 := upsweep_~space~0#1 - 1; {2514#(<= 2 |ULTIMATE.start_upsweep_~n#1|)} is VALID [2022-02-20 17:11:56,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {2514#(<= 2 |ULTIMATE.start_upsweep_~n#1|)} assume !!(upsweep_~left~0#1 < upsweep_~n#1);upsweep_~right~0#1 := upsweep_~left~0#1 + upsweep_~space~0#1;call upsweep_#t~mem5#1 := read~int(upsweep_~a#1.base, upsweep_~a#1.offset + 4 * upsweep_~left~0#1, 4);call upsweep_#t~mem6#1 := read~int(upsweep_~a#1.base, upsweep_~a#1.offset + 4 * upsweep_~right~0#1, 4);call write~int(upsweep_#t~mem5#1 + upsweep_#t~mem6#1, upsweep_~a#1.base, upsweep_~a#1.offset + 4 * upsweep_~right~0#1, 4);havoc upsweep_#t~mem5#1;havoc upsweep_#t~mem6#1;upsweep_~left~0#1 := upsweep_~left~0#1 + 2 * upsweep_~space~0#1; {2514#(<= 2 |ULTIMATE.start_upsweep_~n#1|)} is VALID [2022-02-20 17:11:56,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {2514#(<= 2 |ULTIMATE.start_upsweep_~n#1|)} assume !(upsweep_~left~0#1 < upsweep_~n#1); {2514#(<= 2 |ULTIMATE.start_upsweep_~n#1|)} is VALID [2022-02-20 17:11:56,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {2514#(<= 2 |ULTIMATE.start_upsweep_~n#1|)} upsweep_~space~0#1 := 2 * upsweep_~space~0#1; {2514#(<= 2 |ULTIMATE.start_upsweep_~n#1|)} is VALID [2022-02-20 17:11:56,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {2514#(<= 2 |ULTIMATE.start_upsweep_~n#1|)} assume !(upsweep_~space~0#1 < upsweep_~n#1); {2515#(<= 2 |ULTIMATE.start_upsweep_~space~0#1|)} is VALID [2022-02-20 17:11:56,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {2515#(<= 2 |ULTIMATE.start_upsweep_~space~0#1|)} upsweep_#res#1 := upsweep_~space~0#1; {2516#(<= 2 |ULTIMATE.start_upsweep_#res#1|)} is VALID [2022-02-20 17:11:56,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {2516#(<= 2 |ULTIMATE.start_upsweep_#res#1|)} main_#t~ret19#1 := upsweep_#res#1;assume { :end_inline_upsweep } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647;main_~space~1#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_downsweep } true;downsweep_#in~a#1.base, downsweep_#in~a#1.offset, downsweep_#in~n#1, downsweep_#in~space#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~space~1#1;havoc downsweep_#t~mem7#1, downsweep_#t~mem8#1, downsweep_#t~mem9#1, downsweep_~left~1#1, downsweep_~temp~0#1, downsweep_~right~1#1, downsweep_~a#1.base, downsweep_~a#1.offset, downsweep_~n#1, downsweep_~space#1;downsweep_~a#1.base, downsweep_~a#1.offset := downsweep_#in~a#1.base, downsweep_#in~a#1.offset;downsweep_~n#1 := downsweep_#in~n#1;downsweep_~space#1 := downsweep_#in~space#1;call write~int(0, downsweep_~a#1.base, downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1), 4);downsweep_~space#1 := (if downsweep_~space#1 < 0 && 0 != downsweep_~space#1 % 2 then 1 + downsweep_~space#1 / 2 else downsweep_~space#1 / 2); {2517#(<= 1 |ULTIMATE.start_downsweep_~space#1|)} is VALID [2022-02-20 17:11:56,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {2517#(<= 1 |ULTIMATE.start_downsweep_~space#1|)} assume !(downsweep_~space#1 > 0); {2495#false} is VALID [2022-02-20 17:11:56,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {2495#false} assume { :end_inline_downsweep } true;assume { :begin_inline_check } true;check_#in~a0#1.base, check_#in~a0#1.offset, check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1 := main_~a0~0#1.base, main_~a0~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc check_#t~mem11#1, check_#t~mem12#1, check_#t~post10#1, check_~a0#1.base, check_~a0#1.offset, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~i~0#1, check_~sum~0#1;check_~a0#1.base, check_~a0#1.offset := check_#in~a0#1.base, check_#in~a0#1.offset;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;havoc check_~i~0#1;check_~sum~0#1 := 0;check_~i~0#1 := 0; {2495#false} is VALID [2022-02-20 17:11:56,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {2495#false} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2495#false} is VALID [2022-02-20 17:11:56,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {2495#false} assume !(0 == __VERIFIER_assert_~cond#1); {2495#false} is VALID [2022-02-20 17:11:56,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {2495#false} assume { :end_inline___VERIFIER_assert } true;havoc check_#t~mem11#1;call check_#t~mem12#1 := read~int(check_~a0#1.base, check_~a0#1.offset + 4 * check_~i~0#1, 4);check_~sum~0#1 := check_~sum~0#1 + check_#t~mem12#1;havoc check_#t~mem12#1; {2495#false} is VALID [2022-02-20 17:11:56,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {2495#false} check_#t~post10#1 := check_~i~0#1;check_~i~0#1 := 1 + check_#t~post10#1;havoc check_#t~post10#1; {2495#false} is VALID [2022-02-20 17:11:56,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {2495#false} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2495#false} is VALID [2022-02-20 17:11:56,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {2495#false} assume 0 == __VERIFIER_assert_~cond#1; {2495#false} is VALID [2022-02-20 17:11:56,909 INFO L290 TraceCheckUtils]: 48: Hoare triple {2495#false} assume !false; {2495#false} is VALID [2022-02-20 17:11:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-20 17:11:56,909 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:11:56,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855923572] [2022-02-20 17:11:56,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855923572] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:11:56,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345948996] [2022-02-20 17:11:56,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:11:56,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:11:56,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:11:56,927 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 17:11:56,928 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 17:11:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:57,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:11:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:57,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:11:57,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {2494#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(17, 2);call #Ultimate.allocInit(12, 3); {2494#true} is VALID [2022-02-20 17:11:57,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {2494#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem18#1, main_#t~post17#1, main_#t~ret19#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~a0~0#1.base, main_~a0~0#1.offset, main_~i~1#1, main_~space~1#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~n~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {2494#true} is VALID [2022-02-20 17:11:57,283 INFO L272 TraceCheckUtils]: 2: Hoare triple {2494#true} call assume_abort_if_not((if main_~n~0#1 >= 0 && main_~n~0#1 < 1073741824 then 1 else 0)); {2494#true} is VALID [2022-02-20 17:11:57,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {2494#true} ~cond := #in~cond; {2494#true} is VALID [2022-02-20 17:11:57,283 INFO L290 TraceCheckUtils]: 4: Hoare triple {2494#true} assume !(0 == ~cond); {2494#true} is VALID [2022-02-20 17:11:57,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {2494#true} assume true; {2494#true} is VALID [2022-02-20 17:11:57,283 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2494#true} {2494#true} #129#return; {2494#true} is VALID [2022-02-20 17:11:57,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {2494#true} assume { :begin_inline_is_pow2 } true;is_pow2_#in~x#1 := main_~n~0#1;havoc is_pow2_#res#1;havoc is_pow2_~x#1;is_pow2_~x#1 := is_pow2_#in~x#1; {2494#true} is VALID [2022-02-20 17:11:57,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {2494#true} assume !(0 == (if is_pow2_~x#1 % 4294967296 < 0 && 0 != is_pow2_~x#1 % 4294967296 % 2 then is_pow2_~x#1 % 4294967296 % 2 - 2 else is_pow2_~x#1 % 4294967296 % 2) % 4294967296 && is_pow2_~x#1 % 4294967296 > 1); {2494#true} is VALID [2022-02-20 17:11:57,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {2494#true} is_pow2_#res#1 := (if 1 == is_pow2_~x#1 % 4294967296 then 1 else 0); {2494#true} is VALID [2022-02-20 17:11:57,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {2494#true} main_#t~ret14#1 := is_pow2_#res#1;assume { :end_inline_is_pow2 } true;assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647; {2494#true} is VALID [2022-02-20 17:11:57,283 INFO L272 TraceCheckUtils]: 11: Hoare triple {2494#true} call assume_abort_if_not(main_#t~ret14#1); {2494#true} is VALID [2022-02-20 17:11:57,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {2494#true} ~cond := #in~cond; {2494#true} is VALID [2022-02-20 17:11:57,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#true} assume !(0 == ~cond); {2494#true} is VALID [2022-02-20 17:11:57,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {2494#true} assume true; {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2494#true} {2494#true} #131#return; {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {2494#true} havoc main_#t~ret14#1;call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L272 TraceCheckUtils]: 17: Hoare triple {2494#true} call #Ultimate.meminit(main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {2494#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {2494#true} assume true; {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2494#true} {2494#true} #133#return; {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {2494#true} main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;call main_#t~malloc16#1.base, main_#t~malloc16#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1); {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L272 TraceCheckUtils]: 22: Hoare triple {2494#true} call #Ultimate.meminit(main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_~n~0#1, 4, 4 * main_~n~0#1); {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {2494#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {2494#true} assume true; {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2494#true} {2494#true} #135#return; {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {2494#true} main_~a0~0#1.base, main_~a0~0#1.offset := main_#t~malloc16#1.base, main_#t~malloc16#1.offset;havoc main_~i~1#1;main_~i~1#1 := 0; {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {2494#true} assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem18#1; {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L290 TraceCheckUtils]: 28: Hoare triple {2494#true} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {2494#true} assume !!(main_~i~1#1 < main_~n~0#1);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);call write~int(main_#t~mem18#1, main_~a0~0#1.base, main_~a0~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem18#1; {2494#true} is VALID [2022-02-20 17:11:57,284 INFO L290 TraceCheckUtils]: 30: Hoare triple {2494#true} main_#t~post17#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {2494#true} is VALID [2022-02-20 17:11:57,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {2494#true} assume !(main_~i~1#1 < main_~n~0#1); {2494#true} is VALID [2022-02-20 17:11:57,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {2494#true} assume { :begin_inline_upsweep } true;upsweep_#in~a#1.base, upsweep_#in~a#1.offset, upsweep_#in~n#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc upsweep_#res#1;havoc upsweep_#t~mem5#1, upsweep_#t~mem6#1, upsweep_~right~0#1, upsweep_~left~0#1, upsweep_~a#1.base, upsweep_~a#1.offset, upsweep_~n#1, upsweep_~space~0#1;upsweep_~a#1.base, upsweep_~a#1.offset := upsweep_#in~a#1.base, upsweep_#in~a#1.offset;upsweep_~n#1 := upsweep_#in~n#1;upsweep_~space~0#1 := 1; {2618#(<= 1 |ULTIMATE.start_upsweep_~space~0#1|)} is VALID [2022-02-20 17:11:57,285 INFO L290 TraceCheckUtils]: 33: Hoare triple {2618#(<= 1 |ULTIMATE.start_upsweep_~space~0#1|)} assume !!(upsweep_~space~0#1 < upsweep_~n#1);upsweep_~left~0#1 := upsweep_~space~0#1 - 1; {2618#(<= 1 |ULTIMATE.start_upsweep_~space~0#1|)} is VALID [2022-02-20 17:11:57,285 INFO L290 TraceCheckUtils]: 34: Hoare triple {2618#(<= 1 |ULTIMATE.start_upsweep_~space~0#1|)} assume !!(upsweep_~left~0#1 < upsweep_~n#1);upsweep_~right~0#1 := upsweep_~left~0#1 + upsweep_~space~0#1;call upsweep_#t~mem5#1 := read~int(upsweep_~a#1.base, upsweep_~a#1.offset + 4 * upsweep_~left~0#1, 4);call upsweep_#t~mem6#1 := read~int(upsweep_~a#1.base, upsweep_~a#1.offset + 4 * upsweep_~right~0#1, 4);call write~int(upsweep_#t~mem5#1 + upsweep_#t~mem6#1, upsweep_~a#1.base, upsweep_~a#1.offset + 4 * upsweep_~right~0#1, 4);havoc upsweep_#t~mem5#1;havoc upsweep_#t~mem6#1;upsweep_~left~0#1 := upsweep_~left~0#1 + 2 * upsweep_~space~0#1; {2618#(<= 1 |ULTIMATE.start_upsweep_~space~0#1|)} is VALID [2022-02-20 17:11:57,286 INFO L290 TraceCheckUtils]: 35: Hoare triple {2618#(<= 1 |ULTIMATE.start_upsweep_~space~0#1|)} assume !(upsweep_~left~0#1 < upsweep_~n#1); {2618#(<= 1 |ULTIMATE.start_upsweep_~space~0#1|)} is VALID [2022-02-20 17:11:57,286 INFO L290 TraceCheckUtils]: 36: Hoare triple {2618#(<= 1 |ULTIMATE.start_upsweep_~space~0#1|)} upsweep_~space~0#1 := 2 * upsweep_~space~0#1; {2515#(<= 2 |ULTIMATE.start_upsweep_~space~0#1|)} is VALID [2022-02-20 17:11:57,286 INFO L290 TraceCheckUtils]: 37: Hoare triple {2515#(<= 2 |ULTIMATE.start_upsweep_~space~0#1|)} assume !(upsweep_~space~0#1 < upsweep_~n#1); {2515#(<= 2 |ULTIMATE.start_upsweep_~space~0#1|)} is VALID [2022-02-20 17:11:57,287 INFO L290 TraceCheckUtils]: 38: Hoare triple {2515#(<= 2 |ULTIMATE.start_upsweep_~space~0#1|)} upsweep_#res#1 := upsweep_~space~0#1; {2516#(<= 2 |ULTIMATE.start_upsweep_#res#1|)} is VALID [2022-02-20 17:11:57,288 INFO L290 TraceCheckUtils]: 39: Hoare triple {2516#(<= 2 |ULTIMATE.start_upsweep_#res#1|)} main_#t~ret19#1 := upsweep_#res#1;assume { :end_inline_upsweep } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647;main_~space~1#1 := main_#t~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_downsweep } true;downsweep_#in~a#1.base, downsweep_#in~a#1.offset, downsweep_#in~n#1, downsweep_#in~space#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1, main_~space~1#1;havoc downsweep_#t~mem7#1, downsweep_#t~mem8#1, downsweep_#t~mem9#1, downsweep_~left~1#1, downsweep_~temp~0#1, downsweep_~right~1#1, downsweep_~a#1.base, downsweep_~a#1.offset, downsweep_~n#1, downsweep_~space#1;downsweep_~a#1.base, downsweep_~a#1.offset := downsweep_#in~a#1.base, downsweep_#in~a#1.offset;downsweep_~n#1 := downsweep_#in~n#1;downsweep_~space#1 := downsweep_#in~space#1;call write~int(0, downsweep_~a#1.base, downsweep_~a#1.offset + 4 * (downsweep_~n#1 - 1), 4);downsweep_~space#1 := (if downsweep_~space#1 < 0 && 0 != downsweep_~space#1 % 2 then 1 + downsweep_~space#1 / 2 else downsweep_~space#1 / 2); {2517#(<= 1 |ULTIMATE.start_downsweep_~space#1|)} is VALID [2022-02-20 17:11:57,288 INFO L290 TraceCheckUtils]: 40: Hoare triple {2517#(<= 1 |ULTIMATE.start_downsweep_~space#1|)} assume !(downsweep_~space#1 > 0); {2495#false} is VALID [2022-02-20 17:11:57,288 INFO L290 TraceCheckUtils]: 41: Hoare triple {2495#false} assume { :end_inline_downsweep } true;assume { :begin_inline_check } true;check_#in~a0#1.base, check_#in~a0#1.offset, check_#in~a#1.base, check_#in~a#1.offset, check_#in~n#1 := main_~a0~0#1.base, main_~a0~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1;havoc check_#t~mem11#1, check_#t~mem12#1, check_#t~post10#1, check_~a0#1.base, check_~a0#1.offset, check_~a#1.base, check_~a#1.offset, check_~n#1, check_~i~0#1, check_~sum~0#1;check_~a0#1.base, check_~a0#1.offset := check_#in~a0#1.base, check_#in~a0#1.offset;check_~a#1.base, check_~a#1.offset := check_#in~a#1.base, check_#in~a#1.offset;check_~n#1 := check_#in~n#1;havoc check_~i~0#1;check_~sum~0#1 := 0;check_~i~0#1 := 0; {2495#false} is VALID [2022-02-20 17:11:57,288 INFO L290 TraceCheckUtils]: 42: Hoare triple {2495#false} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2495#false} is VALID [2022-02-20 17:11:57,288 INFO L290 TraceCheckUtils]: 43: Hoare triple {2495#false} assume !(0 == __VERIFIER_assert_~cond#1); {2495#false} is VALID [2022-02-20 17:11:57,288 INFO L290 TraceCheckUtils]: 44: Hoare triple {2495#false} assume { :end_inline___VERIFIER_assert } true;havoc check_#t~mem11#1;call check_#t~mem12#1 := read~int(check_~a0#1.base, check_~a0#1.offset + 4 * check_~i~0#1, 4);check_~sum~0#1 := check_~sum~0#1 + check_#t~mem12#1;havoc check_#t~mem12#1; {2495#false} is VALID [2022-02-20 17:11:57,288 INFO L290 TraceCheckUtils]: 45: Hoare triple {2495#false} check_#t~post10#1 := check_~i~0#1;check_~i~0#1 := 1 + check_#t~post10#1;havoc check_#t~post10#1; {2495#false} is VALID [2022-02-20 17:11:57,288 INFO L290 TraceCheckUtils]: 46: Hoare triple {2495#false} assume !!(check_~i~0#1 < check_~n#1);call check_#t~mem11#1 := read~int(check_~a#1.base, check_~a#1.offset + 4 * check_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if check_~sum~0#1 == check_#t~mem11#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2495#false} is VALID [2022-02-20 17:11:57,288 INFO L290 TraceCheckUtils]: 47: Hoare triple {2495#false} assume 0 == __VERIFIER_assert_~cond#1; {2495#false} is VALID [2022-02-20 17:11:57,288 INFO L290 TraceCheckUtils]: 48: Hoare triple {2495#false} assume !false; {2495#false} is VALID [2022-02-20 17:11:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 17:11:57,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:11:57,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345948996] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:11:57,289 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:11:57,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 12 [2022-02-20 17:11:57,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996158966] [2022-02-20 17:11:57,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:11:57,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-02-20 17:11:57,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:11:57,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:11:57,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:11:57,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:11:57,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:11:57,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:11:57,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:11:57,321 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4)