./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/reducercommutativity/rangesum.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 279fae57395782089eff32ec1396d1726d808c7f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 14:27:20,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 14:27:20,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 14:27:20,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 14:27:20,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 14:27:20,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 14:27:20,870 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 14:27:20,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 14:27:20,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 14:27:20,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 14:27:20,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 14:27:20,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 14:27:20,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 14:27:20,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 14:27:20,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 14:27:20,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 14:27:20,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 14:27:20,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 14:27:20,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 14:27:20,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 14:27:20,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 14:27:20,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 14:27:20,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 14:27:20,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 14:27:20,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 14:27:20,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 14:27:20,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 14:27:20,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 14:27:20,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 14:27:20,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 14:27:20,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 14:27:20,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 14:27:20,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 14:27:20,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 14:27:20,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 14:27:20,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 14:27:20,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 14:27:20,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 14:27:20,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 14:27:20,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 14:27:20,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 14:27:20,932 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 14:27:20,957 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 14:27:20,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 14:27:20,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 14:27:20,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 14:27:20,961 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 14:27:20,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 14:27:20,961 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 14:27:20,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 14:27:20,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 14:27:20,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 14:27:20,963 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 14:27:20,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 14:27:20,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 14:27:20,964 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 14:27:20,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 14:27:20,965 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 14:27:20,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 14:27:20,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 14:27:20,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 14:27:20,966 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 14:27:20,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 14:27:20,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:27:20,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 14:27:20,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 14:27:20,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 14:27:20,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 14:27:20,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 14:27:20,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 14:27:20,968 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 14:27:20,969 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 279fae57395782089eff32ec1396d1726d808c7f [2020-07-28 14:27:21,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 14:27:21,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 14:27:21,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 14:27:21,300 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 14:27:21,300 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 14:27:21,301 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum.i [2020-07-28 14:27:21,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69509892e/66de37cb1fa7458b83d7cf61e29d7f0c/FLAG97983cad4 [2020-07-28 14:27:21,906 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 14:27:21,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum.i [2020-07-28 14:27:21,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69509892e/66de37cb1fa7458b83d7cf61e29d7f0c/FLAG97983cad4 [2020-07-28 14:27:22,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69509892e/66de37cb1fa7458b83d7cf61e29d7f0c [2020-07-28 14:27:22,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 14:27:22,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 14:27:22,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 14:27:22,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 14:27:22,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 14:27:22,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:27:22" (1/1) ... [2020-07-28 14:27:22,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56f1924f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:27:22, skipping insertion in model container [2020-07-28 14:27:22,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 02:27:22" (1/1) ... [2020-07-28 14:27:22,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 14:27:22,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 14:27:22,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:27:22,550 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 14:27:22,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 14:27:22,652 INFO L208 MainTranslator]: Completed translation [2020-07-28 14:27:22,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:27:22 WrapperNode [2020-07-28 14:27:22,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 14:27:22,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 14:27:22,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 14:27:22,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 14:27:22,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:27:22" (1/1) ... [2020-07-28 14:27:22,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:27:22" (1/1) ... [2020-07-28 14:27:22,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 14:27:22,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 14:27:22,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 14:27:22,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 14:27:22,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:27:22" (1/1) ... [2020-07-28 14:27:22,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:27:22" (1/1) ... [2020-07-28 14:27:22,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:27:22" (1/1) ... [2020-07-28 14:27:22,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:27:22" (1/1) ... [2020-07-28 14:27:22,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:27:22" (1/1) ... [2020-07-28 14:27:22,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:27:22" (1/1) ... [2020-07-28 14:27:22,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:27:22" (1/1) ... [2020-07-28 14:27:22,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 14:27:22,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 14:27:22,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 14:27:22,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 14:27:22,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:27:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 14:27:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 14:27:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 14:27:22,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 14:27:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 14:27:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 14:27:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 14:27:23,433 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 14:27:23,433 INFO L295 CfgBuilder]: Removed 17 assume(true) statements. [2020-07-28 14:27:23,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:27:23 BoogieIcfgContainer [2020-07-28 14:27:23,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 14:27:23,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 14:27:23,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 14:27:23,443 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 14:27:23,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 02:27:22" (1/3) ... [2020-07-28 14:27:23,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc1ceee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:27:23, skipping insertion in model container [2020-07-28 14:27:23,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 02:27:22" (2/3) ... [2020-07-28 14:27:23,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dc1ceee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 02:27:23, skipping insertion in model container [2020-07-28 14:27:23,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:27:23" (3/3) ... [2020-07-28 14:27:23,447 INFO L109 eAbstractionObserver]: Analyzing ICFG rangesum.i [2020-07-28 14:27:23,458 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 14:27:23,466 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 14:27:23,480 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 14:27:23,502 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 14:27:23,502 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 14:27:23,502 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 14:27:23,502 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 14:27:23,503 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 14:27:23,503 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 14:27:23,503 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 14:27:23,504 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 14:27:23,519 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-28 14:27:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 14:27:23,525 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:27:23,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:27:23,527 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:27:23,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:27:23,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1829542603, now seen corresponding path program 1 times [2020-07-28 14:27:23,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:27:23,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332110914] [2020-07-28 14:27:23,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:27:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:23,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {35#true} is VALID [2020-07-28 14:27:23,700 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {35#true} is VALID [2020-07-28 14:27:23,700 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; {35#true} is VALID [2020-07-28 14:27:23,702 INFO L280 TraceCheckUtils]: 3: Hoare triple {35#true} assume !true; {36#false} is VALID [2020-07-28 14:27:23,702 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#false} havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {36#false} is VALID [2020-07-28 14:27:23,703 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#false} assume !true; {36#false} is VALID [2020-07-28 14:27:23,703 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#false} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {36#false} is VALID [2020-07-28 14:27:23,704 INFO L280 TraceCheckUtils]: 7: Hoare triple {36#false} main_#t~ret5 := rangesum_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {36#false} is VALID [2020-07-28 14:27:23,704 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#false} assume !(rangesum_~i~1 < ~N~0); {36#false} is VALID [2020-07-28 14:27:23,705 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#false} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {36#false} is VALID [2020-07-28 14:27:23,705 INFO L280 TraceCheckUtils]: 10: Hoare triple {36#false} main_#t~ret8 := rangesum_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; {36#false} is VALID [2020-07-28 14:27:23,706 INFO L280 TraceCheckUtils]: 11: Hoare triple {36#false} assume !true; {36#false} is VALID [2020-07-28 14:27:23,707 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#false} call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {36#false} is VALID [2020-07-28 14:27:23,707 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#false} assume !true; {36#false} is VALID [2020-07-28 14:27:23,707 INFO L280 TraceCheckUtils]: 14: Hoare triple {36#false} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {36#false} is VALID [2020-07-28 14:27:23,708 INFO L280 TraceCheckUtils]: 15: Hoare triple {36#false} main_#t~ret12 := rangesum_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647;main_~ret5~0 := main_#t~ret12;havoc main_#t~ret12; {36#false} is VALID [2020-07-28 14:27:23,708 INFO L280 TraceCheckUtils]: 16: Hoare triple {36#false} assume main_~ret~1 != main_~ret2~0 || main_~ret~1 != main_~ret5~0; {36#false} is VALID [2020-07-28 14:27:23,709 INFO L280 TraceCheckUtils]: 17: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-28 14:27:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:27:23,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332110914] [2020-07-28 14:27:23,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:27:23,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 14:27:23,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200968930] [2020-07-28 14:27:23,723 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2020-07-28 14:27:23,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:27:23,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 14:27:23,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:23,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 14:27:23,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:27:23,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 14:27:23,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:27:23,784 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2020-07-28 14:27:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:24,028 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2020-07-28 14:27:24,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 14:27:24,028 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2020-07-28 14:27:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:27:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:27:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2020-07-28 14:27:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 14:27:24,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2020-07-28 14:27:24,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 90 transitions. [2020-07-28 14:27:24,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:24,271 INFO L225 Difference]: With dead ends: 59 [2020-07-28 14:27:24,272 INFO L226 Difference]: Without dead ends: 27 [2020-07-28 14:27:24,278 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 14:27:24,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-28 14:27:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-28 14:27:24,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:27:24,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-28 14:27:24,328 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-28 14:27:24,328 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-28 14:27:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:24,336 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2020-07-28 14:27:24,336 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-07-28 14:27:24,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:24,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:24,338 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-28 14:27:24,338 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-28 14:27:24,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:24,347 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2020-07-28 14:27:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-07-28 14:27:24,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:24,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:24,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:27:24,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:27:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-28 14:27:24,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-07-28 14:27:24,354 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 18 [2020-07-28 14:27:24,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:27:24,355 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-07-28 14:27:24,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 14:27:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-07-28 14:27:24,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 14:27:24,357 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:27:24,357 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:27:24,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 14:27:24,358 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:27:24,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:27:24,358 INFO L82 PathProgramCache]: Analyzing trace with hash -97699309, now seen corresponding path program 1 times [2020-07-28 14:27:24,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:27:24,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772536499] [2020-07-28 14:27:24,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:27:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:24,431 INFO L280 TraceCheckUtils]: 0: Hoare triple {204#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {204#true} is VALID [2020-07-28 14:27:24,432 INFO L280 TraceCheckUtils]: 1: Hoare triple {204#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {204#true} is VALID [2020-07-28 14:27:24,434 INFO L280 TraceCheckUtils]: 2: Hoare triple {204#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; {206#(and (<= 2 ~N~0) (= 0 ULTIMATE.start_init_nondet_~i~0))} is VALID [2020-07-28 14:27:24,435 INFO L280 TraceCheckUtils]: 3: Hoare triple {206#(and (<= 2 ~N~0) (= 0 ULTIMATE.start_init_nondet_~i~0))} assume !(init_nondet_~i~0 < ~N~0); {205#false} is VALID [2020-07-28 14:27:24,436 INFO L280 TraceCheckUtils]: 4: Hoare triple {205#false} havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {205#false} is VALID [2020-07-28 14:27:24,436 INFO L280 TraceCheckUtils]: 5: Hoare triple {205#false} assume !(rangesum_~i~1 < ~N~0); {205#false} is VALID [2020-07-28 14:27:24,436 INFO L280 TraceCheckUtils]: 6: Hoare triple {205#false} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {205#false} is VALID [2020-07-28 14:27:24,437 INFO L280 TraceCheckUtils]: 7: Hoare triple {205#false} main_#t~ret5 := rangesum_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {205#false} is VALID [2020-07-28 14:27:24,437 INFO L280 TraceCheckUtils]: 8: Hoare triple {205#false} assume !(rangesum_~i~1 < ~N~0); {205#false} is VALID [2020-07-28 14:27:24,437 INFO L280 TraceCheckUtils]: 9: Hoare triple {205#false} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {205#false} is VALID [2020-07-28 14:27:24,438 INFO L280 TraceCheckUtils]: 10: Hoare triple {205#false} main_#t~ret8 := rangesum_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; {205#false} is VALID [2020-07-28 14:27:24,438 INFO L280 TraceCheckUtils]: 11: Hoare triple {205#false} assume !(main_~i~2 < ~N~0 - 1); {205#false} is VALID [2020-07-28 14:27:24,439 INFO L280 TraceCheckUtils]: 12: Hoare triple {205#false} call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {205#false} is VALID [2020-07-28 14:27:24,439 INFO L280 TraceCheckUtils]: 13: Hoare triple {205#false} assume !(rangesum_~i~1 < ~N~0); {205#false} is VALID [2020-07-28 14:27:24,440 INFO L280 TraceCheckUtils]: 14: Hoare triple {205#false} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {205#false} is VALID [2020-07-28 14:27:24,440 INFO L280 TraceCheckUtils]: 15: Hoare triple {205#false} main_#t~ret12 := rangesum_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647;main_~ret5~0 := main_#t~ret12;havoc main_#t~ret12; {205#false} is VALID [2020-07-28 14:27:24,440 INFO L280 TraceCheckUtils]: 16: Hoare triple {205#false} assume main_~ret~1 != main_~ret2~0 || main_~ret~1 != main_~ret5~0; {205#false} is VALID [2020-07-28 14:27:24,441 INFO L280 TraceCheckUtils]: 17: Hoare triple {205#false} assume !false; {205#false} is VALID [2020-07-28 14:27:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:27:24,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772536499] [2020-07-28 14:27:24,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:27:24,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 14:27:24,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15783663] [2020-07-28 14:27:24,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-28 14:27:24,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:27:24,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 14:27:24,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:24,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 14:27:24,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:27:24,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 14:27:24,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 14:27:24,482 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2020-07-28 14:27:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:24,875 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2020-07-28 14:27:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 14:27:24,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-28 14:27:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:27:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 14:27:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2020-07-28 14:27:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 14:27:24,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2020-07-28 14:27:24,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2020-07-28 14:27:24,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:24,994 INFO L225 Difference]: With dead ends: 51 [2020-07-28 14:27:24,994 INFO L226 Difference]: Without dead ends: 29 [2020-07-28 14:27:24,996 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 14:27:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-28 14:27:25,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-07-28 14:27:25,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:27:25,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2020-07-28 14:27:25,007 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2020-07-28 14:27:25,007 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2020-07-28 14:27:25,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:25,011 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2020-07-28 14:27:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2020-07-28 14:27:25,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:25,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:25,012 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2020-07-28 14:27:25,013 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2020-07-28 14:27:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:25,015 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2020-07-28 14:27:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2020-07-28 14:27:25,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:25,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:25,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:27:25,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:27:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 14:27:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-07-28 14:27:25,021 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 18 [2020-07-28 14:27:25,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:27:25,021 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-28 14:27:25,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 14:27:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-07-28 14:27:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 14:27:25,023 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:27:25,023 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:27:25,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 14:27:25,024 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:27:25,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:27:25,024 INFO L82 PathProgramCache]: Analyzing trace with hash -230084431, now seen corresponding path program 1 times [2020-07-28 14:27:25,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:27:25,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094485485] [2020-07-28 14:27:25,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:27:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:25,127 INFO L280 TraceCheckUtils]: 0: Hoare triple {371#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {371#true} is VALID [2020-07-28 14:27:25,127 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {371#true} is VALID [2020-07-28 14:27:25,129 INFO L280 TraceCheckUtils]: 2: Hoare triple {371#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; {373#(and (<= 2 ~N~0) (= 0 ULTIMATE.start_init_nondet_~i~0))} is VALID [2020-07-28 14:27:25,131 INFO L280 TraceCheckUtils]: 3: Hoare triple {373#(and (<= 2 ~N~0) (= 0 ULTIMATE.start_init_nondet_~i~0))} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {373#(and (<= 2 ~N~0) (= 0 ULTIMATE.start_init_nondet_~i~0))} is VALID [2020-07-28 14:27:25,133 INFO L280 TraceCheckUtils]: 4: Hoare triple {373#(and (<= 2 ~N~0) (= 0 ULTIMATE.start_init_nondet_~i~0))} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {374#(<= (+ ULTIMATE.start_init_nondet_~i~0 1) ~N~0)} is VALID [2020-07-28 14:27:25,134 INFO L280 TraceCheckUtils]: 5: Hoare triple {374#(<= (+ ULTIMATE.start_init_nondet_~i~0 1) ~N~0)} assume !(init_nondet_~i~0 < ~N~0); {372#false} is VALID [2020-07-28 14:27:25,134 INFO L280 TraceCheckUtils]: 6: Hoare triple {372#false} havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {372#false} is VALID [2020-07-28 14:27:25,135 INFO L280 TraceCheckUtils]: 7: Hoare triple {372#false} assume !(rangesum_~i~1 < ~N~0); {372#false} is VALID [2020-07-28 14:27:25,135 INFO L280 TraceCheckUtils]: 8: Hoare triple {372#false} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {372#false} is VALID [2020-07-28 14:27:25,135 INFO L280 TraceCheckUtils]: 9: Hoare triple {372#false} main_#t~ret5 := rangesum_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {372#false} is VALID [2020-07-28 14:27:25,136 INFO L280 TraceCheckUtils]: 10: Hoare triple {372#false} assume !(rangesum_~i~1 < ~N~0); {372#false} is VALID [2020-07-28 14:27:25,136 INFO L280 TraceCheckUtils]: 11: Hoare triple {372#false} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {372#false} is VALID [2020-07-28 14:27:25,137 INFO L280 TraceCheckUtils]: 12: Hoare triple {372#false} main_#t~ret8 := rangesum_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; {372#false} is VALID [2020-07-28 14:27:25,137 INFO L280 TraceCheckUtils]: 13: Hoare triple {372#false} assume !(main_~i~2 < ~N~0 - 1); {372#false} is VALID [2020-07-28 14:27:25,137 INFO L280 TraceCheckUtils]: 14: Hoare triple {372#false} call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {372#false} is VALID [2020-07-28 14:27:25,138 INFO L280 TraceCheckUtils]: 15: Hoare triple {372#false} assume !(rangesum_~i~1 < ~N~0); {372#false} is VALID [2020-07-28 14:27:25,138 INFO L280 TraceCheckUtils]: 16: Hoare triple {372#false} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {372#false} is VALID [2020-07-28 14:27:25,138 INFO L280 TraceCheckUtils]: 17: Hoare triple {372#false} main_#t~ret12 := rangesum_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647;main_~ret5~0 := main_#t~ret12;havoc main_#t~ret12; {372#false} is VALID [2020-07-28 14:27:25,139 INFO L280 TraceCheckUtils]: 18: Hoare triple {372#false} assume main_~ret~1 != main_~ret2~0 || main_~ret~1 != main_~ret5~0; {372#false} is VALID [2020-07-28 14:27:25,139 INFO L280 TraceCheckUtils]: 19: Hoare triple {372#false} assume !false; {372#false} is VALID [2020-07-28 14:27:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:27:25,146 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094485485] [2020-07-28 14:27:25,146 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859901417] [2020-07-28 14:27:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:27:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:25,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 14:27:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:25,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:27:25,320 INFO L280 TraceCheckUtils]: 0: Hoare triple {371#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {371#true} is VALID [2020-07-28 14:27:25,321 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {371#true} is VALID [2020-07-28 14:27:25,321 INFO L280 TraceCheckUtils]: 2: Hoare triple {371#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; {371#true} is VALID [2020-07-28 14:27:25,322 INFO L280 TraceCheckUtils]: 3: Hoare triple {371#true} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {371#true} is VALID [2020-07-28 14:27:25,322 INFO L280 TraceCheckUtils]: 4: Hoare triple {371#true} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {371#true} is VALID [2020-07-28 14:27:25,322 INFO L280 TraceCheckUtils]: 5: Hoare triple {371#true} assume !(init_nondet_~i~0 < ~N~0); {371#true} is VALID [2020-07-28 14:27:25,324 INFO L280 TraceCheckUtils]: 6: Hoare triple {371#true} havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {396#(= 0 ULTIMATE.start_rangesum_~cnt~0)} is VALID [2020-07-28 14:27:25,326 INFO L280 TraceCheckUtils]: 7: Hoare triple {396#(= 0 ULTIMATE.start_rangesum_~cnt~0)} assume !(rangesum_~i~1 < ~N~0); {396#(= 0 ULTIMATE.start_rangesum_~cnt~0)} is VALID [2020-07-28 14:27:25,327 INFO L280 TraceCheckUtils]: 8: Hoare triple {396#(= 0 ULTIMATE.start_rangesum_~cnt~0)} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {372#false} is VALID [2020-07-28 14:27:25,327 INFO L280 TraceCheckUtils]: 9: Hoare triple {372#false} main_#t~ret5 := rangesum_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {372#false} is VALID [2020-07-28 14:27:25,327 INFO L280 TraceCheckUtils]: 10: Hoare triple {372#false} assume !(rangesum_~i~1 < ~N~0); {372#false} is VALID [2020-07-28 14:27:25,328 INFO L280 TraceCheckUtils]: 11: Hoare triple {372#false} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {372#false} is VALID [2020-07-28 14:27:25,328 INFO L280 TraceCheckUtils]: 12: Hoare triple {372#false} main_#t~ret8 := rangesum_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; {372#false} is VALID [2020-07-28 14:27:25,331 INFO L280 TraceCheckUtils]: 13: Hoare triple {372#false} assume !(main_~i~2 < ~N~0 - 1); {372#false} is VALID [2020-07-28 14:27:25,332 INFO L280 TraceCheckUtils]: 14: Hoare triple {372#false} call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {372#false} is VALID [2020-07-28 14:27:25,332 INFO L280 TraceCheckUtils]: 15: Hoare triple {372#false} assume !(rangesum_~i~1 < ~N~0); {372#false} is VALID [2020-07-28 14:27:25,332 INFO L280 TraceCheckUtils]: 16: Hoare triple {372#false} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {372#false} is VALID [2020-07-28 14:27:25,333 INFO L280 TraceCheckUtils]: 17: Hoare triple {372#false} main_#t~ret12 := rangesum_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647;main_~ret5~0 := main_#t~ret12;havoc main_#t~ret12; {372#false} is VALID [2020-07-28 14:27:25,333 INFO L280 TraceCheckUtils]: 18: Hoare triple {372#false} assume main_~ret~1 != main_~ret2~0 || main_~ret~1 != main_~ret5~0; {372#false} is VALID [2020-07-28 14:27:25,333 INFO L280 TraceCheckUtils]: 19: Hoare triple {372#false} assume !false; {372#false} is VALID [2020-07-28 14:27:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 14:27:25,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 14:27:25,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-28 14:27:25,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633624284] [2020-07-28 14:27:25,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-28 14:27:25,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:27:25,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 14:27:25,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:25,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 14:27:25,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:27:25,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 14:27:25,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-28 14:27:25,370 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 3 states. [2020-07-28 14:27:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:25,555 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2020-07-28 14:27:25,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 14:27:25,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-28 14:27:25,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:27:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 14:27:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-28 14:27:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 14:27:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2020-07-28 14:27:25,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2020-07-28 14:27:25,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:25,714 INFO L225 Difference]: With dead ends: 66 [2020-07-28 14:27:25,714 INFO L226 Difference]: Without dead ends: 49 [2020-07-28 14:27:25,715 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-28 14:27:25,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-28 14:27:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2020-07-28 14:27:25,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:27:25,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 40 states. [2020-07-28 14:27:25,739 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 40 states. [2020-07-28 14:27:25,739 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 40 states. [2020-07-28 14:27:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:25,743 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2020-07-28 14:27:25,743 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2020-07-28 14:27:25,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:25,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:25,744 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 49 states. [2020-07-28 14:27:25,745 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 49 states. [2020-07-28 14:27:25,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:25,748 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2020-07-28 14:27:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2020-07-28 14:27:25,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:25,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:25,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:27:25,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:27:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-28 14:27:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2020-07-28 14:27:25,753 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 20 [2020-07-28 14:27:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:27:25,754 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2020-07-28 14:27:25,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 14:27:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2020-07-28 14:27:25,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 14:27:25,755 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:27:25,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:27:25,970 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 14:27:25,970 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:27:25,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:27:25,971 INFO L82 PathProgramCache]: Analyzing trace with hash 708198959, now seen corresponding path program 1 times [2020-07-28 14:27:25,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:27:25,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165283465] [2020-07-28 14:27:25,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:27:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:26,040 INFO L280 TraceCheckUtils]: 0: Hoare triple {673#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {673#true} is VALID [2020-07-28 14:27:26,041 INFO L280 TraceCheckUtils]: 1: Hoare triple {673#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {673#true} is VALID [2020-07-28 14:27:26,042 INFO L280 TraceCheckUtils]: 2: Hoare triple {673#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; {675#(and (<= 2 ~N~0) (= 0 ULTIMATE.start_init_nondet_~i~0))} is VALID [2020-07-28 14:27:26,043 INFO L280 TraceCheckUtils]: 3: Hoare triple {675#(and (<= 2 ~N~0) (= 0 ULTIMATE.start_init_nondet_~i~0))} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {675#(and (<= 2 ~N~0) (= 0 ULTIMATE.start_init_nondet_~i~0))} is VALID [2020-07-28 14:27:26,044 INFO L280 TraceCheckUtils]: 4: Hoare triple {675#(and (<= 2 ~N~0) (= 0 ULTIMATE.start_init_nondet_~i~0))} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {676#(<= (+ ULTIMATE.start_init_nondet_~i~0 1) ~N~0)} is VALID [2020-07-28 14:27:26,044 INFO L280 TraceCheckUtils]: 5: Hoare triple {676#(<= (+ ULTIMATE.start_init_nondet_~i~0 1) ~N~0)} assume !(init_nondet_~i~0 < ~N~0); {674#false} is VALID [2020-07-28 14:27:26,045 INFO L280 TraceCheckUtils]: 6: Hoare triple {674#false} havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {674#false} is VALID [2020-07-28 14:27:26,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {674#false} assume !(rangesum_~i~1 < ~N~0); {674#false} is VALID [2020-07-28 14:27:26,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {674#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {674#false} is VALID [2020-07-28 14:27:26,046 INFO L280 TraceCheckUtils]: 9: Hoare triple {674#false} main_#t~ret5 := rangesum_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {674#false} is VALID [2020-07-28 14:27:26,046 INFO L280 TraceCheckUtils]: 10: Hoare triple {674#false} assume !(rangesum_~i~1 < ~N~0); {674#false} is VALID [2020-07-28 14:27:26,046 INFO L280 TraceCheckUtils]: 11: Hoare triple {674#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {674#false} is VALID [2020-07-28 14:27:26,047 INFO L280 TraceCheckUtils]: 12: Hoare triple {674#false} main_#t~ret8 := rangesum_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; {674#false} is VALID [2020-07-28 14:27:26,047 INFO L280 TraceCheckUtils]: 13: Hoare triple {674#false} assume !(main_~i~2 < ~N~0 - 1); {674#false} is VALID [2020-07-28 14:27:26,047 INFO L280 TraceCheckUtils]: 14: Hoare triple {674#false} call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {674#false} is VALID [2020-07-28 14:27:26,048 INFO L280 TraceCheckUtils]: 15: Hoare triple {674#false} assume !(rangesum_~i~1 < ~N~0); {674#false} is VALID [2020-07-28 14:27:26,048 INFO L280 TraceCheckUtils]: 16: Hoare triple {674#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {674#false} is VALID [2020-07-28 14:27:26,048 INFO L280 TraceCheckUtils]: 17: Hoare triple {674#false} main_#t~ret12 := rangesum_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647;main_~ret5~0 := main_#t~ret12;havoc main_#t~ret12; {674#false} is VALID [2020-07-28 14:27:26,048 INFO L280 TraceCheckUtils]: 18: Hoare triple {674#false} assume main_~ret~1 != main_~ret2~0 || main_~ret~1 != main_~ret5~0; {674#false} is VALID [2020-07-28 14:27:26,049 INFO L280 TraceCheckUtils]: 19: Hoare triple {674#false} assume !false; {674#false} is VALID [2020-07-28 14:27:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:27:26,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165283465] [2020-07-28 14:27:26,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912359999] [2020-07-28 14:27:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:27:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:26,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 14:27:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:26,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:27:26,265 INFO L280 TraceCheckUtils]: 0: Hoare triple {673#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {673#true} is VALID [2020-07-28 14:27:26,265 INFO L280 TraceCheckUtils]: 1: Hoare triple {673#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {673#true} is VALID [2020-07-28 14:27:26,266 INFO L280 TraceCheckUtils]: 2: Hoare triple {673#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; {686#(and (<= ULTIMATE.start_init_nondet_~i~0 0) (< 1 ~N~0))} is VALID [2020-07-28 14:27:26,267 INFO L280 TraceCheckUtils]: 3: Hoare triple {686#(and (<= ULTIMATE.start_init_nondet_~i~0 0) (< 1 ~N~0))} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {686#(and (<= ULTIMATE.start_init_nondet_~i~0 0) (< 1 ~N~0))} is VALID [2020-07-28 14:27:26,268 INFO L280 TraceCheckUtils]: 4: Hoare triple {686#(and (<= ULTIMATE.start_init_nondet_~i~0 0) (< 1 ~N~0))} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {693#(and (< 1 ~N~0) (<= ULTIMATE.start_init_nondet_~i~0 1))} is VALID [2020-07-28 14:27:26,269 INFO L280 TraceCheckUtils]: 5: Hoare triple {693#(and (< 1 ~N~0) (<= ULTIMATE.start_init_nondet_~i~0 1))} assume !(init_nondet_~i~0 < ~N~0); {674#false} is VALID [2020-07-28 14:27:26,269 INFO L280 TraceCheckUtils]: 6: Hoare triple {674#false} havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {674#false} is VALID [2020-07-28 14:27:26,269 INFO L280 TraceCheckUtils]: 7: Hoare triple {674#false} assume !(rangesum_~i~1 < ~N~0); {674#false} is VALID [2020-07-28 14:27:26,269 INFO L280 TraceCheckUtils]: 8: Hoare triple {674#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {674#false} is VALID [2020-07-28 14:27:26,270 INFO L280 TraceCheckUtils]: 9: Hoare triple {674#false} main_#t~ret5 := rangesum_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {674#false} is VALID [2020-07-28 14:27:26,270 INFO L280 TraceCheckUtils]: 10: Hoare triple {674#false} assume !(rangesum_~i~1 < ~N~0); {674#false} is VALID [2020-07-28 14:27:26,270 INFO L280 TraceCheckUtils]: 11: Hoare triple {674#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {674#false} is VALID [2020-07-28 14:27:26,270 INFO L280 TraceCheckUtils]: 12: Hoare triple {674#false} main_#t~ret8 := rangesum_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; {674#false} is VALID [2020-07-28 14:27:26,271 INFO L280 TraceCheckUtils]: 13: Hoare triple {674#false} assume !(main_~i~2 < ~N~0 - 1); {674#false} is VALID [2020-07-28 14:27:26,271 INFO L280 TraceCheckUtils]: 14: Hoare triple {674#false} call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {674#false} is VALID [2020-07-28 14:27:26,271 INFO L280 TraceCheckUtils]: 15: Hoare triple {674#false} assume !(rangesum_~i~1 < ~N~0); {674#false} is VALID [2020-07-28 14:27:26,271 INFO L280 TraceCheckUtils]: 16: Hoare triple {674#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {674#false} is VALID [2020-07-28 14:27:26,272 INFO L280 TraceCheckUtils]: 17: Hoare triple {674#false} main_#t~ret12 := rangesum_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647;main_~ret5~0 := main_#t~ret12;havoc main_#t~ret12; {674#false} is VALID [2020-07-28 14:27:26,272 INFO L280 TraceCheckUtils]: 18: Hoare triple {674#false} assume main_~ret~1 != main_~ret2~0 || main_~ret~1 != main_~ret5~0; {674#false} is VALID [2020-07-28 14:27:26,272 INFO L280 TraceCheckUtils]: 19: Hoare triple {674#false} assume !false; {674#false} is VALID [2020-07-28 14:27:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 14:27:26,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:27:26,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-28 14:27:26,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815096054] [2020-07-28 14:27:26,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-28 14:27:26,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:27:26,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 14:27:26,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:26,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 14:27:26,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:27:26,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 14:27:26,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-28 14:27:26,315 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand 6 states. [2020-07-28 14:27:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:26,802 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2020-07-28 14:27:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 14:27:26,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-28 14:27:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:27:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 14:27:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2020-07-28 14:27:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 14:27:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2020-07-28 14:27:26,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2020-07-28 14:27:26,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:26,954 INFO L225 Difference]: With dead ends: 77 [2020-07-28 14:27:26,954 INFO L226 Difference]: Without dead ends: 43 [2020-07-28 14:27:26,955 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-28 14:27:26,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-28 14:27:26,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-07-28 14:27:26,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:27:26,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2020-07-28 14:27:26,967 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2020-07-28 14:27:26,967 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2020-07-28 14:27:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:26,969 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2020-07-28 14:27:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2020-07-28 14:27:26,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:26,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:26,970 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2020-07-28 14:27:26,970 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2020-07-28 14:27:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:26,972 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2020-07-28 14:27:26,972 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2020-07-28 14:27:26,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:26,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:26,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:27:26,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:27:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-28 14:27:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2020-07-28 14:27:26,975 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 20 [2020-07-28 14:27:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:27:26,975 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2020-07-28 14:27:26,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 14:27:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2020-07-28 14:27:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-28 14:27:26,976 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:27:26,977 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:27:27,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:27:27,189 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:27:27,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:27:27,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1959851699, now seen corresponding path program 2 times [2020-07-28 14:27:27,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:27:27,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776837900] [2020-07-28 14:27:27,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:27:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:27,275 INFO L280 TraceCheckUtils]: 0: Hoare triple {979#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {979#true} is VALID [2020-07-28 14:27:27,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {979#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {979#true} is VALID [2020-07-28 14:27:27,277 INFO L280 TraceCheckUtils]: 2: Hoare triple {979#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; {981#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:27,277 INFO L280 TraceCheckUtils]: 3: Hoare triple {981#(<= 2 ~N~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {981#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:27,279 INFO L280 TraceCheckUtils]: 4: Hoare triple {981#(<= 2 ~N~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {981#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:27,279 INFO L280 TraceCheckUtils]: 5: Hoare triple {981#(<= 2 ~N~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {981#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:27,280 INFO L280 TraceCheckUtils]: 6: Hoare triple {981#(<= 2 ~N~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {981#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:27,281 INFO L280 TraceCheckUtils]: 7: Hoare triple {981#(<= 2 ~N~0)} assume !(init_nondet_~i~0 < ~N~0); {981#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:27,282 INFO L280 TraceCheckUtils]: 8: Hoare triple {981#(<= 2 ~N~0)} havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {982#(and (<= 2 ~N~0) (= ULTIMATE.start_rangesum_~i~1 0))} is VALID [2020-07-28 14:27:27,283 INFO L280 TraceCheckUtils]: 9: Hoare triple {982#(and (<= 2 ~N~0) (= ULTIMATE.start_rangesum_~i~1 0))} assume !(rangesum_~i~1 < ~N~0); {980#false} is VALID [2020-07-28 14:27:27,283 INFO L280 TraceCheckUtils]: 10: Hoare triple {980#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {980#false} is VALID [2020-07-28 14:27:27,283 INFO L280 TraceCheckUtils]: 11: Hoare triple {980#false} main_#t~ret5 := rangesum_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {980#false} is VALID [2020-07-28 14:27:27,284 INFO L280 TraceCheckUtils]: 12: Hoare triple {980#false} assume !(rangesum_~i~1 < ~N~0); {980#false} is VALID [2020-07-28 14:27:27,284 INFO L280 TraceCheckUtils]: 13: Hoare triple {980#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {980#false} is VALID [2020-07-28 14:27:27,284 INFO L280 TraceCheckUtils]: 14: Hoare triple {980#false} main_#t~ret8 := rangesum_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; {980#false} is VALID [2020-07-28 14:27:27,285 INFO L280 TraceCheckUtils]: 15: Hoare triple {980#false} assume !(main_~i~2 < ~N~0 - 1); {980#false} is VALID [2020-07-28 14:27:27,285 INFO L280 TraceCheckUtils]: 16: Hoare triple {980#false} call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {980#false} is VALID [2020-07-28 14:27:27,285 INFO L280 TraceCheckUtils]: 17: Hoare triple {980#false} assume !(rangesum_~i~1 < ~N~0); {980#false} is VALID [2020-07-28 14:27:27,285 INFO L280 TraceCheckUtils]: 18: Hoare triple {980#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {980#false} is VALID [2020-07-28 14:27:27,286 INFO L280 TraceCheckUtils]: 19: Hoare triple {980#false} main_#t~ret12 := rangesum_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647;main_~ret5~0 := main_#t~ret12;havoc main_#t~ret12; {980#false} is VALID [2020-07-28 14:27:27,286 INFO L280 TraceCheckUtils]: 20: Hoare triple {980#false} assume main_~ret~1 != main_~ret2~0 || main_~ret~1 != main_~ret5~0; {980#false} is VALID [2020-07-28 14:27:27,286 INFO L280 TraceCheckUtils]: 21: Hoare triple {980#false} assume !false; {980#false} is VALID [2020-07-28 14:27:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-28 14:27:27,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776837900] [2020-07-28 14:27:27,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:27:27,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 14:27:27,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609326523] [2020-07-28 14:27:27,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-28 14:27:27,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:27:27,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 14:27:27,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:27,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 14:27:27,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:27:27,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 14:27:27,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:27:27,318 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand 4 states. [2020-07-28 14:27:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:27,732 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2020-07-28 14:27:27,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 14:27:27,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-28 14:27:27,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:27:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:27:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2020-07-28 14:27:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:27:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2020-07-28 14:27:27,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 82 transitions. [2020-07-28 14:27:27,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:27,856 INFO L225 Difference]: With dead ends: 81 [2020-07-28 14:27:27,856 INFO L226 Difference]: Without dead ends: 51 [2020-07-28 14:27:27,857 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:27:27,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-28 14:27:27,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2020-07-28 14:27:27,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:27:27,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 48 states. [2020-07-28 14:27:27,881 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 48 states. [2020-07-28 14:27:27,881 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 48 states. [2020-07-28 14:27:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:27,884 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2020-07-28 14:27:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2020-07-28 14:27:27,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:27,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:27,885 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 51 states. [2020-07-28 14:27:27,885 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 51 states. [2020-07-28 14:27:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:27,888 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2020-07-28 14:27:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2020-07-28 14:27:27,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:27,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:27,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:27:27,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:27:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-28 14:27:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2020-07-28 14:27:27,892 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2020-07-28 14:27:27,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:27:27,892 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2020-07-28 14:27:27,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 14:27:27,892 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2020-07-28 14:27:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-28 14:27:27,893 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:27:27,894 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-28 14:27:27,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-28 14:27:27,894 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:27:27,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:27:27,895 INFO L82 PathProgramCache]: Analyzing trace with hash -2075430575, now seen corresponding path program 1 times [2020-07-28 14:27:27,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:27:27,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126420993] [2020-07-28 14:27:27,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:27:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:27,978 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1257#true} is VALID [2020-07-28 14:27:27,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {1257#true} is VALID [2020-07-28 14:27:27,980 INFO L280 TraceCheckUtils]: 2: Hoare triple {1257#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; {1259#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:27,981 INFO L280 TraceCheckUtils]: 3: Hoare triple {1259#(<= 2 ~N~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {1259#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:27,982 INFO L280 TraceCheckUtils]: 4: Hoare triple {1259#(<= 2 ~N~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {1259#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:27,982 INFO L280 TraceCheckUtils]: 5: Hoare triple {1259#(<= 2 ~N~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {1259#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:27,983 INFO L280 TraceCheckUtils]: 6: Hoare triple {1259#(<= 2 ~N~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {1259#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:27,984 INFO L280 TraceCheckUtils]: 7: Hoare triple {1259#(<= 2 ~N~0)} assume !(init_nondet_~i~0 < ~N~0); {1259#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:27,985 INFO L280 TraceCheckUtils]: 8: Hoare triple {1259#(<= 2 ~N~0)} havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {1260#(and (<= 2 ~N~0) (= ULTIMATE.start_rangesum_~i~1 0))} is VALID [2020-07-28 14:27:27,986 INFO L280 TraceCheckUtils]: 9: Hoare triple {1260#(and (<= 2 ~N~0) (= ULTIMATE.start_rangesum_~i~1 0))} assume !!(rangesum_~i~1 < ~N~0); {1260#(and (<= 2 ~N~0) (= ULTIMATE.start_rangesum_~i~1 0))} is VALID [2020-07-28 14:27:27,987 INFO L280 TraceCheckUtils]: 10: Hoare triple {1260#(and (<= 2 ~N~0) (= ULTIMATE.start_rangesum_~i~1 0))} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1260#(and (<= 2 ~N~0) (= ULTIMATE.start_rangesum_~i~1 0))} is VALID [2020-07-28 14:27:27,988 INFO L280 TraceCheckUtils]: 11: Hoare triple {1260#(and (<= 2 ~N~0) (= ULTIMATE.start_rangesum_~i~1 0))} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1261#(<= (+ ULTIMATE.start_rangesum_~i~1 1) ~N~0)} is VALID [2020-07-28 14:27:27,989 INFO L280 TraceCheckUtils]: 12: Hoare triple {1261#(<= (+ ULTIMATE.start_rangesum_~i~1 1) ~N~0)} assume !(rangesum_~i~1 < ~N~0); {1258#false} is VALID [2020-07-28 14:27:27,989 INFO L280 TraceCheckUtils]: 13: Hoare triple {1258#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {1258#false} is VALID [2020-07-28 14:27:27,989 INFO L280 TraceCheckUtils]: 14: Hoare triple {1258#false} main_#t~ret5 := rangesum_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {1258#false} is VALID [2020-07-28 14:27:27,990 INFO L280 TraceCheckUtils]: 15: Hoare triple {1258#false} assume !!(rangesum_~i~1 < ~N~0); {1258#false} is VALID [2020-07-28 14:27:27,990 INFO L280 TraceCheckUtils]: 16: Hoare triple {1258#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1258#false} is VALID [2020-07-28 14:27:27,990 INFO L280 TraceCheckUtils]: 17: Hoare triple {1258#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1258#false} is VALID [2020-07-28 14:27:27,990 INFO L280 TraceCheckUtils]: 18: Hoare triple {1258#false} assume !(rangesum_~i~1 < ~N~0); {1258#false} is VALID [2020-07-28 14:27:27,991 INFO L280 TraceCheckUtils]: 19: Hoare triple {1258#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {1258#false} is VALID [2020-07-28 14:27:27,991 INFO L280 TraceCheckUtils]: 20: Hoare triple {1258#false} main_#t~ret8 := rangesum_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; {1258#false} is VALID [2020-07-28 14:27:27,991 INFO L280 TraceCheckUtils]: 21: Hoare triple {1258#false} assume !(main_~i~2 < ~N~0 - 1); {1258#false} is VALID [2020-07-28 14:27:27,992 INFO L280 TraceCheckUtils]: 22: Hoare triple {1258#false} call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {1258#false} is VALID [2020-07-28 14:27:27,992 INFO L280 TraceCheckUtils]: 23: Hoare triple {1258#false} assume !!(rangesum_~i~1 < ~N~0); {1258#false} is VALID [2020-07-28 14:27:27,992 INFO L280 TraceCheckUtils]: 24: Hoare triple {1258#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1258#false} is VALID [2020-07-28 14:27:27,992 INFO L280 TraceCheckUtils]: 25: Hoare triple {1258#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1258#false} is VALID [2020-07-28 14:27:27,993 INFO L280 TraceCheckUtils]: 26: Hoare triple {1258#false} assume !(rangesum_~i~1 < ~N~0); {1258#false} is VALID [2020-07-28 14:27:27,993 INFO L280 TraceCheckUtils]: 27: Hoare triple {1258#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {1258#false} is VALID [2020-07-28 14:27:27,993 INFO L280 TraceCheckUtils]: 28: Hoare triple {1258#false} main_#t~ret12 := rangesum_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647;main_~ret5~0 := main_#t~ret12;havoc main_#t~ret12; {1258#false} is VALID [2020-07-28 14:27:27,994 INFO L280 TraceCheckUtils]: 29: Hoare triple {1258#false} assume main_~ret~1 != main_~ret2~0 || main_~ret~1 != main_~ret5~0; {1258#false} is VALID [2020-07-28 14:27:27,994 INFO L280 TraceCheckUtils]: 30: Hoare triple {1258#false} assume !false; {1258#false} is VALID [2020-07-28 14:27:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-28 14:27:27,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126420993] [2020-07-28 14:27:27,996 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993068593] [2020-07-28 14:27:27,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:27:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:28,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 14:27:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:28,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:27:28,189 INFO L280 TraceCheckUtils]: 0: Hoare triple {1257#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1257#true} is VALID [2020-07-28 14:27:28,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {1257#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {1257#true} is VALID [2020-07-28 14:27:28,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {1257#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; {1259#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:28,192 INFO L280 TraceCheckUtils]: 3: Hoare triple {1259#(<= 2 ~N~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {1259#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:28,193 INFO L280 TraceCheckUtils]: 4: Hoare triple {1259#(<= 2 ~N~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {1259#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:28,194 INFO L280 TraceCheckUtils]: 5: Hoare triple {1259#(<= 2 ~N~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {1259#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:28,194 INFO L280 TraceCheckUtils]: 6: Hoare triple {1259#(<= 2 ~N~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {1259#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:28,195 INFO L280 TraceCheckUtils]: 7: Hoare triple {1259#(<= 2 ~N~0)} assume !(init_nondet_~i~0 < ~N~0); {1259#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:28,196 INFO L280 TraceCheckUtils]: 8: Hoare triple {1259#(<= 2 ~N~0)} havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {1289#(and (<= ULTIMATE.start_rangesum_~i~1 0) (<= 2 ~N~0))} is VALID [2020-07-28 14:27:28,197 INFO L280 TraceCheckUtils]: 9: Hoare triple {1289#(and (<= ULTIMATE.start_rangesum_~i~1 0) (<= 2 ~N~0))} assume !!(rangesum_~i~1 < ~N~0); {1289#(and (<= ULTIMATE.start_rangesum_~i~1 0) (<= 2 ~N~0))} is VALID [2020-07-28 14:27:28,198 INFO L280 TraceCheckUtils]: 10: Hoare triple {1289#(and (<= ULTIMATE.start_rangesum_~i~1 0) (<= 2 ~N~0))} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1289#(and (<= ULTIMATE.start_rangesum_~i~1 0) (<= 2 ~N~0))} is VALID [2020-07-28 14:27:28,200 INFO L280 TraceCheckUtils]: 11: Hoare triple {1289#(and (<= ULTIMATE.start_rangesum_~i~1 0) (<= 2 ~N~0))} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1299#(and (<= ULTIMATE.start_rangesum_~i~1 1) (<= 2 ~N~0))} is VALID [2020-07-28 14:27:28,201 INFO L280 TraceCheckUtils]: 12: Hoare triple {1299#(and (<= ULTIMATE.start_rangesum_~i~1 1) (<= 2 ~N~0))} assume !(rangesum_~i~1 < ~N~0); {1258#false} is VALID [2020-07-28 14:27:28,201 INFO L280 TraceCheckUtils]: 13: Hoare triple {1258#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {1258#false} is VALID [2020-07-28 14:27:28,201 INFO L280 TraceCheckUtils]: 14: Hoare triple {1258#false} main_#t~ret5 := rangesum_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {1258#false} is VALID [2020-07-28 14:27:28,202 INFO L280 TraceCheckUtils]: 15: Hoare triple {1258#false} assume !!(rangesum_~i~1 < ~N~0); {1258#false} is VALID [2020-07-28 14:27:28,202 INFO L280 TraceCheckUtils]: 16: Hoare triple {1258#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1258#false} is VALID [2020-07-28 14:27:28,202 INFO L280 TraceCheckUtils]: 17: Hoare triple {1258#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1258#false} is VALID [2020-07-28 14:27:28,202 INFO L280 TraceCheckUtils]: 18: Hoare triple {1258#false} assume !(rangesum_~i~1 < ~N~0); {1258#false} is VALID [2020-07-28 14:27:28,203 INFO L280 TraceCheckUtils]: 19: Hoare triple {1258#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {1258#false} is VALID [2020-07-28 14:27:28,203 INFO L280 TraceCheckUtils]: 20: Hoare triple {1258#false} main_#t~ret8 := rangesum_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; {1258#false} is VALID [2020-07-28 14:27:28,203 INFO L280 TraceCheckUtils]: 21: Hoare triple {1258#false} assume !(main_~i~2 < ~N~0 - 1); {1258#false} is VALID [2020-07-28 14:27:28,203 INFO L280 TraceCheckUtils]: 22: Hoare triple {1258#false} call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {1258#false} is VALID [2020-07-28 14:27:28,204 INFO L280 TraceCheckUtils]: 23: Hoare triple {1258#false} assume !!(rangesum_~i~1 < ~N~0); {1258#false} is VALID [2020-07-28 14:27:28,204 INFO L280 TraceCheckUtils]: 24: Hoare triple {1258#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1258#false} is VALID [2020-07-28 14:27:28,204 INFO L280 TraceCheckUtils]: 25: Hoare triple {1258#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1258#false} is VALID [2020-07-28 14:27:28,204 INFO L280 TraceCheckUtils]: 26: Hoare triple {1258#false} assume !(rangesum_~i~1 < ~N~0); {1258#false} is VALID [2020-07-28 14:27:28,204 INFO L280 TraceCheckUtils]: 27: Hoare triple {1258#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {1258#false} is VALID [2020-07-28 14:27:28,205 INFO L280 TraceCheckUtils]: 28: Hoare triple {1258#false} main_#t~ret12 := rangesum_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647;main_~ret5~0 := main_#t~ret12;havoc main_#t~ret12; {1258#false} is VALID [2020-07-28 14:27:28,205 INFO L280 TraceCheckUtils]: 29: Hoare triple {1258#false} assume main_~ret~1 != main_~ret2~0 || main_~ret~1 != main_~ret5~0; {1258#false} is VALID [2020-07-28 14:27:28,205 INFO L280 TraceCheckUtils]: 30: Hoare triple {1258#false} assume !false; {1258#false} is VALID [2020-07-28 14:27:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-28 14:27:28,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:27:28,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-07-28 14:27:28,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44981410] [2020-07-28 14:27:28,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-28 14:27:28,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:27:28,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 14:27:28,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:28,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 14:27:28,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:27:28,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 14:27:28,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-07-28 14:27:28,252 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand 7 states. [2020-07-28 14:27:29,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:29,062 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2020-07-28 14:27:29,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 14:27:29,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-28 14:27:29,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:27:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 14:27:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2020-07-28 14:27:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 14:27:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2020-07-28 14:27:29,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2020-07-28 14:27:29,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:29,210 INFO L225 Difference]: With dead ends: 94 [2020-07-28 14:27:29,210 INFO L226 Difference]: Without dead ends: 60 [2020-07-28 14:27:29,211 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2020-07-28 14:27:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-28 14:27:29,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2020-07-28 14:27:29,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:27:29,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 57 states. [2020-07-28 14:27:29,247 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 57 states. [2020-07-28 14:27:29,247 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 57 states. [2020-07-28 14:27:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:29,250 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2020-07-28 14:27:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2020-07-28 14:27:29,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:29,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:29,251 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 60 states. [2020-07-28 14:27:29,252 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 60 states. [2020-07-28 14:27:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:29,255 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2020-07-28 14:27:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2020-07-28 14:27:29,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:29,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:29,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:27:29,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:27:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-28 14:27:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2020-07-28 14:27:29,259 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 73 transitions. Word has length 31 [2020-07-28 14:27:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:27:29,260 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 73 transitions. [2020-07-28 14:27:29,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 14:27:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2020-07-28 14:27:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-28 14:27:29,261 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:27:29,261 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:27:29,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:27:29,476 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:27:29,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:27:29,477 INFO L82 PathProgramCache]: Analyzing trace with hash -257538099, now seen corresponding path program 2 times [2020-07-28 14:27:29,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:27:29,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241437640] [2020-07-28 14:27:29,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:27:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:29,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {1678#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1678#true} is VALID [2020-07-28 14:27:29,629 INFO L280 TraceCheckUtils]: 1: Hoare triple {1678#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {1678#true} is VALID [2020-07-28 14:27:29,631 INFO L280 TraceCheckUtils]: 2: Hoare triple {1678#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,632 INFO L280 TraceCheckUtils]: 3: Hoare triple {1680#(<= 2 ~N~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,633 INFO L280 TraceCheckUtils]: 4: Hoare triple {1680#(<= 2 ~N~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,633 INFO L280 TraceCheckUtils]: 5: Hoare triple {1680#(<= 2 ~N~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,634 INFO L280 TraceCheckUtils]: 6: Hoare triple {1680#(<= 2 ~N~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,635 INFO L280 TraceCheckUtils]: 7: Hoare triple {1680#(<= 2 ~N~0)} assume !(init_nondet_~i~0 < ~N~0); {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,635 INFO L280 TraceCheckUtils]: 8: Hoare triple {1680#(<= 2 ~N~0)} havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,642 INFO L280 TraceCheckUtils]: 9: Hoare triple {1680#(<= 2 ~N~0)} assume !!(rangesum_~i~1 < ~N~0); {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,644 INFO L280 TraceCheckUtils]: 10: Hoare triple {1680#(<= 2 ~N~0)} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,651 INFO L280 TraceCheckUtils]: 11: Hoare triple {1680#(<= 2 ~N~0)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,652 INFO L280 TraceCheckUtils]: 12: Hoare triple {1680#(<= 2 ~N~0)} assume !!(rangesum_~i~1 < ~N~0); {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,652 INFO L280 TraceCheckUtils]: 13: Hoare triple {1680#(<= 2 ~N~0)} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,653 INFO L280 TraceCheckUtils]: 14: Hoare triple {1680#(<= 2 ~N~0)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,653 INFO L280 TraceCheckUtils]: 15: Hoare triple {1680#(<= 2 ~N~0)} assume !(rangesum_~i~1 < ~N~0); {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,654 INFO L280 TraceCheckUtils]: 16: Hoare triple {1680#(<= 2 ~N~0)} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,659 INFO L280 TraceCheckUtils]: 17: Hoare triple {1680#(<= 2 ~N~0)} main_#t~ret5 := rangesum_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,660 INFO L280 TraceCheckUtils]: 18: Hoare triple {1680#(<= 2 ~N~0)} assume !!(rangesum_~i~1 < ~N~0); {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,661 INFO L280 TraceCheckUtils]: 19: Hoare triple {1680#(<= 2 ~N~0)} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,661 INFO L280 TraceCheckUtils]: 20: Hoare triple {1680#(<= 2 ~N~0)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,662 INFO L280 TraceCheckUtils]: 21: Hoare triple {1680#(<= 2 ~N~0)} assume !!(rangesum_~i~1 < ~N~0); {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,662 INFO L280 TraceCheckUtils]: 22: Hoare triple {1680#(<= 2 ~N~0)} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,663 INFO L280 TraceCheckUtils]: 23: Hoare triple {1680#(<= 2 ~N~0)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,663 INFO L280 TraceCheckUtils]: 24: Hoare triple {1680#(<= 2 ~N~0)} assume !(rangesum_~i~1 < ~N~0); {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,664 INFO L280 TraceCheckUtils]: 25: Hoare triple {1680#(<= 2 ~N~0)} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {1680#(<= 2 ~N~0)} is VALID [2020-07-28 14:27:29,664 INFO L280 TraceCheckUtils]: 26: Hoare triple {1680#(<= 2 ~N~0)} main_#t~ret8 := rangesum_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; {1681#(and (<= 2 ~N~0) (= 0 ULTIMATE.start_main_~i~2))} is VALID [2020-07-28 14:27:29,665 INFO L280 TraceCheckUtils]: 27: Hoare triple {1681#(and (<= 2 ~N~0) (= 0 ULTIMATE.start_main_~i~2))} assume !(main_~i~2 < ~N~0 - 1); {1679#false} is VALID [2020-07-28 14:27:29,665 INFO L280 TraceCheckUtils]: 28: Hoare triple {1679#false} call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {1679#false} is VALID [2020-07-28 14:27:29,665 INFO L280 TraceCheckUtils]: 29: Hoare triple {1679#false} assume !!(rangesum_~i~1 < ~N~0); {1679#false} is VALID [2020-07-28 14:27:29,665 INFO L280 TraceCheckUtils]: 30: Hoare triple {1679#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1679#false} is VALID [2020-07-28 14:27:29,666 INFO L280 TraceCheckUtils]: 31: Hoare triple {1679#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1679#false} is VALID [2020-07-28 14:27:29,666 INFO L280 TraceCheckUtils]: 32: Hoare triple {1679#false} assume !!(rangesum_~i~1 < ~N~0); {1679#false} is VALID [2020-07-28 14:27:29,666 INFO L280 TraceCheckUtils]: 33: Hoare triple {1679#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1679#false} is VALID [2020-07-28 14:27:29,666 INFO L280 TraceCheckUtils]: 34: Hoare triple {1679#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1679#false} is VALID [2020-07-28 14:27:29,667 INFO L280 TraceCheckUtils]: 35: Hoare triple {1679#false} assume !(rangesum_~i~1 < ~N~0); {1679#false} is VALID [2020-07-28 14:27:29,667 INFO L280 TraceCheckUtils]: 36: Hoare triple {1679#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {1679#false} is VALID [2020-07-28 14:27:29,667 INFO L280 TraceCheckUtils]: 37: Hoare triple {1679#false} main_#t~ret12 := rangesum_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647;main_~ret5~0 := main_#t~ret12;havoc main_#t~ret12; {1679#false} is VALID [2020-07-28 14:27:29,667 INFO L280 TraceCheckUtils]: 38: Hoare triple {1679#false} assume main_~ret~1 != main_~ret2~0 || main_~ret~1 != main_~ret5~0; {1679#false} is VALID [2020-07-28 14:27:29,668 INFO L280 TraceCheckUtils]: 39: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2020-07-28 14:27:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-07-28 14:27:29,670 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241437640] [2020-07-28 14:27:29,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:27:29,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 14:27:29,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455153491] [2020-07-28 14:27:29,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-28 14:27:29,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:27:29,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 14:27:29,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:29,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 14:27:29,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:27:29,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 14:27:29,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:27:29,712 INFO L87 Difference]: Start difference. First operand 57 states and 73 transitions. Second operand 4 states. [2020-07-28 14:27:30,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:30,118 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2020-07-28 14:27:30,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 14:27:30,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-28 14:27:30,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:27:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:27:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2020-07-28 14:27:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 14:27:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2020-07-28 14:27:30,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2020-07-28 14:27:30,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:30,200 INFO L225 Difference]: With dead ends: 77 [2020-07-28 14:27:30,201 INFO L226 Difference]: Without dead ends: 59 [2020-07-28 14:27:30,201 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 14:27:30,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-28 14:27:30,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2020-07-28 14:27:30,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:27:30,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2020-07-28 14:27:30,253 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2020-07-28 14:27:30,253 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2020-07-28 14:27:30,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:30,255 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2020-07-28 14:27:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2020-07-28 14:27:30,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:30,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:30,256 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2020-07-28 14:27:30,256 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2020-07-28 14:27:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:30,259 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2020-07-28 14:27:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2020-07-28 14:27:30,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:30,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:30,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:27:30,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:27:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-28 14:27:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2020-07-28 14:27:30,262 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 40 [2020-07-28 14:27:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:27:30,263 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2020-07-28 14:27:30,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 14:27:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2020-07-28 14:27:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-28 14:27:30,264 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:27:30,264 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:27:30,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-28 14:27:30,265 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:27:30,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:27:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1469893845, now seen corresponding path program 1 times [2020-07-28 14:27:30,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:27:30,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423667008] [2020-07-28 14:27:30,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:27:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:30,498 INFO L280 TraceCheckUtils]: 0: Hoare triple {1982#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1982#true} is VALID [2020-07-28 14:27:30,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {1982#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {1982#true} is VALID [2020-07-28 14:27:30,499 INFO L280 TraceCheckUtils]: 2: Hoare triple {1982#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; {1982#true} is VALID [2020-07-28 14:27:30,499 INFO L280 TraceCheckUtils]: 3: Hoare triple {1982#true} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {1982#true} is VALID [2020-07-28 14:27:30,499 INFO L280 TraceCheckUtils]: 4: Hoare triple {1982#true} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {1982#true} is VALID [2020-07-28 14:27:30,500 INFO L280 TraceCheckUtils]: 5: Hoare triple {1982#true} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {1982#true} is VALID [2020-07-28 14:27:30,500 INFO L280 TraceCheckUtils]: 6: Hoare triple {1982#true} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {1982#true} is VALID [2020-07-28 14:27:30,500 INFO L280 TraceCheckUtils]: 7: Hoare triple {1982#true} assume !(init_nondet_~i~0 < ~N~0); {1982#true} is VALID [2020-07-28 14:27:30,500 INFO L280 TraceCheckUtils]: 8: Hoare triple {1982#true} havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {1982#true} is VALID [2020-07-28 14:27:30,500 INFO L280 TraceCheckUtils]: 9: Hoare triple {1982#true} assume !!(rangesum_~i~1 < ~N~0); {1982#true} is VALID [2020-07-28 14:27:30,501 INFO L280 TraceCheckUtils]: 10: Hoare triple {1982#true} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1982#true} is VALID [2020-07-28 14:27:30,501 INFO L280 TraceCheckUtils]: 11: Hoare triple {1982#true} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1982#true} is VALID [2020-07-28 14:27:30,501 INFO L280 TraceCheckUtils]: 12: Hoare triple {1982#true} assume !!(rangesum_~i~1 < ~N~0); {1982#true} is VALID [2020-07-28 14:27:30,502 INFO L280 TraceCheckUtils]: 13: Hoare triple {1982#true} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1982#true} is VALID [2020-07-28 14:27:30,502 INFO L280 TraceCheckUtils]: 14: Hoare triple {1982#true} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1982#true} is VALID [2020-07-28 14:27:30,502 INFO L280 TraceCheckUtils]: 15: Hoare triple {1982#true} assume !(rangesum_~i~1 < ~N~0); {1982#true} is VALID [2020-07-28 14:27:30,506 INFO L280 TraceCheckUtils]: 16: Hoare triple {1982#true} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {1984#(= |ULTIMATE.start_rangesum_#res| 0)} is VALID [2020-07-28 14:27:30,508 INFO L280 TraceCheckUtils]: 17: Hoare triple {1984#(= |ULTIMATE.start_rangesum_#res| 0)} main_#t~ret5 := rangesum_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {1985#(= 0 ULTIMATE.start_main_~ret~1)} is VALID [2020-07-28 14:27:30,509 INFO L280 TraceCheckUtils]: 18: Hoare triple {1985#(= 0 ULTIMATE.start_main_~ret~1)} assume !!(rangesum_~i~1 < ~N~0); {1985#(= 0 ULTIMATE.start_main_~ret~1)} is VALID [2020-07-28 14:27:30,510 INFO L280 TraceCheckUtils]: 19: Hoare triple {1985#(= 0 ULTIMATE.start_main_~ret~1)} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1985#(= 0 ULTIMATE.start_main_~ret~1)} is VALID [2020-07-28 14:27:30,510 INFO L280 TraceCheckUtils]: 20: Hoare triple {1985#(= 0 ULTIMATE.start_main_~ret~1)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1985#(= 0 ULTIMATE.start_main_~ret~1)} is VALID [2020-07-28 14:27:30,511 INFO L280 TraceCheckUtils]: 21: Hoare triple {1985#(= 0 ULTIMATE.start_main_~ret~1)} assume !!(rangesum_~i~1 < ~N~0); {1985#(= 0 ULTIMATE.start_main_~ret~1)} is VALID [2020-07-28 14:27:30,512 INFO L280 TraceCheckUtils]: 22: Hoare triple {1985#(= 0 ULTIMATE.start_main_~ret~1)} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1985#(= 0 ULTIMATE.start_main_~ret~1)} is VALID [2020-07-28 14:27:30,512 INFO L280 TraceCheckUtils]: 23: Hoare triple {1985#(= 0 ULTIMATE.start_main_~ret~1)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1985#(= 0 ULTIMATE.start_main_~ret~1)} is VALID [2020-07-28 14:27:30,513 INFO L280 TraceCheckUtils]: 24: Hoare triple {1985#(= 0 ULTIMATE.start_main_~ret~1)} assume !(rangesum_~i~1 < ~N~0); {1985#(= 0 ULTIMATE.start_main_~ret~1)} is VALID [2020-07-28 14:27:30,514 INFO L280 TraceCheckUtils]: 25: Hoare triple {1985#(= 0 ULTIMATE.start_main_~ret~1)} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {1986#(and (= |ULTIMATE.start_rangesum_#res| 0) (= 0 ULTIMATE.start_main_~ret~1))} is VALID [2020-07-28 14:27:30,515 INFO L280 TraceCheckUtils]: 26: Hoare triple {1986#(and (= |ULTIMATE.start_rangesum_#res| 0) (= 0 ULTIMATE.start_main_~ret~1))} main_#t~ret8 := rangesum_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} is VALID [2020-07-28 14:27:30,516 INFO L280 TraceCheckUtils]: 27: Hoare triple {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} assume !!(main_~i~2 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem11; {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} is VALID [2020-07-28 14:27:30,517 INFO L280 TraceCheckUtils]: 28: Hoare triple {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} main_#t~post10 := main_~i~2;main_~i~2 := 1 + main_#t~post10;havoc main_#t~post10; {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} is VALID [2020-07-28 14:27:30,518 INFO L280 TraceCheckUtils]: 29: Hoare triple {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} assume !(main_~i~2 < ~N~0 - 1); {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} is VALID [2020-07-28 14:27:30,526 INFO L280 TraceCheckUtils]: 30: Hoare triple {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} is VALID [2020-07-28 14:27:30,527 INFO L280 TraceCheckUtils]: 31: Hoare triple {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} assume !!(rangesum_~i~1 < ~N~0); {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} is VALID [2020-07-28 14:27:30,528 INFO L280 TraceCheckUtils]: 32: Hoare triple {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} is VALID [2020-07-28 14:27:30,528 INFO L280 TraceCheckUtils]: 33: Hoare triple {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} is VALID [2020-07-28 14:27:30,529 INFO L280 TraceCheckUtils]: 34: Hoare triple {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} assume !!(rangesum_~i~1 < ~N~0); {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} is VALID [2020-07-28 14:27:30,530 INFO L280 TraceCheckUtils]: 35: Hoare triple {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} is VALID [2020-07-28 14:27:30,531 INFO L280 TraceCheckUtils]: 36: Hoare triple {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} is VALID [2020-07-28 14:27:30,533 INFO L280 TraceCheckUtils]: 37: Hoare triple {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} assume !(rangesum_~i~1 < ~N~0); {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} is VALID [2020-07-28 14:27:30,534 INFO L280 TraceCheckUtils]: 38: Hoare triple {1987#(and (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {1988#(and (= |ULTIMATE.start_rangesum_#res| 0) (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} is VALID [2020-07-28 14:27:30,535 INFO L280 TraceCheckUtils]: 39: Hoare triple {1988#(and (= |ULTIMATE.start_rangesum_#res| 0) (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} main_#t~ret12 := rangesum_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647;main_~ret5~0 := main_#t~ret12;havoc main_#t~ret12; {1989#(and (= 0 ULTIMATE.start_main_~ret5~0) (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} is VALID [2020-07-28 14:27:30,535 INFO L280 TraceCheckUtils]: 40: Hoare triple {1989#(and (= 0 ULTIMATE.start_main_~ret5~0) (= 0 ULTIMATE.start_main_~ret2~0) (= 0 ULTIMATE.start_main_~ret~1))} assume main_~ret~1 != main_~ret2~0 || main_~ret~1 != main_~ret5~0; {1983#false} is VALID [2020-07-28 14:27:30,536 INFO L280 TraceCheckUtils]: 41: Hoare triple {1983#false} assume !false; {1983#false} is VALID [2020-07-28 14:27:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-28 14:27:30,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423667008] [2020-07-28 14:27:30,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 14:27:30,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-28 14:27:30,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184586845] [2020-07-28 14:27:30,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-07-28 14:27:30,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:27:30,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 14:27:30,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:30,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 14:27:30,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:27:30,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 14:27:30,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-28 14:27:30,593 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand 8 states. [2020-07-28 14:27:31,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:31,440 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2020-07-28 14:27:31,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 14:27:31,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2020-07-28 14:27:31,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:27:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 14:27:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2020-07-28 14:27:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 14:27:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2020-07-28 14:27:31,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 89 transitions. [2020-07-28 14:27:31,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:31,602 INFO L225 Difference]: With dead ends: 133 [2020-07-28 14:27:31,602 INFO L226 Difference]: Without dead ends: 128 [2020-07-28 14:27:31,603 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-07-28 14:27:31,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-28 14:27:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 89. [2020-07-28 14:27:31,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:27:31,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 89 states. [2020-07-28 14:27:31,672 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 89 states. [2020-07-28 14:27:31,672 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 89 states. [2020-07-28 14:27:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:31,677 INFO L93 Difference]: Finished difference Result 128 states and 156 transitions. [2020-07-28 14:27:31,677 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2020-07-28 14:27:31,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:31,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:31,678 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 128 states. [2020-07-28 14:27:31,678 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 128 states. [2020-07-28 14:27:31,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:31,682 INFO L93 Difference]: Finished difference Result 128 states and 156 transitions. [2020-07-28 14:27:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2020-07-28 14:27:31,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:31,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:31,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:27:31,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:27:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-07-28 14:27:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2020-07-28 14:27:31,687 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 42 [2020-07-28 14:27:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:27:31,688 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2020-07-28 14:27:31,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 14:27:31,688 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2020-07-28 14:27:31,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-28 14:27:31,689 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:27:31,689 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:27:31,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-28 14:27:31,690 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:27:31,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:27:31,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1297182544, now seen corresponding path program 1 times [2020-07-28 14:27:31,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:27:31,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912801147] [2020-07-28 14:27:31,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:27:31,713 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:27:31,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17867333] [2020-07-28 14:27:31,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:27:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:31,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 14:27:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:31,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:27:32,099 INFO L280 TraceCheckUtils]: 0: Hoare triple {2551#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {2551#true} is VALID [2020-07-28 14:27:32,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {2551#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {2551#true} is VALID [2020-07-28 14:27:32,101 INFO L280 TraceCheckUtils]: 2: Hoare triple {2551#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; {2562#(<= ULTIMATE.start_init_nondet_~i~0 0)} is VALID [2020-07-28 14:27:32,101 INFO L280 TraceCheckUtils]: 3: Hoare triple {2562#(<= ULTIMATE.start_init_nondet_~i~0 0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {2562#(<= ULTIMATE.start_init_nondet_~i~0 0)} is VALID [2020-07-28 14:27:32,103 INFO L280 TraceCheckUtils]: 4: Hoare triple {2562#(<= ULTIMATE.start_init_nondet_~i~0 0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {2569#(<= ULTIMATE.start_init_nondet_~i~0 1)} is VALID [2020-07-28 14:27:32,104 INFO L280 TraceCheckUtils]: 5: Hoare triple {2569#(<= ULTIMATE.start_init_nondet_~i~0 1)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {2569#(<= ULTIMATE.start_init_nondet_~i~0 1)} is VALID [2020-07-28 14:27:32,105 INFO L280 TraceCheckUtils]: 6: Hoare triple {2569#(<= ULTIMATE.start_init_nondet_~i~0 1)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {2576#(<= ULTIMATE.start_init_nondet_~i~0 2)} is VALID [2020-07-28 14:27:32,107 INFO L280 TraceCheckUtils]: 7: Hoare triple {2576#(<= ULTIMATE.start_init_nondet_~i~0 2)} assume !(init_nondet_~i~0 < ~N~0); {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,108 INFO L280 TraceCheckUtils]: 8: Hoare triple {2580#(<= ~N~0 2)} havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,109 INFO L280 TraceCheckUtils]: 9: Hoare triple {2580#(<= ~N~0 2)} assume !!(rangesum_~i~1 < ~N~0); {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,111 INFO L280 TraceCheckUtils]: 10: Hoare triple {2580#(<= ~N~0 2)} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,112 INFO L280 TraceCheckUtils]: 11: Hoare triple {2580#(<= ~N~0 2)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,112 INFO L280 TraceCheckUtils]: 12: Hoare triple {2580#(<= ~N~0 2)} assume !!(rangesum_~i~1 < ~N~0); {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,113 INFO L280 TraceCheckUtils]: 13: Hoare triple {2580#(<= ~N~0 2)} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,114 INFO L280 TraceCheckUtils]: 14: Hoare triple {2580#(<= ~N~0 2)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,114 INFO L280 TraceCheckUtils]: 15: Hoare triple {2580#(<= ~N~0 2)} assume !(rangesum_~i~1 < ~N~0); {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,115 INFO L280 TraceCheckUtils]: 16: Hoare triple {2580#(<= ~N~0 2)} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,116 INFO L280 TraceCheckUtils]: 17: Hoare triple {2580#(<= ~N~0 2)} main_#t~ret5 := rangesum_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,116 INFO L280 TraceCheckUtils]: 18: Hoare triple {2580#(<= ~N~0 2)} assume !!(rangesum_~i~1 < ~N~0); {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,117 INFO L280 TraceCheckUtils]: 19: Hoare triple {2580#(<= ~N~0 2)} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,117 INFO L280 TraceCheckUtils]: 20: Hoare triple {2580#(<= ~N~0 2)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,118 INFO L280 TraceCheckUtils]: 21: Hoare triple {2580#(<= ~N~0 2)} assume !!(rangesum_~i~1 < ~N~0); {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,119 INFO L280 TraceCheckUtils]: 22: Hoare triple {2580#(<= ~N~0 2)} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,120 INFO L280 TraceCheckUtils]: 23: Hoare triple {2580#(<= ~N~0 2)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,120 INFO L280 TraceCheckUtils]: 24: Hoare triple {2580#(<= ~N~0 2)} assume !(rangesum_~i~1 < ~N~0); {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,121 INFO L280 TraceCheckUtils]: 25: Hoare triple {2580#(<= ~N~0 2)} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,122 INFO L280 TraceCheckUtils]: 26: Hoare triple {2580#(<= ~N~0 2)} main_#t~ret8 := rangesum_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,122 INFO L280 TraceCheckUtils]: 27: Hoare triple {2580#(<= ~N~0 2)} assume !!(main_~i~2 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem11; {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,123 INFO L280 TraceCheckUtils]: 28: Hoare triple {2580#(<= ~N~0 2)} main_#t~post10 := main_~i~2;main_~i~2 := 1 + main_#t~post10;havoc main_#t~post10; {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,124 INFO L280 TraceCheckUtils]: 29: Hoare triple {2580#(<= ~N~0 2)} assume !(main_~i~2 < ~N~0 - 1); {2580#(<= ~N~0 2)} is VALID [2020-07-28 14:27:32,126 INFO L280 TraceCheckUtils]: 30: Hoare triple {2580#(<= ~N~0 2)} call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {2650#(and (<= ~N~0 2) (<= 0 ULTIMATE.start_rangesum_~i~1))} is VALID [2020-07-28 14:27:32,127 INFO L280 TraceCheckUtils]: 31: Hoare triple {2650#(and (<= ~N~0 2) (<= 0 ULTIMATE.start_rangesum_~i~1))} assume !!(rangesum_~i~1 < ~N~0); {2650#(and (<= ~N~0 2) (<= 0 ULTIMATE.start_rangesum_~i~1))} is VALID [2020-07-28 14:27:32,128 INFO L280 TraceCheckUtils]: 32: Hoare triple {2650#(and (<= ~N~0 2) (<= 0 ULTIMATE.start_rangesum_~i~1))} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2650#(and (<= ~N~0 2) (<= 0 ULTIMATE.start_rangesum_~i~1))} is VALID [2020-07-28 14:27:32,129 INFO L280 TraceCheckUtils]: 33: Hoare triple {2650#(and (<= ~N~0 2) (<= 0 ULTIMATE.start_rangesum_~i~1))} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {2660#(and (<= ~N~0 2) (<= 1 ULTIMATE.start_rangesum_~i~1))} is VALID [2020-07-28 14:27:32,130 INFO L280 TraceCheckUtils]: 34: Hoare triple {2660#(and (<= ~N~0 2) (<= 1 ULTIMATE.start_rangesum_~i~1))} assume !!(rangesum_~i~1 < ~N~0); {2660#(and (<= ~N~0 2) (<= 1 ULTIMATE.start_rangesum_~i~1))} is VALID [2020-07-28 14:27:32,131 INFO L280 TraceCheckUtils]: 35: Hoare triple {2660#(and (<= ~N~0 2) (<= 1 ULTIMATE.start_rangesum_~i~1))} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {2660#(and (<= ~N~0 2) (<= 1 ULTIMATE.start_rangesum_~i~1))} is VALID [2020-07-28 14:27:32,133 INFO L280 TraceCheckUtils]: 36: Hoare triple {2660#(and (<= ~N~0 2) (<= 1 ULTIMATE.start_rangesum_~i~1))} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {2670#(and (<= ~N~0 2) (<= 2 ULTIMATE.start_rangesum_~i~1))} is VALID [2020-07-28 14:27:32,134 INFO L280 TraceCheckUtils]: 37: Hoare triple {2670#(and (<= ~N~0 2) (<= 2 ULTIMATE.start_rangesum_~i~1))} assume !!(rangesum_~i~1 < ~N~0); {2552#false} is VALID [2020-07-28 14:27:32,134 INFO L280 TraceCheckUtils]: 38: Hoare triple {2552#false} assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; {2552#false} is VALID [2020-07-28 14:27:32,135 INFO L280 TraceCheckUtils]: 39: Hoare triple {2552#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {2552#false} is VALID [2020-07-28 14:27:32,135 INFO L280 TraceCheckUtils]: 40: Hoare triple {2552#false} assume !(rangesum_~i~1 < ~N~0); {2552#false} is VALID [2020-07-28 14:27:32,135 INFO L280 TraceCheckUtils]: 41: Hoare triple {2552#false} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {2552#false} is VALID [2020-07-28 14:27:32,135 INFO L280 TraceCheckUtils]: 42: Hoare triple {2552#false} main_#t~ret12 := rangesum_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647;main_~ret5~0 := main_#t~ret12;havoc main_#t~ret12; {2552#false} is VALID [2020-07-28 14:27:32,135 INFO L280 TraceCheckUtils]: 43: Hoare triple {2552#false} assume main_~ret~1 != main_~ret2~0 || main_~ret~1 != main_~ret5~0; {2552#false} is VALID [2020-07-28 14:27:32,136 INFO L280 TraceCheckUtils]: 44: Hoare triple {2552#false} assume !false; {2552#false} is VALID [2020-07-28 14:27:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-28 14:27:32,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912801147] [2020-07-28 14:27:32,140 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:27:32,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17867333] [2020-07-28 14:27:32,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-28 14:27:32,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-28 14:27:32,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350209865] [2020-07-28 14:27:32,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2020-07-28 14:27:32,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:27:32,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 14:27:32,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:32,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 14:27:32,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:27:32,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 14:27:32,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-28 14:27:32,202 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand 9 states. [2020-07-28 14:27:33,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:33,087 INFO L93 Difference]: Finished difference Result 197 states and 250 transitions. [2020-07-28 14:27:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 14:27:33,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2020-07-28 14:27:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:27:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 14:27:33,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2020-07-28 14:27:33,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 14:27:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2020-07-28 14:27:33,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 106 transitions. [2020-07-28 14:27:33,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:33,239 INFO L225 Difference]: With dead ends: 197 [2020-07-28 14:27:33,239 INFO L226 Difference]: Without dead ends: 92 [2020-07-28 14:27:33,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-07-28 14:27:33,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-28 14:27:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2020-07-28 14:27:33,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:27:33,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 91 states. [2020-07-28 14:27:33,305 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 91 states. [2020-07-28 14:27:33,305 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 91 states. [2020-07-28 14:27:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:33,308 INFO L93 Difference]: Finished difference Result 92 states and 117 transitions. [2020-07-28 14:27:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 117 transitions. [2020-07-28 14:27:33,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:33,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:33,308 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 92 states. [2020-07-28 14:27:33,309 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 92 states. [2020-07-28 14:27:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:33,311 INFO L93 Difference]: Finished difference Result 92 states and 117 transitions. [2020-07-28 14:27:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 117 transitions. [2020-07-28 14:27:33,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:33,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:33,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:27:33,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:27:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-28 14:27:33,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2020-07-28 14:27:33,315 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 45 [2020-07-28 14:27:33,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:27:33,315 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2020-07-28 14:27:33,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 14:27:33,316 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2020-07-28 14:27:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-28 14:27:33,316 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:27:33,317 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 14:27:33,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:27:33,532 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:27:33,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:27:33,532 INFO L82 PathProgramCache]: Analyzing trace with hash -3446958, now seen corresponding path program 2 times [2020-07-28 14:27:33,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:27:33,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8893444] [2020-07-28 14:27:33,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:27:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:33,683 INFO L280 TraceCheckUtils]: 0: Hoare triple {3280#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {3280#true} is VALID [2020-07-28 14:27:33,684 INFO L280 TraceCheckUtils]: 1: Hoare triple {3280#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {3280#true} is VALID [2020-07-28 14:27:33,685 INFO L280 TraceCheckUtils]: 2: Hoare triple {3280#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; {3282#(= 0 ULTIMATE.start_init_nondet_~i~0)} is VALID [2020-07-28 14:27:33,685 INFO L280 TraceCheckUtils]: 3: Hoare triple {3282#(= 0 ULTIMATE.start_init_nondet_~i~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {3282#(= 0 ULTIMATE.start_init_nondet_~i~0)} is VALID [2020-07-28 14:27:33,686 INFO L280 TraceCheckUtils]: 4: Hoare triple {3282#(= 0 ULTIMATE.start_init_nondet_~i~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {3283#(<= 1 ULTIMATE.start_init_nondet_~i~0)} is VALID [2020-07-28 14:27:33,686 INFO L280 TraceCheckUtils]: 5: Hoare triple {3283#(<= 1 ULTIMATE.start_init_nondet_~i~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {3283#(<= 1 ULTIMATE.start_init_nondet_~i~0)} is VALID [2020-07-28 14:27:33,688 INFO L280 TraceCheckUtils]: 6: Hoare triple {3283#(<= 1 ULTIMATE.start_init_nondet_~i~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {3284#(<= 2 ULTIMATE.start_init_nondet_~i~0)} is VALID [2020-07-28 14:27:33,691 INFO L280 TraceCheckUtils]: 7: Hoare triple {3284#(<= 2 ULTIMATE.start_init_nondet_~i~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {3285#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:33,693 INFO L280 TraceCheckUtils]: 8: Hoare triple {3285#(<= 3 ~N~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {3285#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:33,695 INFO L280 TraceCheckUtils]: 9: Hoare triple {3285#(<= 3 ~N~0)} assume !(init_nondet_~i~0 < ~N~0); {3285#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:33,696 INFO L280 TraceCheckUtils]: 10: Hoare triple {3285#(<= 3 ~N~0)} havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {3286#(and (<= 3 ~N~0) (= ULTIMATE.start_rangesum_~i~1 0))} is VALID [2020-07-28 14:27:33,697 INFO L280 TraceCheckUtils]: 11: Hoare triple {3286#(and (<= 3 ~N~0) (= ULTIMATE.start_rangesum_~i~1 0))} assume !!(rangesum_~i~1 < ~N~0); {3286#(and (<= 3 ~N~0) (= ULTIMATE.start_rangesum_~i~1 0))} is VALID [2020-07-28 14:27:33,697 INFO L280 TraceCheckUtils]: 12: Hoare triple {3286#(and (<= 3 ~N~0) (= ULTIMATE.start_rangesum_~i~1 0))} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3286#(and (<= 3 ~N~0) (= ULTIMATE.start_rangesum_~i~1 0))} is VALID [2020-07-28 14:27:33,698 INFO L280 TraceCheckUtils]: 13: Hoare triple {3286#(and (<= 3 ~N~0) (= ULTIMATE.start_rangesum_~i~1 0))} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {3287#(<= (+ ULTIMATE.start_rangesum_~i~1 2) ~N~0)} is VALID [2020-07-28 14:27:33,698 INFO L280 TraceCheckUtils]: 14: Hoare triple {3287#(<= (+ ULTIMATE.start_rangesum_~i~1 2) ~N~0)} assume !!(rangesum_~i~1 < ~N~0); {3287#(<= (+ ULTIMATE.start_rangesum_~i~1 2) ~N~0)} is VALID [2020-07-28 14:27:33,699 INFO L280 TraceCheckUtils]: 15: Hoare triple {3287#(<= (+ ULTIMATE.start_rangesum_~i~1 2) ~N~0)} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3287#(<= (+ ULTIMATE.start_rangesum_~i~1 2) ~N~0)} is VALID [2020-07-28 14:27:33,701 INFO L280 TraceCheckUtils]: 16: Hoare triple {3287#(<= (+ ULTIMATE.start_rangesum_~i~1 2) ~N~0)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {3288#(<= (+ ULTIMATE.start_rangesum_~i~1 1) ~N~0)} is VALID [2020-07-28 14:27:33,702 INFO L280 TraceCheckUtils]: 17: Hoare triple {3288#(<= (+ ULTIMATE.start_rangesum_~i~1 1) ~N~0)} assume !(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:33,702 INFO L280 TraceCheckUtils]: 18: Hoare triple {3281#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {3281#false} is VALID [2020-07-28 14:27:33,702 INFO L280 TraceCheckUtils]: 19: Hoare triple {3281#false} main_#t~ret5 := rangesum_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {3281#false} is VALID [2020-07-28 14:27:33,702 INFO L280 TraceCheckUtils]: 20: Hoare triple {3281#false} assume !!(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:33,702 INFO L280 TraceCheckUtils]: 21: Hoare triple {3281#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3281#false} is VALID [2020-07-28 14:27:33,703 INFO L280 TraceCheckUtils]: 22: Hoare triple {3281#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {3281#false} is VALID [2020-07-28 14:27:33,703 INFO L280 TraceCheckUtils]: 23: Hoare triple {3281#false} assume !!(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:33,703 INFO L280 TraceCheckUtils]: 24: Hoare triple {3281#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3281#false} is VALID [2020-07-28 14:27:33,703 INFO L280 TraceCheckUtils]: 25: Hoare triple {3281#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {3281#false} is VALID [2020-07-28 14:27:33,703 INFO L280 TraceCheckUtils]: 26: Hoare triple {3281#false} assume !(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:33,703 INFO L280 TraceCheckUtils]: 27: Hoare triple {3281#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {3281#false} is VALID [2020-07-28 14:27:33,703 INFO L280 TraceCheckUtils]: 28: Hoare triple {3281#false} main_#t~ret8 := rangesum_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; {3281#false} is VALID [2020-07-28 14:27:33,704 INFO L280 TraceCheckUtils]: 29: Hoare triple {3281#false} assume !!(main_~i~2 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem11; {3281#false} is VALID [2020-07-28 14:27:33,704 INFO L280 TraceCheckUtils]: 30: Hoare triple {3281#false} main_#t~post10 := main_~i~2;main_~i~2 := 1 + main_#t~post10;havoc main_#t~post10; {3281#false} is VALID [2020-07-28 14:27:33,704 INFO L280 TraceCheckUtils]: 31: Hoare triple {3281#false} assume !(main_~i~2 < ~N~0 - 1); {3281#false} is VALID [2020-07-28 14:27:33,704 INFO L280 TraceCheckUtils]: 32: Hoare triple {3281#false} call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {3281#false} is VALID [2020-07-28 14:27:33,704 INFO L280 TraceCheckUtils]: 33: Hoare triple {3281#false} assume !!(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:33,704 INFO L280 TraceCheckUtils]: 34: Hoare triple {3281#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3281#false} is VALID [2020-07-28 14:27:33,705 INFO L280 TraceCheckUtils]: 35: Hoare triple {3281#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {3281#false} is VALID [2020-07-28 14:27:33,705 INFO L280 TraceCheckUtils]: 36: Hoare triple {3281#false} assume !!(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:33,705 INFO L280 TraceCheckUtils]: 37: Hoare triple {3281#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3281#false} is VALID [2020-07-28 14:27:33,705 INFO L280 TraceCheckUtils]: 38: Hoare triple {3281#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {3281#false} is VALID [2020-07-28 14:27:33,705 INFO L280 TraceCheckUtils]: 39: Hoare triple {3281#false} assume !!(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:33,705 INFO L280 TraceCheckUtils]: 40: Hoare triple {3281#false} assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; {3281#false} is VALID [2020-07-28 14:27:33,706 INFO L280 TraceCheckUtils]: 41: Hoare triple {3281#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {3281#false} is VALID [2020-07-28 14:27:33,706 INFO L280 TraceCheckUtils]: 42: Hoare triple {3281#false} assume !(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:33,706 INFO L280 TraceCheckUtils]: 43: Hoare triple {3281#false} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {3281#false} is VALID [2020-07-28 14:27:33,706 INFO L280 TraceCheckUtils]: 44: Hoare triple {3281#false} main_#t~ret12 := rangesum_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647;main_~ret5~0 := main_#t~ret12;havoc main_#t~ret12; {3281#false} is VALID [2020-07-28 14:27:33,706 INFO L280 TraceCheckUtils]: 45: Hoare triple {3281#false} assume main_~ret~1 != main_~ret2~0 || main_~ret~1 != main_~ret5~0; {3281#false} is VALID [2020-07-28 14:27:33,707 INFO L280 TraceCheckUtils]: 46: Hoare triple {3281#false} assume !false; {3281#false} is VALID [2020-07-28 14:27:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-28 14:27:33,709 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8893444] [2020-07-28 14:27:33,710 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494301189] [2020-07-28 14:27:33,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:27:33,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 14:27:33,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 14:27:33,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 14:27:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:33,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:27:34,069 INFO L280 TraceCheckUtils]: 0: Hoare triple {3280#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {3280#true} is VALID [2020-07-28 14:27:34,069 INFO L280 TraceCheckUtils]: 1: Hoare triple {3280#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {3280#true} is VALID [2020-07-28 14:27:34,070 INFO L280 TraceCheckUtils]: 2: Hoare triple {3280#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; {3298#(<= 0 ULTIMATE.start_init_nondet_~i~0)} is VALID [2020-07-28 14:27:34,070 INFO L280 TraceCheckUtils]: 3: Hoare triple {3298#(<= 0 ULTIMATE.start_init_nondet_~i~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {3298#(<= 0 ULTIMATE.start_init_nondet_~i~0)} is VALID [2020-07-28 14:27:34,073 INFO L280 TraceCheckUtils]: 4: Hoare triple {3298#(<= 0 ULTIMATE.start_init_nondet_~i~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {3283#(<= 1 ULTIMATE.start_init_nondet_~i~0)} is VALID [2020-07-28 14:27:34,074 INFO L280 TraceCheckUtils]: 5: Hoare triple {3283#(<= 1 ULTIMATE.start_init_nondet_~i~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {3283#(<= 1 ULTIMATE.start_init_nondet_~i~0)} is VALID [2020-07-28 14:27:34,076 INFO L280 TraceCheckUtils]: 6: Hoare triple {3283#(<= 1 ULTIMATE.start_init_nondet_~i~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {3284#(<= 2 ULTIMATE.start_init_nondet_~i~0)} is VALID [2020-07-28 14:27:34,079 INFO L280 TraceCheckUtils]: 7: Hoare triple {3284#(<= 2 ULTIMATE.start_init_nondet_~i~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {3285#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:34,080 INFO L280 TraceCheckUtils]: 8: Hoare triple {3285#(<= 3 ~N~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {3285#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:34,081 INFO L280 TraceCheckUtils]: 9: Hoare triple {3285#(<= 3 ~N~0)} assume !(init_nondet_~i~0 < ~N~0); {3285#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:34,081 INFO L280 TraceCheckUtils]: 10: Hoare triple {3285#(<= 3 ~N~0)} havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {3323#(and (<= ULTIMATE.start_rangesum_~i~1 0) (<= 3 ~N~0))} is VALID [2020-07-28 14:27:34,084 INFO L280 TraceCheckUtils]: 11: Hoare triple {3323#(and (<= ULTIMATE.start_rangesum_~i~1 0) (<= 3 ~N~0))} assume !!(rangesum_~i~1 < ~N~0); {3323#(and (<= ULTIMATE.start_rangesum_~i~1 0) (<= 3 ~N~0))} is VALID [2020-07-28 14:27:34,085 INFO L280 TraceCheckUtils]: 12: Hoare triple {3323#(and (<= ULTIMATE.start_rangesum_~i~1 0) (<= 3 ~N~0))} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3323#(and (<= ULTIMATE.start_rangesum_~i~1 0) (<= 3 ~N~0))} is VALID [2020-07-28 14:27:34,086 INFO L280 TraceCheckUtils]: 13: Hoare triple {3323#(and (<= ULTIMATE.start_rangesum_~i~1 0) (<= 3 ~N~0))} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {3333#(and (<= ULTIMATE.start_rangesum_~i~1 1) (<= 3 ~N~0))} is VALID [2020-07-28 14:27:34,087 INFO L280 TraceCheckUtils]: 14: Hoare triple {3333#(and (<= ULTIMATE.start_rangesum_~i~1 1) (<= 3 ~N~0))} assume !!(rangesum_~i~1 < ~N~0); {3333#(and (<= ULTIMATE.start_rangesum_~i~1 1) (<= 3 ~N~0))} is VALID [2020-07-28 14:27:34,088 INFO L280 TraceCheckUtils]: 15: Hoare triple {3333#(and (<= ULTIMATE.start_rangesum_~i~1 1) (<= 3 ~N~0))} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3333#(and (<= ULTIMATE.start_rangesum_~i~1 1) (<= 3 ~N~0))} is VALID [2020-07-28 14:27:34,090 INFO L280 TraceCheckUtils]: 16: Hoare triple {3333#(and (<= ULTIMATE.start_rangesum_~i~1 1) (<= 3 ~N~0))} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {3343#(and (<= 3 ~N~0) (<= ULTIMATE.start_rangesum_~i~1 2))} is VALID [2020-07-28 14:27:34,092 INFO L280 TraceCheckUtils]: 17: Hoare triple {3343#(and (<= 3 ~N~0) (<= ULTIMATE.start_rangesum_~i~1 2))} assume !(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:34,092 INFO L280 TraceCheckUtils]: 18: Hoare triple {3281#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {3281#false} is VALID [2020-07-28 14:27:34,092 INFO L280 TraceCheckUtils]: 19: Hoare triple {3281#false} main_#t~ret5 := rangesum_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {3281#false} is VALID [2020-07-28 14:27:34,093 INFO L280 TraceCheckUtils]: 20: Hoare triple {3281#false} assume !!(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:34,093 INFO L280 TraceCheckUtils]: 21: Hoare triple {3281#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3281#false} is VALID [2020-07-28 14:27:34,093 INFO L280 TraceCheckUtils]: 22: Hoare triple {3281#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {3281#false} is VALID [2020-07-28 14:27:34,093 INFO L280 TraceCheckUtils]: 23: Hoare triple {3281#false} assume !!(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:34,094 INFO L280 TraceCheckUtils]: 24: Hoare triple {3281#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3281#false} is VALID [2020-07-28 14:27:34,094 INFO L280 TraceCheckUtils]: 25: Hoare triple {3281#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {3281#false} is VALID [2020-07-28 14:27:34,094 INFO L280 TraceCheckUtils]: 26: Hoare triple {3281#false} assume !(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:34,094 INFO L280 TraceCheckUtils]: 27: Hoare triple {3281#false} assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; {3281#false} is VALID [2020-07-28 14:27:34,094 INFO L280 TraceCheckUtils]: 28: Hoare triple {3281#false} main_#t~ret8 := rangesum_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; {3281#false} is VALID [2020-07-28 14:27:34,094 INFO L280 TraceCheckUtils]: 29: Hoare triple {3281#false} assume !!(main_~i~2 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem11; {3281#false} is VALID [2020-07-28 14:27:34,094 INFO L280 TraceCheckUtils]: 30: Hoare triple {3281#false} main_#t~post10 := main_~i~2;main_~i~2 := 1 + main_#t~post10;havoc main_#t~post10; {3281#false} is VALID [2020-07-28 14:27:34,095 INFO L280 TraceCheckUtils]: 31: Hoare triple {3281#false} assume !(main_~i~2 < ~N~0 - 1); {3281#false} is VALID [2020-07-28 14:27:34,095 INFO L280 TraceCheckUtils]: 32: Hoare triple {3281#false} call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {3281#false} is VALID [2020-07-28 14:27:34,095 INFO L280 TraceCheckUtils]: 33: Hoare triple {3281#false} assume !!(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:34,095 INFO L280 TraceCheckUtils]: 34: Hoare triple {3281#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3281#false} is VALID [2020-07-28 14:27:34,095 INFO L280 TraceCheckUtils]: 35: Hoare triple {3281#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {3281#false} is VALID [2020-07-28 14:27:34,095 INFO L280 TraceCheckUtils]: 36: Hoare triple {3281#false} assume !!(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:34,096 INFO L280 TraceCheckUtils]: 37: Hoare triple {3281#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {3281#false} is VALID [2020-07-28 14:27:34,096 INFO L280 TraceCheckUtils]: 38: Hoare triple {3281#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {3281#false} is VALID [2020-07-28 14:27:34,096 INFO L280 TraceCheckUtils]: 39: Hoare triple {3281#false} assume !!(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:34,096 INFO L280 TraceCheckUtils]: 40: Hoare triple {3281#false} assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; {3281#false} is VALID [2020-07-28 14:27:34,096 INFO L280 TraceCheckUtils]: 41: Hoare triple {3281#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {3281#false} is VALID [2020-07-28 14:27:34,096 INFO L280 TraceCheckUtils]: 42: Hoare triple {3281#false} assume !(rangesum_~i~1 < ~N~0); {3281#false} is VALID [2020-07-28 14:27:34,096 INFO L280 TraceCheckUtils]: 43: Hoare triple {3281#false} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {3281#false} is VALID [2020-07-28 14:27:34,097 INFO L280 TraceCheckUtils]: 44: Hoare triple {3281#false} main_#t~ret12 := rangesum_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647;main_~ret5~0 := main_#t~ret12;havoc main_#t~ret12; {3281#false} is VALID [2020-07-28 14:27:34,097 INFO L280 TraceCheckUtils]: 45: Hoare triple {3281#false} assume main_~ret~1 != main_~ret2~0 || main_~ret~1 != main_~ret5~0; {3281#false} is VALID [2020-07-28 14:27:34,097 INFO L280 TraceCheckUtils]: 46: Hoare triple {3281#false} assume !false; {3281#false} is VALID [2020-07-28 14:27:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-28 14:27:34,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 14:27:34,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-07-28 14:27:34,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408901550] [2020-07-28 14:27:34,101 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2020-07-28 14:27:34,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:27:34,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-28 14:27:34,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:34,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-28 14:27:34,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:27:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-28 14:27:34,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-07-28 14:27:34,174 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand 13 states. [2020-07-28 14:27:36,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:36,030 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2020-07-28 14:27:36,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-28 14:27:36,030 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2020-07-28 14:27:36,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:27:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 14:27:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2020-07-28 14:27:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 14:27:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2020-07-28 14:27:36,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 112 transitions. [2020-07-28 14:27:36,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:36,239 INFO L225 Difference]: With dead ends: 191 [2020-07-28 14:27:36,240 INFO L226 Difference]: Without dead ends: 122 [2020-07-28 14:27:36,240 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2020-07-28 14:27:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-07-28 14:27:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 82. [2020-07-28 14:27:36,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:27:36,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 82 states. [2020-07-28 14:27:36,328 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 82 states. [2020-07-28 14:27:36,329 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 82 states. [2020-07-28 14:27:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:36,333 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2020-07-28 14:27:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2020-07-28 14:27:36,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:36,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:36,334 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 122 states. [2020-07-28 14:27:36,334 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 122 states. [2020-07-28 14:27:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:36,337 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2020-07-28 14:27:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2020-07-28 14:27:36,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:36,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:36,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:27:36,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:27:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-28 14:27:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2020-07-28 14:27:36,342 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 47 [2020-07-28 14:27:36,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:27:36,343 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2020-07-28 14:27:36,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-28 14:27:36,343 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2020-07-28 14:27:36,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-28 14:27:36,345 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:27:36,345 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-28 14:27:36,558 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-28 14:27:36,559 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:27:36,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:27:36,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1589980971, now seen corresponding path program 1 times [2020-07-28 14:27:36,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:27:36,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007944406] [2020-07-28 14:27:36,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:27:36,574 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:27:36,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266710409] [2020-07-28 14:27:36,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:27:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:36,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-28 14:27:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 14:27:36,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 14:27:36,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {4065#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {4065#true} is VALID [2020-07-28 14:27:36,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {4065#true} havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; {4065#true} is VALID [2020-07-28 14:27:36,900 INFO L280 TraceCheckUtils]: 2: Hoare triple {4065#true} assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; {4076#(<= 0 ULTIMATE.start_init_nondet_~i~0)} is VALID [2020-07-28 14:27:36,901 INFO L280 TraceCheckUtils]: 3: Hoare triple {4076#(<= 0 ULTIMATE.start_init_nondet_~i~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {4076#(<= 0 ULTIMATE.start_init_nondet_~i~0)} is VALID [2020-07-28 14:27:36,903 INFO L280 TraceCheckUtils]: 4: Hoare triple {4076#(<= 0 ULTIMATE.start_init_nondet_~i~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {4083#(<= 1 ULTIMATE.start_init_nondet_~i~0)} is VALID [2020-07-28 14:27:36,903 INFO L280 TraceCheckUtils]: 5: Hoare triple {4083#(<= 1 ULTIMATE.start_init_nondet_~i~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {4083#(<= 1 ULTIMATE.start_init_nondet_~i~0)} is VALID [2020-07-28 14:27:36,905 INFO L280 TraceCheckUtils]: 6: Hoare triple {4083#(<= 1 ULTIMATE.start_init_nondet_~i~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {4090#(<= 2 ULTIMATE.start_init_nondet_~i~0)} is VALID [2020-07-28 14:27:36,906 INFO L280 TraceCheckUtils]: 7: Hoare triple {4090#(<= 2 ULTIMATE.start_init_nondet_~i~0)} assume !!(init_nondet_~i~0 < ~N~0);assume -2147483648 <= init_nondet_#t~nondet1 && init_nondet_#t~nondet1 <= 2147483647;call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,907 INFO L280 TraceCheckUtils]: 8: Hoare triple {4094#(<= 3 ~N~0)} init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,907 INFO L280 TraceCheckUtils]: 9: Hoare triple {4094#(<= 3 ~N~0)} assume !(init_nondet_~i~0 < ~N~0); {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,907 INFO L280 TraceCheckUtils]: 10: Hoare triple {4094#(<= 3 ~N~0)} havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,908 INFO L280 TraceCheckUtils]: 11: Hoare triple {4094#(<= 3 ~N~0)} assume !!(rangesum_~i~1 < ~N~0); {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,909 INFO L280 TraceCheckUtils]: 12: Hoare triple {4094#(<= 3 ~N~0)} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,909 INFO L280 TraceCheckUtils]: 13: Hoare triple {4094#(<= 3 ~N~0)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,910 INFO L280 TraceCheckUtils]: 14: Hoare triple {4094#(<= 3 ~N~0)} assume !!(rangesum_~i~1 < ~N~0); {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,911 INFO L280 TraceCheckUtils]: 15: Hoare triple {4094#(<= 3 ~N~0)} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,911 INFO L280 TraceCheckUtils]: 16: Hoare triple {4094#(<= 3 ~N~0)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,912 INFO L280 TraceCheckUtils]: 17: Hoare triple {4094#(<= 3 ~N~0)} assume !!(rangesum_~i~1 < ~N~0); {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,913 INFO L280 TraceCheckUtils]: 18: Hoare triple {4094#(<= 3 ~N~0)} assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,914 INFO L280 TraceCheckUtils]: 19: Hoare triple {4094#(<= 3 ~N~0)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,915 INFO L280 TraceCheckUtils]: 20: Hoare triple {4094#(<= 3 ~N~0)} assume !(rangesum_~i~1 < ~N~0); {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,916 INFO L280 TraceCheckUtils]: 21: Hoare triple {4094#(<= 3 ~N~0)} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,916 INFO L280 TraceCheckUtils]: 22: Hoare triple {4094#(<= 3 ~N~0)} main_#t~ret5 := rangesum_#res;assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,917 INFO L280 TraceCheckUtils]: 23: Hoare triple {4094#(<= 3 ~N~0)} assume !!(rangesum_~i~1 < ~N~0); {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,918 INFO L280 TraceCheckUtils]: 24: Hoare triple {4094#(<= 3 ~N~0)} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,918 INFO L280 TraceCheckUtils]: 25: Hoare triple {4094#(<= 3 ~N~0)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,918 INFO L280 TraceCheckUtils]: 26: Hoare triple {4094#(<= 3 ~N~0)} assume !!(rangesum_~i~1 < ~N~0); {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,919 INFO L280 TraceCheckUtils]: 27: Hoare triple {4094#(<= 3 ~N~0)} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,919 INFO L280 TraceCheckUtils]: 28: Hoare triple {4094#(<= 3 ~N~0)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,920 INFO L280 TraceCheckUtils]: 29: Hoare triple {4094#(<= 3 ~N~0)} assume !!(rangesum_~i~1 < ~N~0); {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,920 INFO L280 TraceCheckUtils]: 30: Hoare triple {4094#(<= 3 ~N~0)} assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,921 INFO L280 TraceCheckUtils]: 31: Hoare triple {4094#(<= 3 ~N~0)} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,922 INFO L280 TraceCheckUtils]: 32: Hoare triple {4094#(<= 3 ~N~0)} assume !(rangesum_~i~1 < ~N~0); {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,922 INFO L280 TraceCheckUtils]: 33: Hoare triple {4094#(<= 3 ~N~0)} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {4094#(<= 3 ~N~0)} is VALID [2020-07-28 14:27:36,923 INFO L280 TraceCheckUtils]: 34: Hoare triple {4094#(<= 3 ~N~0)} main_#t~ret8 := rangesum_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; {4176#(and (<= ULTIMATE.start_main_~i~2 0) (<= 3 ~N~0))} is VALID [2020-07-28 14:27:36,924 INFO L280 TraceCheckUtils]: 35: Hoare triple {4176#(and (<= ULTIMATE.start_main_~i~2 0) (<= 3 ~N~0))} assume !!(main_~i~2 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem11; {4176#(and (<= ULTIMATE.start_main_~i~2 0) (<= 3 ~N~0))} is VALID [2020-07-28 14:27:36,927 INFO L280 TraceCheckUtils]: 36: Hoare triple {4176#(and (<= ULTIMATE.start_main_~i~2 0) (<= 3 ~N~0))} main_#t~post10 := main_~i~2;main_~i~2 := 1 + main_#t~post10;havoc main_#t~post10; {4183#(and (<= 3 ~N~0) (<= ULTIMATE.start_main_~i~2 1))} is VALID [2020-07-28 14:27:36,928 INFO L280 TraceCheckUtils]: 37: Hoare triple {4183#(and (<= 3 ~N~0) (<= ULTIMATE.start_main_~i~2 1))} assume !(main_~i~2 < ~N~0 - 1); {4066#false} is VALID [2020-07-28 14:27:36,928 INFO L280 TraceCheckUtils]: 38: Hoare triple {4066#false} call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4 * (~N~0 - 1), 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; {4066#false} is VALID [2020-07-28 14:27:36,928 INFO L280 TraceCheckUtils]: 39: Hoare triple {4066#false} assume !!(rangesum_~i~1 < ~N~0); {4066#false} is VALID [2020-07-28 14:27:36,929 INFO L280 TraceCheckUtils]: 40: Hoare triple {4066#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {4066#false} is VALID [2020-07-28 14:27:36,929 INFO L280 TraceCheckUtils]: 41: Hoare triple {4066#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {4066#false} is VALID [2020-07-28 14:27:36,929 INFO L280 TraceCheckUtils]: 42: Hoare triple {4066#false} assume !!(rangesum_~i~1 < ~N~0); {4066#false} is VALID [2020-07-28 14:27:36,929 INFO L280 TraceCheckUtils]: 43: Hoare triple {4066#false} assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); {4066#false} is VALID [2020-07-28 14:27:36,930 INFO L280 TraceCheckUtils]: 44: Hoare triple {4066#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {4066#false} is VALID [2020-07-28 14:27:36,930 INFO L280 TraceCheckUtils]: 45: Hoare triple {4066#false} assume !!(rangesum_~i~1 < ~N~0); {4066#false} is VALID [2020-07-28 14:27:36,930 INFO L280 TraceCheckUtils]: 46: Hoare triple {4066#false} assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2);call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; {4066#false} is VALID [2020-07-28 14:27:36,930 INFO L280 TraceCheckUtils]: 47: Hoare triple {4066#false} rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; {4066#false} is VALID [2020-07-28 14:27:36,931 INFO L280 TraceCheckUtils]: 48: Hoare triple {4066#false} assume !(rangesum_~i~1 < ~N~0); {4066#false} is VALID [2020-07-28 14:27:36,931 INFO L280 TraceCheckUtils]: 49: Hoare triple {4066#false} assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); {4066#false} is VALID [2020-07-28 14:27:36,931 INFO L280 TraceCheckUtils]: 50: Hoare triple {4066#false} main_#t~ret12 := rangesum_#res;assume -2147483648 <= main_#t~ret12 && main_#t~ret12 <= 2147483647;main_~ret5~0 := main_#t~ret12;havoc main_#t~ret12; {4066#false} is VALID [2020-07-28 14:27:36,931 INFO L280 TraceCheckUtils]: 51: Hoare triple {4066#false} assume main_~ret~1 != main_~ret2~0 || main_~ret~1 != main_~ret5~0; {4066#false} is VALID [2020-07-28 14:27:36,931 INFO L280 TraceCheckUtils]: 52: Hoare triple {4066#false} assume !false; {4066#false} is VALID [2020-07-28 14:27:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-07-28 14:27:36,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007944406] [2020-07-28 14:27:36,934 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-28 14:27:36,934 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266710409] [2020-07-28 14:27:36,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-28 14:27:36,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-28 14:27:36,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176950850] [2020-07-28 14:27:36,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-28 14:27:36,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 14:27:36,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 14:27:36,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:36,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 14:27:36,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 14:27:36,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 14:27:36,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-28 14:27:36,995 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand 8 states. [2020-07-28 14:27:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:37,604 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2020-07-28 14:27:37,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 14:27:37,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-28 14:27:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 14:27:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 14:27:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2020-07-28 14:27:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 14:27:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2020-07-28 14:27:37,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2020-07-28 14:27:37,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 14:27:37,703 INFO L225 Difference]: With dead ends: 116 [2020-07-28 14:27:37,703 INFO L226 Difference]: Without dead ends: 88 [2020-07-28 14:27:37,704 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-07-28 14:27:37,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-28 14:27:37,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2020-07-28 14:27:37,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 14:27:37,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 86 states. [2020-07-28 14:27:37,804 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 86 states. [2020-07-28 14:27:37,804 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 86 states. [2020-07-28 14:27:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:37,806 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2020-07-28 14:27:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2020-07-28 14:27:37,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:37,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:37,807 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 88 states. [2020-07-28 14:27:37,807 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 88 states. [2020-07-28 14:27:37,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 14:27:37,809 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2020-07-28 14:27:37,809 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2020-07-28 14:27:37,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 14:27:37,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 14:27:37,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 14:27:37,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 14:27:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-28 14:27:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2020-07-28 14:27:37,812 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 53 [2020-07-28 14:27:37,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 14:27:37,812 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2020-07-28 14:27:37,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 14:27:37,813 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2020-07-28 14:27:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-28 14:27:37,813 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 14:27:37,813 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-07-28 14:27:38,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:27:38,015 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 14:27:38,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 14:27:38,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1875846409, now seen corresponding path program 2 times [2020-07-28 14:27:38,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 14:27:38,016 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116535246] [2020-07-28 14:27:38,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 14:27:38,044 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-28 14:27:38,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256677045] [2020-07-28 14:27:38,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:27:38,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 14:27:38,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-28 14:27:38,301 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:27:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 14:27:38,354 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 14:27:38,409 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 14:27:38,409 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 14:27:38,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 14:27:38,715 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 14:27:38,715 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 14:27:38,715 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-28 14:27:38,716 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-28 14:27:38,716 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-28 14:27:38,716 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-28 14:27:38,716 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-28 14:27:38,716 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-28 14:27:38,716 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 14:27:38,717 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-28 14:27:38,717 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-28 14:27:38,717 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-28 14:27:38,717 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-28 14:27:38,717 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-28 14:27:38,717 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 14:27:38,717 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-28 14:27:38,718 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-28 14:27:38,718 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-28 14:27:38,718 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-28 14:27:38,718 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-28 14:27:38,718 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-28 14:27:38,718 WARN L170 areAnnotationChecker]: L18-8 has no Hoare annotation [2020-07-28 14:27:38,719 WARN L170 areAnnotationChecker]: L18-8 has no Hoare annotation [2020-07-28 14:27:38,719 WARN L170 areAnnotationChecker]: L18-8 has no Hoare annotation [2020-07-28 14:27:38,719 WARN L170 areAnnotationChecker]: L18-9 has no Hoare annotation [2020-07-28 14:27:38,719 WARN L170 areAnnotationChecker]: L18-9 has no Hoare annotation [2020-07-28 14:27:38,719 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-28 14:27:38,719 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-28 14:27:38,719 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-28 14:27:38,720 WARN L170 areAnnotationChecker]: L18-7 has no Hoare annotation [2020-07-28 14:27:38,720 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-28 14:27:38,720 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-28 14:27:38,720 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-28 14:27:38,720 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-28 14:27:38,720 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-28 14:27:38,721 WARN L170 areAnnotationChecker]: L18-13 has no Hoare annotation [2020-07-28 14:27:38,721 WARN L170 areAnnotationChecker]: L18-13 has no Hoare annotation [2020-07-28 14:27:38,721 WARN L170 areAnnotationChecker]: L18-13 has no Hoare annotation [2020-07-28 14:27:38,721 WARN L170 areAnnotationChecker]: L18-14 has no Hoare annotation [2020-07-28 14:27:38,721 WARN L170 areAnnotationChecker]: L18-14 has no Hoare annotation [2020-07-28 14:27:38,721 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2020-07-28 14:27:38,721 WARN L170 areAnnotationChecker]: L19-4 has no Hoare annotation [2020-07-28 14:27:38,721 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2020-07-28 14:27:38,721 WARN L170 areAnnotationChecker]: L18-12 has no Hoare annotation [2020-07-28 14:27:38,721 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-28 14:27:38,721 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-28 14:27:38,722 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-28 14:27:38,722 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-28 14:27:38,722 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-28 14:27:38,722 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 14:27:38,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 02:27:38 BoogieIcfgContainer [2020-07-28 14:27:38,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 14:27:38,725 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 14:27:38,725 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 14:27:38,725 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 14:27:38,726 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 02:27:23" (3/4) ... [2020-07-28 14:27:38,728 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 14:27:38,832 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 14:27:38,832 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 14:27:38,836 INFO L168 Benchmark]: Toolchain (without parser) took 16550.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.0 MB). Free memory was 960.2 MB in the beginning and 973.5 MB in the end (delta: -13.3 MB). Peak memory consumption was 289.7 MB. Max. memory is 11.5 GB. [2020-07-28 14:27:38,836 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:27:38,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-07-28 14:27:38,837 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 14:27:38,837 INFO L168 Benchmark]: Boogie Preprocessor took 36.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 14:27:38,838 INFO L168 Benchmark]: RCFGBuilder took 677.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. [2020-07-28 14:27:38,838 INFO L168 Benchmark]: TraceAbstraction took 15284.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 991.1 MB in the end (delta: 87.1 MB). Peak memory consumption was 254.9 MB. Max. memory is 11.5 GB. [2020-07-28 14:27:38,839 INFO L168 Benchmark]: Witness Printer took 107.99 ms. Allocated memory is still 1.3 GB. Free memory was 991.1 MB in the beginning and 973.5 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2020-07-28 14:27:38,841 INFO L336 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 362.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 677.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15284.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 167.8 MB). Free memory was 1.1 GB in the beginning and 991.1 MB in the end (delta: 87.1 MB). Peak memory consumption was 254.9 MB. Max. memory is 11.5 GB. * Witness Printer took 107.99 ms. Allocated memory is still 1.3 GB. Free memory was 991.1 MB in the beginning and 973.5 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 53]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L4] int N; VAL [N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; [L6] int i; [L7] i = 0 VAL [N=3] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [N=3] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [N=3] [L7] COND TRUE i < N [L8] x[i] = __VERIFIER_nondet_int() [L7] i++ VAL [N=3] [L7] COND FALSE !(i < N) VAL [N=3] [L36] int temp; [L37] int ret; [L38] int ret2; [L39] int ret5; [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [N=3] [L18] COND TRUE i < N VAL [N=3] [L19] COND FALSE !(i > N/2) VAL [N=3] [L18] i++ VAL [N=3] [L18] COND TRUE i < N VAL [N=3] [L19] COND FALSE !(i > N/2) VAL [N=3] [L18] i++ VAL [N=3] [L18] COND TRUE i < N VAL [N=3] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [N=3] [L18] i++ VAL [N=3] [L18] COND FALSE !(i < N) VAL [N=3] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [N=3] [L41] ret = rangesum(x) [L43] EXPR x[0] [L43] temp=x[0] [L43] EXPR x[1] [L43] x[0] = x[1] [L43] x[1] = temp [L14] int i; [L15] long long ret; [L16] ret = 0 [L17] int cnt = 0; [L18] i = 0 VAL [N=3] [L18] COND TRUE i < N VAL [N=3] [L19] COND FALSE !(i > N/2) VAL [N=3] [L18] i++ VAL [N=3] [L18] COND TRUE i < N VAL [N=3] [L19] COND FALSE !(i > N/2) VAL [N=3] [L18] i++ VAL [N=3] [L18] COND TRUE i < N VAL [N=3] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [N=3] [L18] i++ VAL [N=3] [L18] COND FALSE !(i < N) VAL [N=3] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [N=3] [L44] ret2 = rangesum(x) [L45] EXPR x[0] [L45] temp=x[0] [L46] int i =0 ; VAL [N=3] [L46] COND TRUE i N/2) VAL [N=3] [L18] i++ VAL [N=3] [L18] COND TRUE i < N VAL [N=3] [L19] COND FALSE !(i > N/2) VAL [N=3] [L18] i++ VAL [N=3] [L18] COND TRUE i < N VAL [N=3] [L19] COND TRUE i > N/2 [L20] EXPR x[i] [L20] ret = ret + x[i] [L21] cnt = cnt + 1 VAL [N=3] [L18] i++ VAL [N=3] [L18] COND FALSE !(i < N) VAL [N=3] [L24] COND TRUE cnt !=0 [L25] return ret / cnt; VAL [N=3] [L50] ret5 = rangesum(x) [L52] COND TRUE ret != ret2 || ret !=ret5 VAL [N=3] [L53] __VERIFIER_error() VAL [N=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.1s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 286 SDtfs, 582 SDslu, 352 SDs, 0 SdLazy, 629 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 100 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 40267 SizeOfPredicates, 13 NumberOfNonLiveVariables, 884 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 160/198 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...