/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/prefixsum_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:45:19,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:45:19,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:45:19,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:45:19,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:45:19,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:45:19,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:45:19,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:45:19,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:45:19,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:45:19,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:45:19,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:45:19,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:45:19,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:45:19,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:45:19,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:45:19,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:45:19,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:45:19,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:45:19,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:45:19,621 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:45:19,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:45:19,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:45:19,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:45:19,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:45:19,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:45:19,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:45:19,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:45:19,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:45:19,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:45:19,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:45:19,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:45:19,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:45:19,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:45:19,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:45:19,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:45:19,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:45:19,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:45:19,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:45:19,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:45:19,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:45:19,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:45:19,643 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:45:19,668 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:45:19,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:45:19,669 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:45:19,669 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:45:19,670 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:45:19,670 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:45:19,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:45:19,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:45:19,670 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:45:19,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:45:19,671 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:45:19,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:45:19,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:45:19,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:45:19,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:45:19,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:45:19,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:45:19,672 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:45:19,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:45:19,673 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:45:19,673 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:45:19,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:45:19,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:45:19,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:45:19,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:45:19,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:45:19,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:45:19,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:45:19,674 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:45:19,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:45:19,674 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:45:19,674 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:45:19,674 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:45:19,674 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:45:19,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:45:19,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:45:19,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:45:19,883 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:45:19,883 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:45:19,884 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/prefixsum_iter.c [2022-04-27 11:45:19,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00d126037/1253e77a882e4b8bb342ad7ec9ff2b8e/FLAGdbeae81cf [2022-04-27 11:45:20,276 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:45:20,277 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c [2022-04-27 11:45:20,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00d126037/1253e77a882e4b8bb342ad7ec9ff2b8e/FLAGdbeae81cf [2022-04-27 11:45:20,290 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00d126037/1253e77a882e4b8bb342ad7ec9ff2b8e [2022-04-27 11:45:20,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:45:20,292 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:45:20,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:45:20,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:45:20,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:45:20,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:45:20" (1/1) ... [2022-04-27 11:45:20,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aab585a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:20, skipping insertion in model container [2022-04-27 11:45:20,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:45:20" (1/1) ... [2022-04-27 11:45:20,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:45:20,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:45:20,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c[526,539] [2022-04-27 11:45:20,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:45:20,485 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:45:20,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c[526,539] [2022-04-27 11:45:20,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:45:20,513 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:45:20,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:20 WrapperNode [2022-04-27 11:45:20,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:45:20,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:45:20,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:45:20,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:45:20,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:20" (1/1) ... [2022-04-27 11:45:20,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:20" (1/1) ... [2022-04-27 11:45:20,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:20" (1/1) ... [2022-04-27 11:45:20,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:20" (1/1) ... [2022-04-27 11:45:20,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:20" (1/1) ... [2022-04-27 11:45:20,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:20" (1/1) ... [2022-04-27 11:45:20,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:20" (1/1) ... [2022-04-27 11:45:20,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:45:20,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:45:20,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:45:20,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:45:20,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:20" (1/1) ... [2022-04-27 11:45:20,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:45:20,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:20,570 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-04-27 11:45:20,572 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-04-27 11:45:20,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:45:20,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:45:20,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:45:20,594 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:45:20,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:45:20,594 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2022-04-27 11:45:20,594 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2022-04-27 11:45:20,594 INFO L138 BoogieDeclarations]: Found implementation of procedure is_pow2 [2022-04-27 11:45:20,594 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-04-27 11:45:20,594 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:45:20,594 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 11:45:20,594 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 11:45:20,594 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-27 11:45:20,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:45:20,595 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:45:20,595 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:45:20,595 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:45:20,595 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:45:20,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:45:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:45:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2022-04-27 11:45:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:45:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:45:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2022-04-27 11:45:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure is_pow2 [2022-04-27 11:45:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-04-27 11:45:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:45:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 11:45:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 11:45:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:45:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:45:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:45:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:45:20,658 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:45:20,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:45:23,017 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:45:23,022 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:45:23,022 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-04-27 11:45:23,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:45:23 BoogieIcfgContainer [2022-04-27 11:45:23,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:45:23,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:45:23,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:45:23,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:45:23,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:45:20" (1/3) ... [2022-04-27 11:45:23,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4566f6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:45:23, skipping insertion in model container [2022-04-27 11:45:23,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:20" (2/3) ... [2022-04-27 11:45:23,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4566f6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:45:23, skipping insertion in model container [2022-04-27 11:45:23,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:45:23" (3/3) ... [2022-04-27 11:45:23,035 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2022-04-27 11:45:23,047 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:45:23,047 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:45:23,078 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:45:23,083 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7912f5d0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e43d16e [2022-04-27 11:45:23,083 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:45:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 11 states have call successors, (11), 9 states have call predecessors, (11), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 11:45:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 11:45:23,094 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:23,095 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:23,095 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash 242194828, now seen corresponding path program 1 times [2022-04-27 11:45:23,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:23,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392449520] [2022-04-27 11:45:23,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:23,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {67#true} is VALID [2022-04-27 11:45:23,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 11:45:23,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} #160#return; {67#true} is VALID [2022-04-27 11:45:23,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-27 11:45:23,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-27 11:45:23,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-27 11:45:23,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68#false} {67#true} #142#return; {68#false} is VALID [2022-04-27 11:45:23,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:45:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} ~x := #in~x; {67#true} is VALID [2022-04-27 11:45:23,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {67#true} is VALID [2022-04-27 11:45:23,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {67#true} is VALID [2022-04-27 11:45:23,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 11:45:23,312 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67#true} {68#false} #144#return; {68#false} is VALID [2022-04-27 11:45:23,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 11:45:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-27 11:45:23,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-27 11:45:23,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-27 11:45:23,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68#false} {68#false} #146#return; {68#false} is VALID [2022-04-27 11:45:23,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 11:45:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {67#true} is VALID [2022-04-27 11:45:23,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 11:45:23,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {68#false} #148#return; {68#false} is VALID [2022-04-27 11:45:23,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-27 11:45:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {67#true} is VALID [2022-04-27 11:45:23,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 11:45:23,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {68#false} #150#return; {68#false} is VALID [2022-04-27 11:45:23,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-27 11:45:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {67#true} is VALID [2022-04-27 11:45:23,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume !(~space~0 < ~n); {67#true} is VALID [2022-04-27 11:45:23,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} #res := ~space~0; {67#true} is VALID [2022-04-27 11:45:23,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 11:45:23,379 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {67#true} {68#false} #152#return; {68#false} is VALID [2022-04-27 11:45:23,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-27 11:45:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {67#true} is VALID [2022-04-27 11:45:23,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume !(~space > 0); {67#true} is VALID [2022-04-27 11:45:23,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 11:45:23,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {68#false} #154#return; {68#false} is VALID [2022-04-27 11:45:23,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {67#true} call ULTIMATE.init(); {100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:23,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {67#true} is VALID [2022-04-27 11:45:23,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 11:45:23,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #160#return; {67#true} is VALID [2022-04-27 11:45:23,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret20 := main(); {67#true} is VALID [2022-04-27 11:45:23,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {67#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {67#true} is VALID [2022-04-27 11:45:23,396 INFO L272 TraceCheckUtils]: 6: Hoare triple {67#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {67#true} is VALID [2022-04-27 11:45:23,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-27 11:45:23,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-27 11:45:23,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-27 11:45:23,397 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {68#false} {67#true} #142#return; {68#false} is VALID [2022-04-27 11:45:23,398 INFO L272 TraceCheckUtils]: 11: Hoare triple {68#false} call #t~ret14 := is_pow2(~n~0); {67#true} is VALID [2022-04-27 11:45:23,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {67#true} ~x := #in~x; {67#true} is VALID [2022-04-27 11:45:23,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {67#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {67#true} is VALID [2022-04-27 11:45:23,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {67#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {67#true} is VALID [2022-04-27 11:45:23,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 11:45:23,399 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {67#true} {68#false} #144#return; {68#false} is VALID [2022-04-27 11:45:23,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {68#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {68#false} is VALID [2022-04-27 11:45:23,403 INFO L272 TraceCheckUtils]: 18: Hoare triple {68#false} call assume_abort_if_not(#t~ret14); {67#true} is VALID [2022-04-27 11:45:23,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {67#true} ~cond := #in~cond; {67#true} is VALID [2022-04-27 11:45:23,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {67#true} assume 0 == ~cond;assume false; {68#false} is VALID [2022-04-27 11:45:23,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {68#false} assume true; {68#false} is VALID [2022-04-27 11:45:23,409 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {68#false} {68#false} #146#return; {68#false} is VALID [2022-04-27 11:45:23,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {68#false} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {68#false} is VALID [2022-04-27 11:45:23,410 INFO L272 TraceCheckUtils]: 24: Hoare triple {68#false} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {101#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:23,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {67#true} is VALID [2022-04-27 11:45:23,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 11:45:23,412 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {67#true} {68#false} #148#return; {68#false} is VALID [2022-04-27 11:45:23,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {68#false} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {68#false} is VALID [2022-04-27 11:45:23,412 INFO L272 TraceCheckUtils]: 29: Hoare triple {68#false} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {101#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:23,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {67#true} is VALID [2022-04-27 11:45:23,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 11:45:23,413 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {67#true} {68#false} #150#return; {68#false} is VALID [2022-04-27 11:45:23,413 INFO L290 TraceCheckUtils]: 33: Hoare triple {68#false} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {68#false} is VALID [2022-04-27 11:45:23,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {68#false} assume !(~i~1 < ~n~0); {68#false} is VALID [2022-04-27 11:45:23,413 INFO L272 TraceCheckUtils]: 35: Hoare triple {68#false} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {101#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:23,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {67#true} is VALID [2022-04-27 11:45:23,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {67#true} assume !(~space~0 < ~n); {67#true} is VALID [2022-04-27 11:45:23,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {67#true} #res := ~space~0; {67#true} is VALID [2022-04-27 11:45:23,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 11:45:23,414 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {67#true} {68#false} #152#return; {68#false} is VALID [2022-04-27 11:45:23,414 INFO L290 TraceCheckUtils]: 41: Hoare triple {68#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {68#false} is VALID [2022-04-27 11:45:23,414 INFO L272 TraceCheckUtils]: 42: Hoare triple {68#false} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {101#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:23,414 INFO L290 TraceCheckUtils]: 43: Hoare triple {101#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {67#true} is VALID [2022-04-27 11:45:23,415 INFO L290 TraceCheckUtils]: 44: Hoare triple {67#true} assume !(~space > 0); {67#true} is VALID [2022-04-27 11:45:23,415 INFO L290 TraceCheckUtils]: 45: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 11:45:23,415 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {67#true} {68#false} #154#return; {68#false} is VALID [2022-04-27 11:45:23,415 INFO L272 TraceCheckUtils]: 47: Hoare triple {68#false} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {68#false} is VALID [2022-04-27 11:45:23,415 INFO L290 TraceCheckUtils]: 48: Hoare triple {68#false} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {68#false} is VALID [2022-04-27 11:45:23,415 INFO L290 TraceCheckUtils]: 49: Hoare triple {68#false} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {68#false} is VALID [2022-04-27 11:45:23,415 INFO L272 TraceCheckUtils]: 50: Hoare triple {68#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {68#false} is VALID [2022-04-27 11:45:23,416 INFO L290 TraceCheckUtils]: 51: Hoare triple {68#false} ~cond := #in~cond; {68#false} is VALID [2022-04-27 11:45:23,416 INFO L290 TraceCheckUtils]: 52: Hoare triple {68#false} assume 0 == ~cond; {68#false} is VALID [2022-04-27 11:45:23,416 INFO L290 TraceCheckUtils]: 53: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-04-27 11:45:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:45:23,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:23,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392449520] [2022-04-27 11:45:23,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392449520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:45:23,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:45:23,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:45:23,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214056326] [2022-04-27 11:45:23,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:45:23,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2022-04-27 11:45:23,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:23,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 11:45:23,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:23,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:45:23,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:23,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:45:23,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:45:23,522 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 11 states have call successors, (11), 9 states have call predecessors, (11), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 11:45:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:26,096 INFO L93 Difference]: Finished difference Result 127 states and 171 transitions. [2022-04-27 11:45:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:45:26,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2022-04-27 11:45:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 11:45:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2022-04-27 11:45:26,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 11:45:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2022-04-27 11:45:26,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 171 transitions. [2022-04-27 11:45:26,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:26,268 INFO L225 Difference]: With dead ends: 127 [2022-04-27 11:45:26,268 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 11:45:26,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:45:26,273 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 81 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:26,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 59 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:45:26,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 11:45:26,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2022-04-27 11:45:26,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:26,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:45:26,307 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:45:26,307 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:45:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:26,315 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-27 11:45:26,315 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-27 11:45:26,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:26,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:26,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 63 states. [2022-04-27 11:45:26,318 INFO L87 Difference]: Start difference. First operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 63 states. [2022-04-27 11:45:26,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:26,330 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-27 11:45:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-27 11:45:26,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:26,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:26,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:26,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:45:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-04-27 11:45:26,346 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 54 [2022-04-27 11:45:26,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:26,346 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-04-27 11:45:26,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 11:45:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-04-27 11:45:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-27 11:45:26,353 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:26,353 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:26,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:45:26,354 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:26,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:26,354 INFO L85 PathProgramCache]: Analyzing trace with hash -73515768, now seen corresponding path program 1 times [2022-04-27 11:45:26,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:26,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862134223] [2022-04-27 11:45:26,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:26,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:26,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:26,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {495#true} is VALID [2022-04-27 11:45:26,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {495#true} {495#true} #160#return; {495#true} is VALID [2022-04-27 11:45:26,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:26,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {495#true} ~cond := #in~cond; {495#true} is VALID [2022-04-27 11:45:26,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#true} assume !(0 == ~cond); {495#true} is VALID [2022-04-27 11:45:26,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {495#true} {495#true} #142#return; {495#true} is VALID [2022-04-27 11:45:26,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:45:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:26,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {495#true} ~x := #in~x; {495#true} is VALID [2022-04-27 11:45:26,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {495#true} is VALID [2022-04-27 11:45:26,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {495#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {495#true} is VALID [2022-04-27 11:45:26,500 INFO L290 TraceCheckUtils]: 3: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,500 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {495#true} {495#true} #144#return; {495#true} is VALID [2022-04-27 11:45:26,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 11:45:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:26,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {495#true} ~cond := #in~cond; {495#true} is VALID [2022-04-27 11:45:26,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#true} assume !(0 == ~cond); {495#true} is VALID [2022-04-27 11:45:26,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {495#true} {495#true} #146#return; {495#true} is VALID [2022-04-27 11:45:26,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 11:45:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:26,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {533#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {495#true} is VALID [2022-04-27 11:45:26,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,515 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {495#true} {495#true} #148#return; {495#true} is VALID [2022-04-27 11:45:26,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-27 11:45:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:26,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {533#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {495#true} is VALID [2022-04-27 11:45:26,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {495#true} {495#true} #150#return; {495#true} is VALID [2022-04-27 11:45:26,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-27 11:45:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:26,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {533#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {495#true} is VALID [2022-04-27 11:45:26,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#true} assume !(~space~0 < ~n); {495#true} is VALID [2022-04-27 11:45:26,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {495#true} #res := ~space~0; {495#true} is VALID [2022-04-27 11:45:26,524 INFO L290 TraceCheckUtils]: 3: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,525 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {495#true} {520#(<= main_~n~0 0)} #152#return; {520#(<= main_~n~0 0)} is VALID [2022-04-27 11:45:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-27 11:45:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:26,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {533#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {495#true} is VALID [2022-04-27 11:45:26,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#true} assume !(~space > 0); {495#true} is VALID [2022-04-27 11:45:26,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {495#true} {520#(<= main_~n~0 0)} #154#return; {520#(<= main_~n~0 0)} is VALID [2022-04-27 11:45:26,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {495#true} call ULTIMATE.init(); {532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:26,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {495#true} is VALID [2022-04-27 11:45:26,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {495#true} {495#true} #160#return; {495#true} is VALID [2022-04-27 11:45:26,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {495#true} call #t~ret20 := main(); {495#true} is VALID [2022-04-27 11:45:26,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {495#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {495#true} is VALID [2022-04-27 11:45:26,535 INFO L272 TraceCheckUtils]: 6: Hoare triple {495#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {495#true} is VALID [2022-04-27 11:45:26,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {495#true} ~cond := #in~cond; {495#true} is VALID [2022-04-27 11:45:26,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {495#true} assume !(0 == ~cond); {495#true} is VALID [2022-04-27 11:45:26,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,536 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {495#true} {495#true} #142#return; {495#true} is VALID [2022-04-27 11:45:26,536 INFO L272 TraceCheckUtils]: 11: Hoare triple {495#true} call #t~ret14 := is_pow2(~n~0); {495#true} is VALID [2022-04-27 11:45:26,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {495#true} ~x := #in~x; {495#true} is VALID [2022-04-27 11:45:26,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {495#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {495#true} is VALID [2022-04-27 11:45:26,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {495#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {495#true} is VALID [2022-04-27 11:45:26,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,536 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {495#true} {495#true} #144#return; {495#true} is VALID [2022-04-27 11:45:26,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {495#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {495#true} is VALID [2022-04-27 11:45:26,536 INFO L272 TraceCheckUtils]: 18: Hoare triple {495#true} call assume_abort_if_not(#t~ret14); {495#true} is VALID [2022-04-27 11:45:26,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {495#true} ~cond := #in~cond; {495#true} is VALID [2022-04-27 11:45:26,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {495#true} assume !(0 == ~cond); {495#true} is VALID [2022-04-27 11:45:26,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,537 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {495#true} {495#true} #146#return; {495#true} is VALID [2022-04-27 11:45:26,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {495#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {495#true} is VALID [2022-04-27 11:45:26,538 INFO L272 TraceCheckUtils]: 24: Hoare triple {495#true} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {533#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:26,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {533#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {495#true} is VALID [2022-04-27 11:45:26,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,538 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {495#true} {495#true} #148#return; {495#true} is VALID [2022-04-27 11:45:26,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {495#true} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {495#true} is VALID [2022-04-27 11:45:26,539 INFO L272 TraceCheckUtils]: 29: Hoare triple {495#true} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {533#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:26,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {533#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {495#true} is VALID [2022-04-27 11:45:26,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,539 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {495#true} {495#true} #150#return; {495#true} is VALID [2022-04-27 11:45:26,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {495#true} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {519#(= main_~i~1 0)} is VALID [2022-04-27 11:45:26,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {519#(= main_~i~1 0)} assume !(~i~1 < ~n~0); {520#(<= main_~n~0 0)} is VALID [2022-04-27 11:45:26,541 INFO L272 TraceCheckUtils]: 35: Hoare triple {520#(<= main_~n~0 0)} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {533#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:26,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {533#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {495#true} is VALID [2022-04-27 11:45:26,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {495#true} assume !(~space~0 < ~n); {495#true} is VALID [2022-04-27 11:45:26,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {495#true} #res := ~space~0; {495#true} is VALID [2022-04-27 11:45:26,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,542 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {495#true} {520#(<= main_~n~0 0)} #152#return; {520#(<= main_~n~0 0)} is VALID [2022-04-27 11:45:26,542 INFO L290 TraceCheckUtils]: 41: Hoare triple {520#(<= main_~n~0 0)} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {520#(<= main_~n~0 0)} is VALID [2022-04-27 11:45:26,543 INFO L272 TraceCheckUtils]: 42: Hoare triple {520#(<= main_~n~0 0)} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {533#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:26,543 INFO L290 TraceCheckUtils]: 43: Hoare triple {533#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {495#true} is VALID [2022-04-27 11:45:26,543 INFO L290 TraceCheckUtils]: 44: Hoare triple {495#true} assume !(~space > 0); {495#true} is VALID [2022-04-27 11:45:26,543 INFO L290 TraceCheckUtils]: 45: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-27 11:45:26,544 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {495#true} {520#(<= main_~n~0 0)} #154#return; {520#(<= main_~n~0 0)} is VALID [2022-04-27 11:45:26,545 INFO L272 TraceCheckUtils]: 47: Hoare triple {520#(<= main_~n~0 0)} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {530#(<= |check_#in~n| 0)} is VALID [2022-04-27 11:45:26,545 INFO L290 TraceCheckUtils]: 48: Hoare triple {530#(<= |check_#in~n| 0)} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {531#(and (<= check_~n 0) (= check_~i~0 0))} is VALID [2022-04-27 11:45:26,546 INFO L290 TraceCheckUtils]: 49: Hoare triple {531#(and (<= check_~n 0) (= check_~i~0 0))} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {496#false} is VALID [2022-04-27 11:45:26,546 INFO L272 TraceCheckUtils]: 50: Hoare triple {496#false} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {496#false} is VALID [2022-04-27 11:45:26,546 INFO L290 TraceCheckUtils]: 51: Hoare triple {496#false} ~cond := #in~cond; {496#false} is VALID [2022-04-27 11:45:26,546 INFO L290 TraceCheckUtils]: 52: Hoare triple {496#false} assume 0 == ~cond; {496#false} is VALID [2022-04-27 11:45:26,546 INFO L290 TraceCheckUtils]: 53: Hoare triple {496#false} assume !false; {496#false} is VALID [2022-04-27 11:45:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:45:26,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:26,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862134223] [2022-04-27 11:45:26,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862134223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:45:26,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:45:26,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 11:45:26,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840353251] [2022-04-27 11:45:26,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:45:26,548 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2022-04-27 11:45:26,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:26,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 11:45:26,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:26,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:45:26,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:26,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:45:26,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:45:26,584 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 11:45:30,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 11:45:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:36,090 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-27 11:45:36,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:45:36,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2022-04-27 11:45:36,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:36,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 11:45:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-27 11:45:36,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 11:45:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-27 11:45:36,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-27 11:45:36,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:36,184 INFO L225 Difference]: With dead ends: 81 [2022-04-27 11:45:36,184 INFO L226 Difference]: Without dead ends: 65 [2022-04-27 11:45:36,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:45:36,185 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 84 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:36,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 55 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 306 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 11:45:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-27 11:45:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2022-04-27 11:45:36,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:36,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 58 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:45:36,199 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 58 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:45:36,200 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 58 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:45:36,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:36,204 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-04-27 11:45:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-04-27 11:45:36,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:36,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:36,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 65 states. [2022-04-27 11:45:36,205 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 65 states. [2022-04-27 11:45:36,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:36,207 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-04-27 11:45:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2022-04-27 11:45:36,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:36,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:36,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:36,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:45:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-04-27 11:45:36,210 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 54 [2022-04-27 11:45:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:36,211 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-04-27 11:45:36,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 5 states have internal predecessors, (30), 3 states have call successors, (11), 5 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 11:45:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-04-27 11:45:36,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 11:45:36,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:36,214 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:36,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:45:36,214 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:36,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:36,215 INFO L85 PathProgramCache]: Analyzing trace with hash -628313814, now seen corresponding path program 1 times [2022-04-27 11:45:36,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:36,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739737309] [2022-04-27 11:45:36,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:36,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:36,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:36,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {882#true} is VALID [2022-04-27 11:45:36,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {882#true} assume true; {882#true} is VALID [2022-04-27 11:45:36,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {882#true} {882#true} #160#return; {882#true} is VALID [2022-04-27 11:45:36,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:36,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {882#true} ~cond := #in~cond; {882#true} is VALID [2022-04-27 11:45:36,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {882#true} assume !(0 == ~cond); {882#true} is VALID [2022-04-27 11:45:36,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {882#true} assume true; {882#true} is VALID [2022-04-27 11:45:36,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {882#true} {882#true} #142#return; {882#true} is VALID [2022-04-27 11:45:36,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:45:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:36,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {882#true} ~x := #in~x; {882#true} is VALID [2022-04-27 11:45:36,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {882#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {882#true} is VALID [2022-04-27 11:45:36,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {882#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {882#true} is VALID [2022-04-27 11:45:36,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {882#true} assume true; {882#true} is VALID [2022-04-27 11:45:36,471 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {882#true} {882#true} #144#return; {882#true} is VALID [2022-04-27 11:45:36,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 11:45:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:36,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {882#true} ~cond := #in~cond; {882#true} is VALID [2022-04-27 11:45:36,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {882#true} assume !(0 == ~cond); {882#true} is VALID [2022-04-27 11:45:36,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {882#true} assume true; {882#true} is VALID [2022-04-27 11:45:36,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {882#true} {882#true} #146#return; {882#true} is VALID [2022-04-27 11:45:36,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 11:45:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:36,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {926#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:45:36,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {926#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {926#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:45:36,523 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {926#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {900#(= (select |#valid| |main_#t~malloc15.base|) 1)} #148#return; {904#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} is VALID [2022-04-27 11:45:36,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-27 11:45:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:36,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {927#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-27 11:45:36,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {927#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {927#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-27 11:45:36,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {927#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {905#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} #150#return; {905#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} is VALID [2022-04-27 11:45:36,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 11:45:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:36,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:36,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} assume !(~space~0 < ~n); {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:36,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} #res := ~space~0; {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:36,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} assume true; {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:36,552 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {925#(= |#memory_int| |old(#memory_int)|)} {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} #152#return; {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-27 11:45:36,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-27 11:45:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:36,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {928#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} is VALID [2022-04-27 11:45:36,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} assume !(~space > 0); {928#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} is VALID [2022-04-27 11:45:36,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {928#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} assume true; {928#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} is VALID [2022-04-27 11:45:36,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {928#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} #154#return; {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-27 11:45:36,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {882#true} call ULTIMATE.init(); {924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:36,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {882#true} is VALID [2022-04-27 11:45:36,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {882#true} assume true; {882#true} is VALID [2022-04-27 11:45:36,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {882#true} {882#true} #160#return; {882#true} is VALID [2022-04-27 11:45:36,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {882#true} call #t~ret20 := main(); {882#true} is VALID [2022-04-27 11:45:36,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {882#true} assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~n~0 := #t~nondet13;havoc #t~nondet13; {882#true} is VALID [2022-04-27 11:45:36,595 INFO L272 TraceCheckUtils]: 6: Hoare triple {882#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {882#true} is VALID [2022-04-27 11:45:36,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {882#true} ~cond := #in~cond; {882#true} is VALID [2022-04-27 11:45:36,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {882#true} assume !(0 == ~cond); {882#true} is VALID [2022-04-27 11:45:36,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {882#true} assume true; {882#true} is VALID [2022-04-27 11:45:36,596 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {882#true} {882#true} #142#return; {882#true} is VALID [2022-04-27 11:45:36,596 INFO L272 TraceCheckUtils]: 11: Hoare triple {882#true} call #t~ret14 := is_pow2(~n~0); {882#true} is VALID [2022-04-27 11:45:36,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {882#true} ~x := #in~x; {882#true} is VALID [2022-04-27 11:45:36,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {882#true} assume !(0 == (if ~x % 4294967296 < 0 && 0 != ~x % 4294967296 % 2 then ~x % 4294967296 % 2 - 2 else ~x % 4294967296 % 2) % 4294967296 && ~x % 4294967296 > 1); {882#true} is VALID [2022-04-27 11:45:36,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {882#true} #res := (if 1 == ~x % 4294967296 then 1 else 0); {882#true} is VALID [2022-04-27 11:45:36,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {882#true} assume true; {882#true} is VALID [2022-04-27 11:45:36,596 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {882#true} {882#true} #144#return; {882#true} is VALID [2022-04-27 11:45:36,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {882#true} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {882#true} is VALID [2022-04-27 11:45:36,596 INFO L272 TraceCheckUtils]: 18: Hoare triple {882#true} call assume_abort_if_not(#t~ret14); {882#true} is VALID [2022-04-27 11:45:36,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {882#true} ~cond := #in~cond; {882#true} is VALID [2022-04-27 11:45:36,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {882#true} assume !(0 == ~cond); {882#true} is VALID [2022-04-27 11:45:36,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {882#true} assume true; {882#true} is VALID [2022-04-27 11:45:36,597 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {882#true} {882#true} #146#return; {882#true} is VALID [2022-04-27 11:45:36,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {882#true} havoc #t~ret14;call #t~malloc15.base, #t~malloc15.offset := #Ultimate.allocOnHeap(4 * ~n~0); {900#(= (select |#valid| |main_#t~malloc15.base|) 1)} is VALID [2022-04-27 11:45:36,598 INFO L272 TraceCheckUtils]: 24: Hoare triple {900#(= (select |#valid| |main_#t~malloc15.base|) 1)} call #Ultimate.meminit(#t~malloc15.base, #t~malloc15.offset, ~n~0, 4, 4 * ~n~0); {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:36,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {926#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:45:36,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {926#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {926#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:45:36,600 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {926#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {900#(= (select |#valid| |main_#t~malloc15.base|) 1)} #148#return; {904#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} is VALID [2022-04-27 11:45:36,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {904#(and (= (select |#valid| |main_#t~malloc15.base|) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc15.base|)))} ~a~0.base, ~a~0.offset := #t~malloc15.base, #t~malloc15.offset;call #t~malloc16.base, #t~malloc16.offset := #Ultimate.allocOnHeap(4 * ~n~0); {905#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} is VALID [2022-04-27 11:45:36,601 INFO L272 TraceCheckUtils]: 29: Hoare triple {905#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} call #Ultimate.meminit(#t~malloc16.base, #t~malloc16.offset, ~n~0, 4, 4 * ~n~0); {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:36,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {927#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-27 11:45:36,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {927#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} assume true; {927#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} is VALID [2022-04-27 11:45:36,603 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {927#(= |#memory_int| (store |old(#memory_int)| |#Ultimate.meminit_#ptr.base| (select |#memory_int| |#Ultimate.meminit_#ptr.base|)))} {905#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} #150#return; {905#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} is VALID [2022-04-27 11:45:36,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {905#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= |main_#t~malloc16.base| main_~a~0.base)))} ~a0~0.base, ~a0~0.offset := #t~malloc16.base, #t~malloc16.offset;havoc ~i~1;~i~1 := 0; {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-27 11:45:36,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} assume !!(~i~1 < ~n~0);call #t~mem18 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~1, 4);call write~int(#t~mem18, ~a0~0.base, ~a0~0.offset + 4 * ~i~1, 4);havoc #t~mem18; {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-27 11:45:36,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} #t~post17 := ~i~1;~i~1 := 1 + #t~post17;havoc #t~post17; {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-27 11:45:36,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} assume !(~i~1 < ~n~0); {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-27 11:45:36,610 INFO L272 TraceCheckUtils]: 37: Hoare triple {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} call #t~ret19 := upsweep(~a~0.base, ~a~0.offset, ~n~0); {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:36,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space~0 := 1; {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:36,611 INFO L290 TraceCheckUtils]: 39: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} assume !(~space~0 < ~n); {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:36,611 INFO L290 TraceCheckUtils]: 40: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} #res := ~space~0; {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:36,612 INFO L290 TraceCheckUtils]: 41: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} assume true; {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:36,625 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {925#(= |#memory_int| |old(#memory_int)|)} {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} #152#return; {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-27 11:45:36,625 INFO L290 TraceCheckUtils]: 43: Hoare triple {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647;~space~1 := #t~ret19;havoc #t~ret19; {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-27 11:45:36,626 INFO L272 TraceCheckUtils]: 44: Hoare triple {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} call downsweep(~a~0.base, ~a~0.offset, ~n~0, ~space~1); {925#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:36,628 INFO L290 TraceCheckUtils]: 45: Hoare triple {925#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~space := #in~space;call write~int(0, ~a.base, ~a.offset + 4 * (~n - 1), 4);~space := (if ~space < 0 && 0 != ~space % 2 then 1 + ~space / 2 else ~space / 2); {928#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} is VALID [2022-04-27 11:45:36,629 INFO L290 TraceCheckUtils]: 46: Hoare triple {928#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} assume !(~space > 0); {928#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} is VALID [2022-04-27 11:45:36,631 INFO L290 TraceCheckUtils]: 47: Hoare triple {928#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} assume true; {928#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} is VALID [2022-04-27 11:45:36,634 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {928#(or (= (select |old(#memory_int)| |downsweep_#in~a.base|) (select |#memory_int| |downsweep_#in~a.base|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |downsweep_#in~a.base|))))} {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} #154#return; {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} is VALID [2022-04-27 11:45:36,635 INFO L272 TraceCheckUtils]: 49: Hoare triple {909#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (not (= main_~a~0.base main_~a0~0.base)))} call check(~a0~0.base, ~a0~0.offset, ~a~0.base, ~a~0.offset, ~n~0); {919#(= (select (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))) 0)} is VALID [2022-04-27 11:45:36,635 INFO L290 TraceCheckUtils]: 50: Hoare triple {919#(= (select (select |#memory_int| |check_#in~a.base|) (@diff (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))) 0)} ~a0.base, ~a0.offset := #in~a0.base, #in~a0.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;havoc ~i~0;~sum~0 := 0;~i~0 := 0; {920#(= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) check_~a.offset)) check_~sum~0)} is VALID [2022-04-27 11:45:36,636 INFO L290 TraceCheckUtils]: 51: Hoare triple {920#(= (select (select |#memory_int| check_~a.base) (+ (* check_~i~0 4) check_~a.offset)) check_~sum~0)} assume !!(~i~0 < ~n);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); {921#(= |check_#t~mem11| check_~sum~0)} is VALID [2022-04-27 11:45:36,636 INFO L272 TraceCheckUtils]: 52: Hoare triple {921#(= |check_#t~mem11| check_~sum~0)} call __VERIFIER_assert((if ~sum~0 == #t~mem11 then 1 else 0)); {922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:36,637 INFO L290 TraceCheckUtils]: 53: Hoare triple {922#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {923#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:45:36,637 INFO L290 TraceCheckUtils]: 54: Hoare triple {923#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {883#false} is VALID [2022-04-27 11:45:36,637 INFO L290 TraceCheckUtils]: 55: Hoare triple {883#false} assume !false; {883#false} is VALID [2022-04-27 11:45:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:45:36,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:36,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739737309] [2022-04-27 11:45:36,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739737309] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:45:36,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838309511] [2022-04-27 11:45:36,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:36,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:36,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:36,640 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-04-27 11:45:36,655 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-04-27 11:45:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:36,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-27 11:45:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:36,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:45:36,852 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-04-27 11:45:36,918 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-04-27 11:45:37,000 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-27 11:45:37,001 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-04-27 11:45:37,030 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_51 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_51) |c_#memory_int|)) is different from true [2022-04-27 11:45:37,063 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-04-27 11:45:37,113 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-04-27 11:45:37,768 WARN L855 $PredicateComparison]: unable to prove that (exists ((downsweep_~n Int) (downsweep_~a.offset Int)) (= (store |c_old(#memory_int)| |c_downsweep_#in~a.base| (store (select |c_old(#memory_int)| |c_downsweep_#in~a.base|) (+ (* downsweep_~n 4) downsweep_~a.offset (- 4)) 0)) |c_#memory_int|)) is different from true [2022-04-27 11:45:37,790 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-04-27 11:45:37,901 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 24 treesize of output 18 [2022-04-27 11:45:37,945 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-27 11:45:37,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 11:45:38,146 WARN L477 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-04-27 11:45:38,146 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 54481 column 92: unknown constant v_arrayElimCell_6 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-27 11:45:38,150 INFO L158 Benchmark]: Toolchain (without parser) took 17857.83ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 146.7MB in the beginning and 127.2MB in the end (delta: 19.5MB). Peak memory consumption was 60.3MB. Max. memory is 8.0GB. [2022-04-27 11:45:38,150 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 197.1MB. Free memory is still 163.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:45:38,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.54ms. Allocated memory is still 197.1MB. Free memory was 146.5MB in the beginning and 170.1MB in the end (delta: -23.6MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-04-27 11:45:38,151 INFO L158 Benchmark]: Boogie Preprocessor took 31.59ms. Allocated memory is still 197.1MB. Free memory was 170.1MB in the beginning and 168.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:45:38,151 INFO L158 Benchmark]: RCFGBuilder took 2474.79ms. Allocated memory is still 197.1MB. Free memory was 168.0MB in the beginning and 150.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-27 11:45:38,151 INFO L158 Benchmark]: TraceAbstraction took 15124.65ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 150.2MB in the beginning and 127.2MB in the end (delta: 23.0MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. [2022-04-27 11:45:38,153 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 197.1MB. Free memory is still 163.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.54ms. Allocated memory is still 197.1MB. Free memory was 146.5MB in the beginning and 170.1MB in the end (delta: -23.6MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.59ms. Allocated memory is still 197.1MB. Free memory was 170.1MB in the beginning and 168.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 2474.79ms. Allocated memory is still 197.1MB. Free memory was 168.0MB in the beginning and 150.8MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 15124.65ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 150.2MB in the beginning and 127.2MB in the end (delta: 23.0MB). Peak memory consumption was 64.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 54481 column 92: unknown constant v_arrayElimCell_6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 54481 column 92: unknown constant v_arrayElimCell_6: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-27 11:45:38,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 1 Received shutdown request...