./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/sumt5.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/sumt5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b94a62921af11a29f5633c814830ac552a0eedfb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/sumt5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b94a62921af11a29f5633c814830ac552a0eedfb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:14:06,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:14:06,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:14:06,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:14:06,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:14:06,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:14:06,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:14:06,573 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:14:06,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:14:06,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:14:06,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:14:06,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:14:06,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:14:06,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:14:06,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:14:06,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:14:06,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:14:06,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:14:06,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:14:06,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:14:06,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:14:06,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:14:06,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:14:06,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:14:06,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:14:06,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:14:06,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:14:06,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:14:06,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:14:06,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:14:06,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:14:06,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:14:06,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:14:06,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:14:06,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:14:06,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:14:06,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:14:06,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:14:06,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:14:06,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:14:06,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:14:06,622 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 14:14:06,656 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:14:06,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:14:06,657 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:14:06,658 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:14:06,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:14:06,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:14:06,660 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:14:06,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:14:06,660 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:14:06,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:14:06,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:14:06,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:14:06,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:14:06,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:14:06,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:14:06,662 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:14:06,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:14:06,662 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:14:06,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:14:06,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:14:06,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:14:06,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:14:06,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:14:06,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:14:06,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:14:06,674 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:14:06,674 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:14:06,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:14:06,674 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:14:06,675 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:14:06,675 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b94a62921af11a29f5633c814830ac552a0eedfb [2021-09-13 14:14:06,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:14:06,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:14:06,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:14:06,985 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:14:06,986 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:14:06,987 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/sumt5.c [2021-09-13 14:14:07,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035cfaa01/8646139401384acab76cffed63df0135/FLAG248482bfb [2021-09-13 14:14:07,513 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:14:07,514 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt5.c [2021-09-13 14:14:07,520 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035cfaa01/8646139401384acab76cffed63df0135/FLAG248482bfb [2021-09-13 14:14:07,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035cfaa01/8646139401384acab76cffed63df0135 [2021-09-13 14:14:07,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:14:07,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:14:07,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:14:07,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:14:07,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:14:07,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:14:07" (1/1) ... [2021-09-13 14:14:07,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506111ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:07, skipping insertion in model container [2021-09-13 14:14:07,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:14:07" (1/1) ... [2021-09-13 14:14:07,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:14:07,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:14:07,694 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt5.c[403,416] [2021-09-13 14:14:07,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:14:07,727 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:14:07,749 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt5.c[403,416] [2021-09-13 14:14:07,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:14:07,798 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:14:07,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:07 WrapperNode [2021-09-13 14:14:07,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:14:07,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:14:07,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:14:07,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:14:07,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:07" (1/1) ... [2021-09-13 14:14:07,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:07" (1/1) ... [2021-09-13 14:14:07,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:14:07,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:14:07,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:14:07,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:14:07,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:07" (1/1) ... [2021-09-13 14:14:07,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:07" (1/1) ... [2021-09-13 14:14:07,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:07" (1/1) ... [2021-09-13 14:14:07,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:07" (1/1) ... [2021-09-13 14:14:07,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:07" (1/1) ... [2021-09-13 14:14:07,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:07" (1/1) ... [2021-09-13 14:14:07,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:07" (1/1) ... [2021-09-13 14:14:07,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:14:07,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:14:07,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:14:07,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:14:07,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:07" (1/1) ... [2021-09-13 14:14:07,878 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:14:07,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:14:07,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-13 14:14:07,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-13 14:14:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:14:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:14:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:14:07,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:14:08,169 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:14:08,169 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-09-13 14:14:08,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:14:08 BoogieIcfgContainer [2021-09-13 14:14:08,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:14:08,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:14:08,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:14:08,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:14:08,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:14:07" (1/3) ... [2021-09-13 14:14:08,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4429b467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:14:08, skipping insertion in model container [2021-09-13 14:14:08,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:07" (2/3) ... [2021-09-13 14:14:08,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4429b467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:14:08, skipping insertion in model container [2021-09-13 14:14:08,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:14:08" (3/3) ... [2021-09-13 14:14:08,177 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt5.c [2021-09-13 14:14:08,180 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:14:08,181 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 14:14:08,237 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:14:08,258 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 14:14:08,258 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 14:14:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-09-13 14:14:08,287 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:08,287 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:08,288 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:08,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:08,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1807766728, now seen corresponding path program 1 times [2021-09-13 14:14:08,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:08,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932675538] [2021-09-13 14:14:08,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:08,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:08,490 INFO L281 TraceCheckUtils]: 0: Hoare triple {20#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {20#true} is VALID [2021-09-13 14:14:08,491 INFO L281 TraceCheckUtils]: 1: Hoare triple {20#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0;main_~i~0 := 0;main_~k~0 := 0;main_~j~0 := 0;main_~l~0 := 0;main_~v3~0 := 0;main_~v4~0 := 0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {20#true} is VALID [2021-09-13 14:14:08,491 INFO L281 TraceCheckUtils]: 2: Hoare triple {20#true} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {20#true} is VALID [2021-09-13 14:14:08,493 INFO L281 TraceCheckUtils]: 3: Hoare triple {20#true} assume !true; {21#false} is VALID [2021-09-13 14:14:08,493 INFO L281 TraceCheckUtils]: 4: Hoare triple {21#false} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0 + main_~v3~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {21#false} is VALID [2021-09-13 14:14:08,494 INFO L281 TraceCheckUtils]: 5: Hoare triple {21#false} assume 0 == __VERIFIER_assert_~cond; {21#false} is VALID [2021-09-13 14:14:08,494 INFO L281 TraceCheckUtils]: 6: Hoare triple {21#false} assume !false; {21#false} is VALID [2021-09-13 14:14:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:08,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:08,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932675538] [2021-09-13 14:14:08,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932675538] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:14:08,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:14:08,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:14:08,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379073095] [2021-09-13 14:14:08,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:14:08,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:08,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:08,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:08,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:14:08,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:08,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:14:08,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:14:08,551 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:10,606 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:12,799 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:12,993 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2021-09-13 14:14:12,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:14:12,999 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:14:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2021-09-13 14:14:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2021-09-13 14:14:13,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2021-09-13 14:14:13,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:13,056 INFO L225 Difference]: With dead ends: 25 [2021-09-13 14:14:13,056 INFO L226 Difference]: Without dead ends: 13 [2021-09-13 14:14:13,058 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.05ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:14:13,061 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4053.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.46ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4228.93ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:13,062 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 22 Unknown, 0 Unchecked, 0.46ms Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 2 Unknown, 0 Unchecked, 4228.93ms Time] [2021-09-13 14:14:13,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-09-13 14:14:13,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-09-13 14:14:13,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:13,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:13,084 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:13,085 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:13,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:13,087 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2021-09-13 14:14:13,087 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2021-09-13 14:14:13,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:13,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:13,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2021-09-13 14:14:13,088 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2021-09-13 14:14:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:13,089 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2021-09-13 14:14:13,090 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2021-09-13 14:14:13,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:13,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:13,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:13,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2021-09-13 14:14:13,093 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 7 [2021-09-13 14:14:13,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:13,093 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2021-09-13 14:14:13,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:13,094 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2021-09-13 14:14:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-09-13 14:14:13,094 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:13,095 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:13,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:14:13,095 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:13,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:13,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1806992162, now seen corresponding path program 1 times [2021-09-13 14:14:13,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:13,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242204634] [2021-09-13 14:14:13,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:13,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:13,425 INFO L281 TraceCheckUtils]: 0: Hoare triple {94#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {94#true} is VALID [2021-09-13 14:14:13,426 INFO L281 TraceCheckUtils]: 1: Hoare triple {94#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0;main_~i~0 := 0;main_~k~0 := 0;main_~j~0 := 0;main_~l~0 := 0;main_~v3~0 := 0;main_~v4~0 := 0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {96#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:13,427 INFO L281 TraceCheckUtils]: 2: Hoare triple {96#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {96#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:13,427 INFO L281 TraceCheckUtils]: 3: Hoare triple {96#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {96#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:13,428 INFO L281 TraceCheckUtils]: 4: Hoare triple {96#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0 + main_~v3~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {97#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:14:13,429 INFO L281 TraceCheckUtils]: 5: Hoare triple {97#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {95#false} is VALID [2021-09-13 14:14:13,429 INFO L281 TraceCheckUtils]: 6: Hoare triple {95#false} assume !false; {95#false} is VALID [2021-09-13 14:14:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:13,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:13,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242204634] [2021-09-13 14:14:13,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242204634] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:14:13,430 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:14:13,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:14:13,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402098297] [2021-09-13 14:14:13,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:14:13,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:13,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:13,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:13,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:14:13,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:13,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:14:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:14:13,442 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:15,496 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:17,728 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:17,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:17,923 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2021-09-13 14:14:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:14:17,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:14:17,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2021-09-13 14:14:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2021-09-13 14:14:17,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2021-09-13 14:14:17,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:17,957 INFO L225 Difference]: With dead ends: 19 [2021-09-13 14:14:17,957 INFO L226 Difference]: Without dead ends: 15 [2021-09-13 14:14:17,958 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.28ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:14:17,959 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4069.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.84ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4387.02ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:17,959 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 0.84ms Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 4387.02ms Time] [2021-09-13 14:14:17,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-09-13 14:14:17,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-09-13 14:14:17,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:17,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:17,971 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:17,971 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:17,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:17,973 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2021-09-13 14:14:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2021-09-13 14:14:17,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:17,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:17,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2021-09-13 14:14:17,974 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2021-09-13 14:14:17,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:17,977 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2021-09-13 14:14:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2021-09-13 14:14:17,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:17,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:17,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:17,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:17,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2021-09-13 14:14:17,980 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 7 [2021-09-13 14:14:17,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:17,980 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2021-09-13 14:14:17,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2021-09-13 14:14:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:14:17,981 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:17,981 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:17,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-13 14:14:17,982 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:17,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:17,982 INFO L82 PathProgramCache]: Analyzing trace with hash 92541021, now seen corresponding path program 1 times [2021-09-13 14:14:17,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:17,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552985182] [2021-09-13 14:14:17,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:17,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:18,698 INFO L281 TraceCheckUtils]: 0: Hoare triple {169#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {171#(and (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2021-09-13 14:14:18,699 INFO L281 TraceCheckUtils]: 1: Hoare triple {171#(and (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (div ~SIZE~0 4294967296) 0))} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0;main_~i~0 := 0;main_~k~0 := 0;main_~j~0 := 0;main_~l~0 := 0;main_~v3~0 := 0;main_~v4~0 := 0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {172#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (< 0 (+ (div ~SIZE~0 4294967296) 1)) (= ULTIMATE.start_main_~j~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2021-09-13 14:14:18,700 INFO L281 TraceCheckUtils]: 2: Hoare triple {172#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (< 0 (+ (div ~SIZE~0 4294967296) 1)) (= ULTIMATE.start_main_~j~0 0) (<= (div ~SIZE~0 4294967296) 0))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {173#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:18,701 INFO L281 TraceCheckUtils]: 3: Hoare triple {173#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {174#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (<= (+ (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)) 1) ULTIMATE.start_main_~n~0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:18,702 INFO L281 TraceCheckUtils]: 4: Hoare triple {174#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (<= (+ (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)) 1) ULTIMATE.start_main_~n~0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 5 then main_~l~0 % 4294967296 % 5 - 5 else main_~l~0 % 4294967296 % 5) % 4294967296;main_~v3~0 := 1 + main_~v3~0; {175#(and (= ULTIMATE.start_main_~v4~0 0) (<= 1 ULTIMATE.start_main_~v3~0) (= ULTIMATE.start_main_~k~0 0) (<= (+ 2 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296))) (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~v3~0)) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0) (<= ULTIMATE.start_main_~v3~0 1))} is VALID [2021-09-13 14:14:18,703 INFO L281 TraceCheckUtils]: 5: Hoare triple {175#(and (= ULTIMATE.start_main_~v4~0 0) (<= 1 ULTIMATE.start_main_~v3~0) (= ULTIMATE.start_main_~k~0 0) (<= (+ 2 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296))) (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~v3~0)) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0) (<= ULTIMATE.start_main_~v3~0 1))} main_~l~0 := 1 + main_~l~0; {176#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (< (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296) (+ (div ULTIMATE.start_main_~l~0 4294967296) 1)) (= ULTIMATE.start_main_~i~0 0) (< (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296))) (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296)) 1)) (or (<= (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296))) (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296)))) (and (<= (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)) 1) (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~v3~0)) (<= ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~l~0))) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:18,706 INFO L281 TraceCheckUtils]: 6: Hoare triple {176#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (< (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296) (+ (div ULTIMATE.start_main_~l~0 4294967296) 1)) (= ULTIMATE.start_main_~i~0 0) (< (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296))) (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296)) 1)) (or (<= (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296))) (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296)))) (and (<= (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)) 1) (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~v3~0)) (<= ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~l~0))) (= ULTIMATE.start_main_~j~0 0))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {177#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (< (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296) (+ (div ULTIMATE.start_main_~l~0 4294967296) 1)) (<= (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296))) (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296)))) (= ULTIMATE.start_main_~i~0 0) (< (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296))) (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296)) 1)) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:18,707 INFO L281 TraceCheckUtils]: 7: Hoare triple {177#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (< (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296) (+ (div ULTIMATE.start_main_~l~0 4294967296) 1)) (<= (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296))) (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296)))) (= ULTIMATE.start_main_~i~0 0) (< (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296))) (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296)) 1)) (= ULTIMATE.start_main_~j~0 0))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0 + main_~v3~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {178#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:14:18,708 INFO L281 TraceCheckUtils]: 8: Hoare triple {178#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {170#false} is VALID [2021-09-13 14:14:18,710 INFO L281 TraceCheckUtils]: 9: Hoare triple {170#false} assume !false; {170#false} is VALID [2021-09-13 14:14:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:18,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:18,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552985182] [2021-09-13 14:14:18,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552985182] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:18,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733065507] [2021-09-13 14:14:18,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:18,712 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:14:18,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:14:18,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:14:18,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-09-13 14:14:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:18,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2021-09-13 14:14:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:18,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:14:19,167 INFO L281 TraceCheckUtils]: 0: Hoare triple {169#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {169#true} is VALID [2021-09-13 14:14:19,168 INFO L281 TraceCheckUtils]: 1: Hoare triple {169#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0;main_~i~0 := 0;main_~k~0 := 0;main_~j~0 := 0;main_~l~0 := 0;main_~v3~0 := 0;main_~v4~0 := 0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {173#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,168 INFO L281 TraceCheckUtils]: 2: Hoare triple {173#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {173#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,169 INFO L281 TraceCheckUtils]: 3: Hoare triple {173#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {173#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,170 INFO L281 TraceCheckUtils]: 4: Hoare triple {173#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 5 then main_~l~0 % 4294967296 % 5 - 5 else main_~l~0 % 4294967296 % 5) % 4294967296;main_~v3~0 := 1 + main_~v3~0; {194#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v3~0 1) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,171 INFO L281 TraceCheckUtils]: 5: Hoare triple {194#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v3~0 1) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} main_~l~0 := 1 + main_~l~0; {198#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~v3~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,171 INFO L281 TraceCheckUtils]: 6: Hoare triple {198#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~v3~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {198#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~v3~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,172 INFO L281 TraceCheckUtils]: 7: Hoare triple {198#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~v3~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0 + main_~v3~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {205#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:14:19,173 INFO L281 TraceCheckUtils]: 8: Hoare triple {205#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {170#false} is VALID [2021-09-13 14:14:19,173 INFO L281 TraceCheckUtils]: 9: Hoare triple {170#false} assume !false; {170#false} is VALID [2021-09-13 14:14:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:19,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:14:19,469 INFO L281 TraceCheckUtils]: 9: Hoare triple {170#false} assume !false; {170#false} is VALID [2021-09-13 14:14:19,470 INFO L281 TraceCheckUtils]: 8: Hoare triple {205#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {170#false} is VALID [2021-09-13 14:14:19,471 INFO L281 TraceCheckUtils]: 7: Hoare triple {218#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0 + main_~v3~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {205#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:14:19,471 INFO L281 TraceCheckUtils]: 6: Hoare triple {218#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {218#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:19,473 INFO L281 TraceCheckUtils]: 5: Hoare triple {225#(= (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296) (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296))} main_~l~0 := 1 + main_~l~0; {218#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:21,576 INFO L281 TraceCheckUtils]: 4: Hoare triple {218#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 5 then main_~l~0 % 4294967296 % 5 - 5 else main_~l~0 % 4294967296 % 5) % 4294967296;main_~v3~0 := 1 + main_~v3~0; {225#(= (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296) (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296))} is UNKNOWN [2021-09-13 14:14:21,577 INFO L281 TraceCheckUtils]: 3: Hoare triple {218#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {218#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:21,578 INFO L281 TraceCheckUtils]: 2: Hoare triple {218#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {218#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:21,578 INFO L281 TraceCheckUtils]: 1: Hoare triple {169#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0;main_~i~0 := 0;main_~k~0 := 0;main_~j~0 := 0;main_~l~0 := 0;main_~v3~0 := 0;main_~v4~0 := 0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {218#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~v3~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:21,579 INFO L281 TraceCheckUtils]: 0: Hoare triple {169#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {169#true} is VALID [2021-09-13 14:14:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-09-13 14:14:21,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733065507] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:21,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:14:21,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 6] total 15 [2021-09-13 14:14:21,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759486078] [2021-09-13 14:14:21,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:14:21,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:21,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:23,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 9 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:23,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:14:23,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:23,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:14:23,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:14:23,703 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:25,766 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:27,984 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:28,228 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2021-09-13 14:14:28,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:14:28,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:14:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2021-09-13 14:14:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:28,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2021-09-13 14:14:28,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2021-09-13 14:14:30,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:30,370 INFO L225 Difference]: With dead ends: 21 [2021-09-13 14:14:30,370 INFO L226 Difference]: Without dead ends: 17 [2021-09-13 14:14:30,371 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 457.48ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:14:30,371 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4093.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.86ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4408.49ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:30,372 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 60 Unknown, 0 Unchecked, 0.86ms Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 2 Unknown, 0 Unchecked, 4408.49ms Time] [2021-09-13 14:14:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-09-13 14:14:30,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-09-13 14:14:30,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:30,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:30,379 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:30,379 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:30,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:30,380 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2021-09-13 14:14:30,380 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2021-09-13 14:14:30,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:30,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:30,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2021-09-13 14:14:30,382 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2021-09-13 14:14:30,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:30,384 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2021-09-13 14:14:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2021-09-13 14:14:30,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:30,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:30,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:30,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2021-09-13 14:14:30,387 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 10 [2021-09-13 14:14:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:30,387 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2021-09-13 14:14:30,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2021-09-13 14:14:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 14:14:30,388 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:30,388 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:30,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-09-13 14:14:30,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:14:30,589 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:30,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:30,589 INFO L82 PathProgramCache]: Analyzing trace with hash -30668939, now seen corresponding path program 1 times [2021-09-13 14:14:30,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:30,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191043617] [2021-09-13 14:14:30,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:30,590 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:30,883 INFO L281 TraceCheckUtils]: 0: Hoare triple {318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {320#(and (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2021-09-13 14:14:30,884 INFO L281 TraceCheckUtils]: 1: Hoare triple {320#(and (< 0 (+ (div ~SIZE~0 4294967296) 1)) (<= (div ~SIZE~0 4294967296) 0))} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0;main_~i~0 := 0;main_~k~0 := 0;main_~j~0 := 0;main_~l~0 := 0;main_~v3~0 := 0;main_~v4~0 := 0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {321#(and (= ULTIMATE.start_main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2021-09-13 14:14:30,884 INFO L281 TraceCheckUtils]: 2: Hoare triple {321#(and (= ULTIMATE.start_main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {322#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:30,885 INFO L281 TraceCheckUtils]: 3: Hoare triple {322#(= ULTIMATE.start_main_~l~0 0)} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {322#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:30,885 INFO L281 TraceCheckUtils]: 4: Hoare triple {322#(= ULTIMATE.start_main_~l~0 0)} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 5 then main_~l~0 % 4294967296 % 5 - 5 else main_~l~0 % 4294967296 % 5) % 4294967296); {319#false} is VALID [2021-09-13 14:14:30,888 INFO L281 TraceCheckUtils]: 5: Hoare triple {319#false} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296;main_~v4~0 := 1 + main_~v4~0; {319#false} is VALID [2021-09-13 14:14:30,889 INFO L281 TraceCheckUtils]: 6: Hoare triple {319#false} main_~l~0 := 1 + main_~l~0; {319#false} is VALID [2021-09-13 14:14:30,889 INFO L281 TraceCheckUtils]: 7: Hoare triple {319#false} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {319#false} is VALID [2021-09-13 14:14:30,890 INFO L281 TraceCheckUtils]: 8: Hoare triple {319#false} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0 + main_~v3~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {319#false} is VALID [2021-09-13 14:14:30,891 INFO L281 TraceCheckUtils]: 9: Hoare triple {319#false} assume 0 == __VERIFIER_assert_~cond; {319#false} is VALID [2021-09-13 14:14:30,891 INFO L281 TraceCheckUtils]: 10: Hoare triple {319#false} assume !false; {319#false} is VALID [2021-09-13 14:14:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:30,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:30,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191043617] [2021-09-13 14:14:30,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191043617] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:14:30,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:14:30,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:14:30,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2926213] [2021-09-13 14:14:30,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-09-13 14:14:30,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:30,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:33,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 10 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:33,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:14:33,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:33,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:14:33,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:14:33,074 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:35,141 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:14:35,300 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.41ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:14:35,301 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2019.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.35ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2020.32ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:35,301 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 13 Unknown, 0 Unchecked, 0.35ms Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 1 Unknown, 0 Unchecked, 2020.32ms Time] [2021-09-13 14:14:35,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-09-13 14:14:35,303 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@6f8621d9 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.reviewInductiveInternal(ChainingHoareTripleChecker.java:318) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:290) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:863) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:779) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-09-13 14:14:35,306 INFO L158 Benchmark]: Toolchain (without parser) took 27766.35ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 27.3MB in the beginning and 43.1MB in the end (delta: -15.9MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2021-09-13 14:14:35,306 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 32.3MB in the beginning and 32.3MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:14:35,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.22ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 27.1MB in the beginning and 46.0MB in the end (delta: -18.9MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2021-09-13 14:14:35,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.41ms. Allocated memory is still 62.9MB. Free memory was 46.0MB in the beginning and 44.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:14:35,307 INFO L158 Benchmark]: Boogie Preprocessor took 25.29ms. Allocated memory is still 62.9MB. Free memory was 44.3MB in the beginning and 43.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:14:35,307 INFO L158 Benchmark]: RCFGBuilder took 306.67ms. Allocated memory is still 62.9MB. Free memory was 43.1MB in the beginning and 33.0MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-09-13 14:14:35,308 INFO L158 Benchmark]: TraceAbstraction took 27132.97ms. Allocated memory is still 62.9MB. Free memory was 32.5MB in the beginning and 43.3MB in the end (delta: -10.8MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2021-09-13 14:14:35,309 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 32.3MB in the beginning and 32.3MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.22ms. Allocated memory was 50.3MB in the beginning and 62.9MB in the end (delta: 12.6MB). Free memory was 27.1MB in the beginning and 46.0MB in the end (delta: -18.9MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.41ms. Allocated memory is still 62.9MB. Free memory was 46.0MB in the beginning and 44.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.29ms. Allocated memory is still 62.9MB. Free memory was 44.3MB in the beginning and 43.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 306.67ms. Allocated memory is still 62.9MB. Free memory was 43.1MB in the beginning and 33.0MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27132.97ms. Allocated memory is still 62.9MB. Free memory was 32.5MB in the beginning and 43.3MB in the end (delta: -10.8MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@6f8621d9 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@6f8621d9: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-09-13 14:14:35,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:14:37,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:14:37,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:14:37,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:14:37,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:14:37,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:14:37,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:14:37,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:14:37,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:14:37,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:14:37,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:14:37,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:14:37,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:14:37,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:14:37,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:14:37,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:14:37,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:14:37,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:14:37,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:14:37,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:14:37,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:14:37,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:14:37,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:14:37,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:14:37,268 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:14:37,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:14:37,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:14:37,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:14:37,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:14:37,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:14:37,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:14:37,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:14:37,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:14:37,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:14:37,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:14:37,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:14:37,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:14:37,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:14:37,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:14:37,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:14:37,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:14:37,280 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-09-13 14:14:37,314 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:14:37,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:14:37,315 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:14:37,315 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:14:37,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:14:37,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:14:37,317 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:14:37,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:14:37,318 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:14:37,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:14:37,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:14:37,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:14:37,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:14:37,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:14:37,319 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-09-13 14:14:37,319 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-09-13 14:14:37,320 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:14:37,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:14:37,320 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:14:37,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:14:37,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:14:37,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:14:37,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:14:37,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:14:37,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:14:37,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:14:37,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:14:37,322 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-09-13 14:14:37,322 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-09-13 14:14:37,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:14:37,322 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:14:37,322 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-09-13 14:14:37,323 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b94a62921af11a29f5633c814830ac552a0eedfb [2021-09-13 14:14:37,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:14:37,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:14:37,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:14:37,652 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:14:37,652 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:14:37,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/sumt5.c [2021-09-13 14:14:37,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/689b6769b/e30e277aa8e14001b54dfcc704d9e960/FLAG5cd814a77 [2021-09-13 14:14:38,058 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:14:38,059 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt5.c [2021-09-13 14:14:38,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/689b6769b/e30e277aa8e14001b54dfcc704d9e960/FLAG5cd814a77 [2021-09-13 14:14:38,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/689b6769b/e30e277aa8e14001b54dfcc704d9e960 [2021-09-13 14:14:38,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:14:38,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:14:38,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:14:38,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:14:38,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:14:38,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:14:38" (1/1) ... [2021-09-13 14:14:38,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36462001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:38, skipping insertion in model container [2021-09-13 14:14:38,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:14:38" (1/1) ... [2021-09-13 14:14:38,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:14:38,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:14:38,632 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt5.c[403,416] [2021-09-13 14:14:38,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:14:38,653 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:14:38,670 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt5.c[403,416] [2021-09-13 14:14:38,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:14:38,705 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:14:38,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:38 WrapperNode [2021-09-13 14:14:38,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:14:38,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:14:38,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:14:38,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:14:38,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:38" (1/1) ... [2021-09-13 14:14:38,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:38" (1/1) ... [2021-09-13 14:14:38,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:14:38,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:14:38,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:14:38,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:14:38,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:38" (1/1) ... [2021-09-13 14:14:38,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:38" (1/1) ... [2021-09-13 14:14:38,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:38" (1/1) ... [2021-09-13 14:14:38,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:38" (1/1) ... [2021-09-13 14:14:38,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:38" (1/1) ... [2021-09-13 14:14:38,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:38" (1/1) ... [2021-09-13 14:14:38,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:38" (1/1) ... [2021-09-13 14:14:38,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:14:38,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:14:38,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:14:38,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:14:38,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:38" (1/1) ... [2021-09-13 14:14:38,765 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:14:38,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:14:38,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-13 14:14:38,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-13 14:14:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-09-13 14:14:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:14:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:14:38,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:14:39,026 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:14:39,027 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-09-13 14:14:39,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:14:39 BoogieIcfgContainer [2021-09-13 14:14:39,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:14:39,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:14:39,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:14:39,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:14:39,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:14:38" (1/3) ... [2021-09-13 14:14:39,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f253e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:14:39, skipping insertion in model container [2021-09-13 14:14:39,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:38" (2/3) ... [2021-09-13 14:14:39,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f253e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:14:39, skipping insertion in model container [2021-09-13 14:14:39,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:14:39" (3/3) ... [2021-09-13 14:14:39,034 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt5.c [2021-09-13 14:14:39,038 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:14:39,038 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 14:14:39,080 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:14:39,086 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 14:14:39,086 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 14:14:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-09-13 14:14:39,102 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:39,102 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:39,102 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:39,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:39,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1807766728, now seen corresponding path program 1 times [2021-09-13 14:14:39,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:14:39,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170363164] [2021-09-13 14:14:39,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:39,117 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:14:39,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:14:39,129 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:14:39,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-09-13 14:14:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:39,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjunts are in the unsatisfiable core [2021-09-13 14:14:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:39,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:14:39,284 INFO L281 TraceCheckUtils]: 0: Hoare triple {20#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {20#true} is VALID [2021-09-13 14:14:39,285 INFO L281 TraceCheckUtils]: 1: Hoare triple {20#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {20#true} is VALID [2021-09-13 14:14:39,285 INFO L281 TraceCheckUtils]: 2: Hoare triple {20#true} assume !!~bvule32(main_~n~0, ~SIZE~0); {20#true} is VALID [2021-09-13 14:14:39,286 INFO L281 TraceCheckUtils]: 3: Hoare triple {20#true} assume !true; {21#false} is VALID [2021-09-13 14:14:39,286 INFO L281 TraceCheckUtils]: 4: Hoare triple {21#false} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {21#false} is VALID [2021-09-13 14:14:39,286 INFO L281 TraceCheckUtils]: 5: Hoare triple {21#false} assume 0bv32 == __VERIFIER_assert_~cond; {21#false} is VALID [2021-09-13 14:14:39,287 INFO L281 TraceCheckUtils]: 6: Hoare triple {21#false} assume !false; {21#false} is VALID [2021-09-13 14:14:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:39,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:14:39,321 INFO L281 TraceCheckUtils]: 6: Hoare triple {21#false} assume !false; {21#false} is VALID [2021-09-13 14:14:39,321 INFO L281 TraceCheckUtils]: 5: Hoare triple {21#false} assume 0bv32 == __VERIFIER_assert_~cond; {21#false} is VALID [2021-09-13 14:14:39,321 INFO L281 TraceCheckUtils]: 4: Hoare triple {21#false} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {21#false} is VALID [2021-09-13 14:14:39,322 INFO L281 TraceCheckUtils]: 3: Hoare triple {20#true} assume !true; {21#false} is VALID [2021-09-13 14:14:39,322 INFO L281 TraceCheckUtils]: 2: Hoare triple {20#true} assume !!~bvule32(main_~n~0, ~SIZE~0); {20#true} is VALID [2021-09-13 14:14:39,323 INFO L281 TraceCheckUtils]: 1: Hoare triple {20#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {20#true} is VALID [2021-09-13 14:14:39,323 INFO L281 TraceCheckUtils]: 0: Hoare triple {20#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {20#true} is VALID [2021-09-13 14:14:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:39,324 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:14:39,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170363164] [2021-09-13 14:14:39,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170363164] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:14:39,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:14:39,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-09-13 14:14:39,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907973884] [2021-09-13 14:14:39,335 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:14:39,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:39,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:39,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:39,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:14:39,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:14:39,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:14:39,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:14:39,387 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:39,615 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2021-09-13 14:14:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:14:39,616 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:14:39,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2021-09-13 14:14:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2021-09-13 14:14:39,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2021-09-13 14:14:39,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:39,724 INFO L225 Difference]: With dead ends: 25 [2021-09-13 14:14:39,724 INFO L226 Difference]: Without dead ends: 13 [2021-09-13 14:14:39,726 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.07ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:14:39,729 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.72ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 101.82ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:39,730 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 22 Unknown, 0 Unchecked, 0.72ms Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 101.82ms Time] [2021-09-13 14:14:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-09-13 14:14:39,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-09-13 14:14:39,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:39,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:39,753 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:39,753 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:39,755 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2021-09-13 14:14:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2021-09-13 14:14:39,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:39,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:39,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2021-09-13 14:14:39,765 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2021-09-13 14:14:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:39,767 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2021-09-13 14:14:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2021-09-13 14:14:39,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:39,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:39,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:39,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2021-09-13 14:14:39,771 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 7 [2021-09-13 14:14:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:39,771 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2021-09-13 14:14:39,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2021-09-13 14:14:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-09-13 14:14:39,773 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:39,773 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:39,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-09-13 14:14:39,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:14:39,984 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:39,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:39,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1806992162, now seen corresponding path program 1 times [2021-09-13 14:14:39,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:14:39,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444939900] [2021-09-13 14:14:39,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:39,986 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:14:39,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:14:39,987 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:14:40,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-09-13 14:14:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:40,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:14:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:40,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:14:40,370 INFO L281 TraceCheckUtils]: 0: Hoare triple {130#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {130#true} is VALID [2021-09-13 14:14:40,371 INFO L281 TraceCheckUtils]: 1: Hoare triple {130#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {138#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:14:40,372 INFO L281 TraceCheckUtils]: 2: Hoare triple {138#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {138#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:14:40,373 INFO L281 TraceCheckUtils]: 3: Hoare triple {138#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !~bvult32(main_~l~0, main_~n~0); {138#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:14:40,374 INFO L281 TraceCheckUtils]: 4: Hoare triple {138#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {148#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:14:40,375 INFO L281 TraceCheckUtils]: 5: Hoare triple {148#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {131#false} is VALID [2021-09-13 14:14:40,375 INFO L281 TraceCheckUtils]: 6: Hoare triple {131#false} assume !false; {131#false} is VALID [2021-09-13 14:14:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:40,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:14:42,497 INFO L281 TraceCheckUtils]: 6: Hoare triple {131#false} assume !false; {131#false} is VALID [2021-09-13 14:14:42,498 INFO L281 TraceCheckUtils]: 5: Hoare triple {158#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {131#false} is VALID [2021-09-13 14:14:42,499 INFO L281 TraceCheckUtils]: 4: Hoare triple {162#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {158#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:14:42,499 INFO L281 TraceCheckUtils]: 3: Hoare triple {162#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !~bvult32(main_~l~0, main_~n~0); {162#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:14:42,500 INFO L281 TraceCheckUtils]: 2: Hoare triple {162#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvule32(main_~n~0, ~SIZE~0); {162#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:14:42,501 INFO L281 TraceCheckUtils]: 1: Hoare triple {130#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {162#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:14:42,501 INFO L281 TraceCheckUtils]: 0: Hoare triple {130#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {130#true} is VALID [2021-09-13 14:14:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:42,502 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:14:42,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444939900] [2021-09-13 14:14:42,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444939900] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:14:42,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:14:42,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-09-13 14:14:42,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788590581] [2021-09-13 14:14:42,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:14:42,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:42,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:42,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:42,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:14:42,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:14:42,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:14:42,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:14:42,525 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:43,166 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2021-09-13 14:14:43,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:14:43,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:14:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2021-09-13 14:14:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2021-09-13 14:14:43,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2021-09-13 14:14:43,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:43,343 INFO L225 Difference]: With dead ends: 27 [2021-09-13 14:14:43,343 INFO L226 Difference]: Without dead ends: 15 [2021-09-13 14:14:43,343 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 82.47ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:14:43,344 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 294.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.08ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 296.07ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:43,345 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 67 Unknown, 0 Unchecked, 1.08ms Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 296.07ms Time] [2021-09-13 14:14:43,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-09-13 14:14:43,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-09-13 14:14:43,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:43,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:43,359 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:43,359 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:43,360 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2021-09-13 14:14:43,361 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2021-09-13 14:14:43,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:43,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:43,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2021-09-13 14:14:43,362 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2021-09-13 14:14:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:43,363 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2021-09-13 14:14:43,363 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2021-09-13 14:14:43,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:43,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:43,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:43,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2021-09-13 14:14:43,366 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 7 [2021-09-13 14:14:43,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:43,366 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-09-13 14:14:43,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2021-09-13 14:14:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:14:43,367 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:43,367 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:43,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-09-13 14:14:43,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:14:43,576 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:43,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:43,577 INFO L82 PathProgramCache]: Analyzing trace with hash 92541021, now seen corresponding path program 1 times [2021-09-13 14:14:43,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:14:43,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395039598] [2021-09-13 14:14:43,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:43,578 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:14:43,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:14:43,579 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:14:43,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-09-13 14:14:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:43,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:14:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:43,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:14:44,036 INFO L281 TraceCheckUtils]: 0: Hoare triple {253#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {253#true} is VALID [2021-09-13 14:14:44,037 INFO L281 TraceCheckUtils]: 1: Hoare triple {253#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {261#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:14:44,038 INFO L281 TraceCheckUtils]: 2: Hoare triple {261#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {261#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:14:44,038 INFO L281 TraceCheckUtils]: 3: Hoare triple {261#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {261#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:14:44,039 INFO L281 TraceCheckUtils]: 4: Hoare triple {261#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {271#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:14:44,040 INFO L281 TraceCheckUtils]: 5: Hoare triple {271#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {275#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:14:44,041 INFO L281 TraceCheckUtils]: 6: Hoare triple {275#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !~bvult32(main_~l~0, main_~n~0); {275#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:14:44,041 INFO L281 TraceCheckUtils]: 7: Hoare triple {275#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {282#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:14:44,042 INFO L281 TraceCheckUtils]: 8: Hoare triple {282#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {254#false} is VALID [2021-09-13 14:14:44,042 INFO L281 TraceCheckUtils]: 9: Hoare triple {254#false} assume !false; {254#false} is VALID [2021-09-13 14:14:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:44,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:14:50,374 INFO L281 TraceCheckUtils]: 9: Hoare triple {254#false} assume !false; {254#false} is VALID [2021-09-13 14:14:50,375 INFO L281 TraceCheckUtils]: 8: Hoare triple {292#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {254#false} is VALID [2021-09-13 14:14:50,377 INFO L281 TraceCheckUtils]: 7: Hoare triple {296#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {292#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:14:50,385 INFO L281 TraceCheckUtils]: 6: Hoare triple {296#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !~bvult32(main_~l~0, main_~n~0); {296#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:14:50,398 INFO L281 TraceCheckUtils]: 5: Hoare triple {303#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {296#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:14:52,403 INFO L281 TraceCheckUtils]: 4: Hoare triple {296#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {303#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:14:52,404 INFO L281 TraceCheckUtils]: 3: Hoare triple {296#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvult32(main_~l~0, main_~n~0); {296#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:14:52,405 INFO L281 TraceCheckUtils]: 2: Hoare triple {296#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvule32(main_~n~0, ~SIZE~0); {296#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:14:52,406 INFO L281 TraceCheckUtils]: 1: Hoare triple {253#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {296#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:14:52,406 INFO L281 TraceCheckUtils]: 0: Hoare triple {253#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {253#true} is VALID [2021-09-13 14:14:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-09-13 14:14:52,407 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:14:52,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395039598] [2021-09-13 14:14:52,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395039598] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:52,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-09-13 14:14:52,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2021-09-13 14:14:52,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215440427] [2021-09-13 14:14:52,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:14:52,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:52,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:54,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 9 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:54,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:14:54,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:14:54,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:14:54,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:14:54,459 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:56,839 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:58,913 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:01,075 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:03,093 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:03,248 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2021-09-13 14:15:03,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:15:03,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:15:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:15:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2021-09-13 14:15:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2021-09-13 14:15:03,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2021-09-13 14:15:05,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:15:05,372 INFO L225 Difference]: With dead ends: 25 [2021-09-13 14:15:05,372 INFO L226 Difference]: Without dead ends: 21 [2021-09-13 14:15:05,373 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 211.09ms TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:15:05,374 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8286.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.95ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8294.09ms IncrementalHoareTripleChecker+Time [2021-09-13 14:15:05,374 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.95ms Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 4 Unknown, 0 Unchecked, 8294.09ms Time] [2021-09-13 14:15:05,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-09-13 14:15:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2021-09-13 14:15:05,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:15:05,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:05,385 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:05,385 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:05,386 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2021-09-13 14:15:05,386 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2021-09-13 14:15:05,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:05,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:05,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2021-09-13 14:15:05,387 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2021-09-13 14:15:05,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:05,389 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2021-09-13 14:15:05,389 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2021-09-13 14:15:05,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:05,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:05,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:15:05,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:15:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2021-09-13 14:15:05,391 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 10 [2021-09-13 14:15:05,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:15:05,391 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2021-09-13 14:15:05,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:05,391 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2021-09-13 14:15:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 14:15:05,392 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:15:05,392 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:15:05,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-09-13 14:15:05,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:15:05,595 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:15:05,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:15:05,595 INFO L82 PathProgramCache]: Analyzing trace with hash -559120592, now seen corresponding path program 1 times [2021-09-13 14:15:05,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:15:05,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763870222] [2021-09-13 14:15:05,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:15:05,596 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:15:05,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:15:05,597 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:15:05,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-09-13 14:15:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:05,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:15:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:05,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:15:05,754 INFO L281 TraceCheckUtils]: 0: Hoare triple {411#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {411#true} is VALID [2021-09-13 14:15:05,755 INFO L281 TraceCheckUtils]: 1: Hoare triple {411#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {419#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:05,759 INFO L281 TraceCheckUtils]: 2: Hoare triple {419#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume !!~bvule32(main_~n~0, ~SIZE~0); {419#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:05,760 INFO L281 TraceCheckUtils]: 3: Hoare triple {419#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume !!~bvult32(main_~l~0, main_~n~0); {419#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:05,760 INFO L281 TraceCheckUtils]: 4: Hoare triple {419#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {419#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:05,761 INFO L281 TraceCheckUtils]: 5: Hoare triple {419#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {432#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:05,762 INFO L281 TraceCheckUtils]: 6: Hoare triple {432#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !!~bvult32(main_~l~0, main_~n~0); {432#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:05,762 INFO L281 TraceCheckUtils]: 7: Hoare triple {432#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {432#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:05,763 INFO L281 TraceCheckUtils]: 8: Hoare triple {432#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {412#false} is VALID [2021-09-13 14:15:05,763 INFO L281 TraceCheckUtils]: 9: Hoare triple {412#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {412#false} is VALID [2021-09-13 14:15:05,763 INFO L281 TraceCheckUtils]: 10: Hoare triple {412#false} assume !~bvult32(main_~l~0, main_~n~0); {412#false} is VALID [2021-09-13 14:15:05,764 INFO L281 TraceCheckUtils]: 11: Hoare triple {412#false} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {412#false} is VALID [2021-09-13 14:15:05,764 INFO L281 TraceCheckUtils]: 12: Hoare triple {412#false} assume 0bv32 == __VERIFIER_assert_~cond; {412#false} is VALID [2021-09-13 14:15:05,764 INFO L281 TraceCheckUtils]: 13: Hoare triple {412#false} assume !false; {412#false} is VALID [2021-09-13 14:15:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:15:05,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:15:05,868 INFO L281 TraceCheckUtils]: 13: Hoare triple {412#false} assume !false; {412#false} is VALID [2021-09-13 14:15:05,868 INFO L281 TraceCheckUtils]: 12: Hoare triple {412#false} assume 0bv32 == __VERIFIER_assert_~cond; {412#false} is VALID [2021-09-13 14:15:05,868 INFO L281 TraceCheckUtils]: 11: Hoare triple {412#false} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {412#false} is VALID [2021-09-13 14:15:05,869 INFO L281 TraceCheckUtils]: 10: Hoare triple {412#false} assume !~bvult32(main_~l~0, main_~n~0); {412#false} is VALID [2021-09-13 14:15:05,869 INFO L281 TraceCheckUtils]: 9: Hoare triple {412#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {412#false} is VALID [2021-09-13 14:15:05,869 INFO L281 TraceCheckUtils]: 8: Hoare triple {472#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv4 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {412#false} is VALID [2021-09-13 14:15:05,870 INFO L281 TraceCheckUtils]: 7: Hoare triple {472#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv4 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {472#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv4 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:05,870 INFO L281 TraceCheckUtils]: 6: Hoare triple {472#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv4 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {472#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv4 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:05,871 INFO L281 TraceCheckUtils]: 5: Hoare triple {482#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {472#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv4 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:05,872 INFO L281 TraceCheckUtils]: 4: Hoare triple {482#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {482#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:05,872 INFO L281 TraceCheckUtils]: 3: Hoare triple {482#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {482#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:05,873 INFO L281 TraceCheckUtils]: 2: Hoare triple {482#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {482#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:05,873 INFO L281 TraceCheckUtils]: 1: Hoare triple {411#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {482#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv4 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:05,874 INFO L281 TraceCheckUtils]: 0: Hoare triple {411#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {411#true} is VALID [2021-09-13 14:15:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:15:05,875 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:15:05,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763870222] [2021-09-13 14:15:05,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763870222] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:15:05,875 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:15:05,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-09-13 14:15:05,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011679813] [2021-09-13 14:15:05,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 14:15:05,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:15:05,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:05,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:15:05,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:15:05,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:15:05,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:15:05,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:15:05,967 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:06,599 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2021-09-13 14:15:06,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-13 14:15:06,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 14:15:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:15:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2021-09-13 14:15:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2021-09-13 14:15:06,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 69 transitions. [2021-09-13 14:15:06,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:15:06,862 INFO L225 Difference]: With dead ends: 54 [2021-09-13 14:15:06,862 INFO L226 Difference]: Without dead ends: 41 [2021-09-13 14:15:06,863 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.09ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:15:06,863 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 300.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.31ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 301.97ms IncrementalHoareTripleChecker+Time [2021-09-13 14:15:06,864 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 87 Unknown, 0 Unchecked, 1.31ms Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 301.97ms Time] [2021-09-13 14:15:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-09-13 14:15:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2021-09-13 14:15:06,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:15:06,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:06,875 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:06,875 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:06,877 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2021-09-13 14:15:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2021-09-13 14:15:06,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:06,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:06,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2021-09-13 14:15:06,878 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2021-09-13 14:15:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:06,880 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2021-09-13 14:15:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2021-09-13 14:15:06,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:06,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:06,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:15:06,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:15:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2021-09-13 14:15:06,883 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 14 [2021-09-13 14:15:06,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:15:06,883 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2021-09-13 14:15:06,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2021-09-13 14:15:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 14:15:06,884 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:15:06,884 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:15:06,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-09-13 14:15:07,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:15:07,099 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:15:07,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:15:07,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1749305641, now seen corresponding path program 1 times [2021-09-13 14:15:07,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:15:07,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82700233] [2021-09-13 14:15:07,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:15:07,101 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:15:07,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:15:07,102 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:15:07,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-09-13 14:15:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:07,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 14:15:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:07,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:15:07,909 INFO L281 TraceCheckUtils]: 0: Hoare triple {678#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {678#true} is VALID [2021-09-13 14:15:07,909 INFO L281 TraceCheckUtils]: 1: Hoare triple {678#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {686#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:07,910 INFO L281 TraceCheckUtils]: 2: Hoare triple {686#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {686#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:07,913 INFO L281 TraceCheckUtils]: 3: Hoare triple {686#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {686#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:07,913 INFO L281 TraceCheckUtils]: 4: Hoare triple {686#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {696#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:07,914 INFO L281 TraceCheckUtils]: 5: Hoare triple {696#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {700#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:07,915 INFO L281 TraceCheckUtils]: 6: Hoare triple {700#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {700#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:07,915 INFO L281 TraceCheckUtils]: 7: Hoare triple {700#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {700#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:07,916 INFO L281 TraceCheckUtils]: 8: Hoare triple {700#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {700#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:07,918 INFO L281 TraceCheckUtils]: 9: Hoare triple {700#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {700#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:07,919 INFO L281 TraceCheckUtils]: 10: Hoare triple {700#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {716#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:07,919 INFO L281 TraceCheckUtils]: 11: Hoare triple {716#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {720#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:15:07,920 INFO L281 TraceCheckUtils]: 12: Hoare triple {720#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume !~bvult32(main_~l~0, main_~n~0); {720#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:15:07,921 INFO L281 TraceCheckUtils]: 13: Hoare triple {720#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {727#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:15:07,921 INFO L281 TraceCheckUtils]: 14: Hoare triple {727#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {679#false} is VALID [2021-09-13 14:15:07,921 INFO L281 TraceCheckUtils]: 15: Hoare triple {679#false} assume !false; {679#false} is VALID [2021-09-13 14:15:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:15:07,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:15:10,272 INFO L281 TraceCheckUtils]: 15: Hoare triple {679#false} assume !false; {679#false} is VALID [2021-09-13 14:15:10,274 INFO L281 TraceCheckUtils]: 14: Hoare triple {737#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {679#false} is VALID [2021-09-13 14:15:10,274 INFO L281 TraceCheckUtils]: 13: Hoare triple {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {737#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:15:10,275 INFO L281 TraceCheckUtils]: 12: Hoare triple {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !~bvult32(main_~l~0, main_~n~0); {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:15:10,290 INFO L281 TraceCheckUtils]: 11: Hoare triple {748#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:15:12,292 INFO L281 TraceCheckUtils]: 10: Hoare triple {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {748#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:15:12,293 INFO L281 TraceCheckUtils]: 9: Hoare triple {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:15:12,293 INFO L281 TraceCheckUtils]: 8: Hoare triple {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:15:12,294 INFO L281 TraceCheckUtils]: 7: Hoare triple {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:15:12,294 INFO L281 TraceCheckUtils]: 6: Hoare triple {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvult32(main_~l~0, main_~n~0); {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:15:12,307 INFO L281 TraceCheckUtils]: 5: Hoare triple {748#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:15:14,313 INFO L281 TraceCheckUtils]: 4: Hoare triple {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {748#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:15:14,324 INFO L281 TraceCheckUtils]: 3: Hoare triple {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvult32(main_~l~0, main_~n~0); {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:15:14,324 INFO L281 TraceCheckUtils]: 2: Hoare triple {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvule32(main_~n~0, ~SIZE~0); {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:15:14,325 INFO L281 TraceCheckUtils]: 1: Hoare triple {678#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {741#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:15:14,325 INFO L281 TraceCheckUtils]: 0: Hoare triple {678#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {678#true} is VALID [2021-09-13 14:15:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-09-13 14:15:14,325 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:15:14,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82700233] [2021-09-13 14:15:14,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82700233] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:15:14,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-09-13 14:15:14,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2021-09-13 14:15:14,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998892524] [2021-09-13 14:15:14,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-13 14:15:14,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:15:14,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:18,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 12 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2021-09-13 14:15:18,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:15:18,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:15:18,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:15:18,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:15:18,393 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:20,978 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:23,062 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:25,188 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:25,254 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2021-09-13 14:15:25,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:15:25,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-13 14:15:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:15:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2021-09-13 14:15:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2021-09-13 14:15:25,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2021-09-13 14:15:29,382 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 29 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2021-09-13 14:15:29,384 INFO L225 Difference]: With dead ends: 45 [2021-09-13 14:15:29,384 INFO L226 Difference]: Without dead ends: 41 [2021-09-13 14:15:29,384 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 274.68ms TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:15:29,385 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6342.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.94ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6348.92ms IncrementalHoareTripleChecker+Time [2021-09-13 14:15:29,385 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.94ms Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 6348.92ms Time] [2021-09-13 14:15:29,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-09-13 14:15:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-09-13 14:15:29,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:15:29,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:29,403 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:29,403 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:29,413 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2021-09-13 14:15:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2021-09-13 14:15:29,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:29,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:29,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2021-09-13 14:15:29,414 INFO L87 Difference]: Start difference. First operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2021-09-13 14:15:29,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:29,418 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2021-09-13 14:15:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2021-09-13 14:15:29,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:29,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:29,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:15:29,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:15:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2021-09-13 14:15:29,422 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 16 [2021-09-13 14:15:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:15:29,422 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2021-09-13 14:15:29,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:29,423 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2021-09-13 14:15:29,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-13 14:15:29,425 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:15:29,425 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:15:29,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-09-13 14:15:29,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:15:29,636 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:15:29,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:15:29,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1822878511, now seen corresponding path program 1 times [2021-09-13 14:15:29,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:15:29,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155217272] [2021-09-13 14:15:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:15:29,640 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:15:29,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:15:29,641 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:15:29,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-09-13 14:15:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:29,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2021-09-13 14:15:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:29,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:15:29,873 INFO L281 TraceCheckUtils]: 0: Hoare triple {965#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {965#true} is VALID [2021-09-13 14:15:29,874 INFO L281 TraceCheckUtils]: 1: Hoare triple {965#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {973#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:29,874 INFO L281 TraceCheckUtils]: 2: Hoare triple {973#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume !!~bvule32(main_~n~0, ~SIZE~0); {973#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:29,874 INFO L281 TraceCheckUtils]: 3: Hoare triple {973#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume !!~bvult32(main_~l~0, main_~n~0); {973#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:29,876 INFO L281 TraceCheckUtils]: 4: Hoare triple {973#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {973#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:29,876 INFO L281 TraceCheckUtils]: 5: Hoare triple {973#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {986#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:29,876 INFO L281 TraceCheckUtils]: 6: Hoare triple {986#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !!~bvult32(main_~l~0, main_~n~0); {986#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:29,878 INFO L281 TraceCheckUtils]: 7: Hoare triple {986#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {986#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:29,878 INFO L281 TraceCheckUtils]: 8: Hoare triple {986#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {986#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:29,884 INFO L281 TraceCheckUtils]: 9: Hoare triple {986#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {986#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:29,885 INFO L281 TraceCheckUtils]: 10: Hoare triple {986#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {986#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:29,885 INFO L281 TraceCheckUtils]: 11: Hoare triple {986#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1005#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:15:29,886 INFO L281 TraceCheckUtils]: 12: Hoare triple {1005#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {1005#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:15:29,886 INFO L281 TraceCheckUtils]: 13: Hoare triple {1005#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {1005#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:15:29,887 INFO L281 TraceCheckUtils]: 14: Hoare triple {1005#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1005#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:15:29,887 INFO L281 TraceCheckUtils]: 15: Hoare triple {1005#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 3bv32);main_~i~0 := ~bvadd32(1bv32, main_~i~0); {966#false} is VALID [2021-09-13 14:15:29,887 INFO L281 TraceCheckUtils]: 16: Hoare triple {966#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {966#false} is VALID [2021-09-13 14:15:29,888 INFO L281 TraceCheckUtils]: 17: Hoare triple {966#false} assume !~bvult32(main_~l~0, main_~n~0); {966#false} is VALID [2021-09-13 14:15:29,888 INFO L281 TraceCheckUtils]: 18: Hoare triple {966#false} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {966#false} is VALID [2021-09-13 14:15:29,888 INFO L281 TraceCheckUtils]: 19: Hoare triple {966#false} assume 0bv32 == __VERIFIER_assert_~cond; {966#false} is VALID [2021-09-13 14:15:29,888 INFO L281 TraceCheckUtils]: 20: Hoare triple {966#false} assume !false; {966#false} is VALID [2021-09-13 14:15:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:15:29,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:15:30,743 INFO L281 TraceCheckUtils]: 20: Hoare triple {966#false} assume !false; {966#false} is VALID [2021-09-13 14:15:30,743 INFO L281 TraceCheckUtils]: 19: Hoare triple {966#false} assume 0bv32 == __VERIFIER_assert_~cond; {966#false} is VALID [2021-09-13 14:15:30,743 INFO L281 TraceCheckUtils]: 18: Hoare triple {966#false} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {966#false} is VALID [2021-09-13 14:15:30,743 INFO L281 TraceCheckUtils]: 17: Hoare triple {966#false} assume !~bvult32(main_~l~0, main_~n~0); {966#false} is VALID [2021-09-13 14:15:30,744 INFO L281 TraceCheckUtils]: 16: Hoare triple {966#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {966#false} is VALID [2021-09-13 14:15:30,744 INFO L281 TraceCheckUtils]: 15: Hoare triple {1048#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~l~0 (_ bv3 32))))} assume 0bv32 == ~bvurem32(main_~l~0, 3bv32);main_~i~0 := ~bvadd32(1bv32, main_~i~0); {966#false} is VALID [2021-09-13 14:15:30,745 INFO L281 TraceCheckUtils]: 14: Hoare triple {1048#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~l~0 (_ bv3 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1048#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~l~0 (_ bv3 32))))} is VALID [2021-09-13 14:15:30,745 INFO L281 TraceCheckUtils]: 13: Hoare triple {1048#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~l~0 (_ bv3 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {1048#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~l~0 (_ bv3 32))))} is VALID [2021-09-13 14:15:30,746 INFO L281 TraceCheckUtils]: 12: Hoare triple {1048#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~l~0 (_ bv3 32))))} assume !!~bvult32(main_~l~0, main_~n~0); {1048#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~l~0 (_ bv3 32))))} is VALID [2021-09-13 14:15:30,746 INFO L281 TraceCheckUtils]: 11: Hoare triple {1061#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1048#(not (= (_ bv0 32) (bvurem ULTIMATE.start_main_~l~0 (_ bv3 32))))} is VALID [2021-09-13 14:15:30,746 INFO L281 TraceCheckUtils]: 10: Hoare triple {1061#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {1061#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} is VALID [2021-09-13 14:15:30,747 INFO L281 TraceCheckUtils]: 9: Hoare triple {1061#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1061#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} is VALID [2021-09-13 14:15:30,747 INFO L281 TraceCheckUtils]: 8: Hoare triple {1061#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1061#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} is VALID [2021-09-13 14:15:30,748 INFO L281 TraceCheckUtils]: 7: Hoare triple {1061#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {1061#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} is VALID [2021-09-13 14:15:30,748 INFO L281 TraceCheckUtils]: 6: Hoare triple {1061#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} assume !!~bvult32(main_~l~0, main_~n~0); {1061#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} is VALID [2021-09-13 14:15:32,755 INFO L281 TraceCheckUtils]: 5: Hoare triple {1080#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv3 32)) (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1061#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv3 32))))} is UNKNOWN [2021-09-13 14:15:32,756 INFO L281 TraceCheckUtils]: 4: Hoare triple {1080#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv3 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {1080#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv3 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:32,756 INFO L281 TraceCheckUtils]: 3: Hoare triple {1080#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv3 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {1080#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv3 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:32,756 INFO L281 TraceCheckUtils]: 2: Hoare triple {1080#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv3 32)) (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {1080#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv3 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:32,757 INFO L281 TraceCheckUtils]: 1: Hoare triple {965#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {1080#(not (= (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv3 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:32,757 INFO L281 TraceCheckUtils]: 0: Hoare triple {965#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {965#true} is VALID [2021-09-13 14:15:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:15:32,757 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:15:32,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155217272] [2021-09-13 14:15:32,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155217272] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:15:32,758 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:15:32,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-09-13 14:15:32,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871061465] [2021-09-13 14:15:32,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-09-13 14:15:32,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:15:32,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:35,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:15:35,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:15:35,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:15:35,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:15:35,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:15:35,003 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:41,151 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:44,458 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:15:47,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:47,854 INFO L93 Difference]: Finished difference Result 101 states and 136 transitions. [2021-09-13 14:15:47,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:15:47,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-09-13 14:15:47,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:15:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2021-09-13 14:15:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2021-09-13 14:15:47,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 101 transitions. [2021-09-13 14:15:54,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 99 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2021-09-13 14:15:54,258 INFO L225 Difference]: With dead ends: 101 [2021-09-13 14:15:54,258 INFO L226 Difference]: Without dead ends: 77 [2021-09-13 14:15:54,258 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1162.46ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:15:54,259 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7596.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.51ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7619.72ms IncrementalHoareTripleChecker+Time [2021-09-13 14:15:54,259 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 133 Unknown, 0 Unchecked, 2.51ms Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 7619.72ms Time] [2021-09-13 14:15:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-09-13 14:15:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2021-09-13 14:15:54,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:15:54,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 55 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:54,279 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 55 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:54,279 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 55 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:54,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:54,282 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2021-09-13 14:15:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2021-09-13 14:15:54,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:54,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:54,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2021-09-13 14:15:54,283 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2021-09-13 14:15:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:54,285 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2021-09-13 14:15:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2021-09-13 14:15:54,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:54,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:54,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:15:54,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:15:54,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2021-09-13 14:15:54,288 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 21 [2021-09-13 14:15:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:15:54,288 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2021-09-13 14:15:54,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:15:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2021-09-13 14:15:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:15:54,289 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:15:54,290 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:15:54,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-09-13 14:15:54,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:15:54,502 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:15:54,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:15:54,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1007159223, now seen corresponding path program 1 times [2021-09-13 14:15:54,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:15:54,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077918470] [2021-09-13 14:15:54,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:15:54,503 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:15:54,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:15:54,504 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:15:54,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-09-13 14:15:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:54,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:15:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:54,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:15:55,564 INFO L281 TraceCheckUtils]: 0: Hoare triple {1433#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {1433#true} is VALID [2021-09-13 14:15:55,565 INFO L281 TraceCheckUtils]: 1: Hoare triple {1433#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {1441#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:55,565 INFO L281 TraceCheckUtils]: 2: Hoare triple {1441#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {1441#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:55,566 INFO L281 TraceCheckUtils]: 3: Hoare triple {1441#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {1441#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:55,567 INFO L281 TraceCheckUtils]: 4: Hoare triple {1441#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {1451#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:55,567 INFO L281 TraceCheckUtils]: 5: Hoare triple {1451#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1455#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:55,568 INFO L281 TraceCheckUtils]: 6: Hoare triple {1455#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {1455#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:55,568 INFO L281 TraceCheckUtils]: 7: Hoare triple {1455#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {1455#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:55,569 INFO L281 TraceCheckUtils]: 8: Hoare triple {1455#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1455#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:55,569 INFO L281 TraceCheckUtils]: 9: Hoare triple {1455#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1455#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:55,570 INFO L281 TraceCheckUtils]: 10: Hoare triple {1455#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {1471#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:55,570 INFO L281 TraceCheckUtils]: 11: Hoare triple {1471#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1475#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:15:55,571 INFO L281 TraceCheckUtils]: 12: Hoare triple {1475#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume !!~bvult32(main_~l~0, main_~n~0); {1475#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:15:55,572 INFO L281 TraceCheckUtils]: 13: Hoare triple {1475#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {1475#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:15:55,572 INFO L281 TraceCheckUtils]: 14: Hoare triple {1475#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1475#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:15:55,573 INFO L281 TraceCheckUtils]: 15: Hoare triple {1475#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1475#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:15:55,573 INFO L281 TraceCheckUtils]: 16: Hoare triple {1475#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume 0bv32 == ~bvurem32(main_~l~0, 2bv32);main_~j~0 := ~bvadd32(1bv32, main_~j~0); {1491#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:15:55,574 INFO L281 TraceCheckUtils]: 17: Hoare triple {1491#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1495#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:15:55,575 INFO L281 TraceCheckUtils]: 18: Hoare triple {1495#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} assume !~bvult32(main_~l~0, main_~n~0); {1495#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:15:55,575 INFO L281 TraceCheckUtils]: 19: Hoare triple {1495#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1502#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:15:55,576 INFO L281 TraceCheckUtils]: 20: Hoare triple {1502#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {1434#false} is VALID [2021-09-13 14:15:55,576 INFO L281 TraceCheckUtils]: 21: Hoare triple {1434#false} assume !false; {1434#false} is VALID [2021-09-13 14:15:55,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:15:55,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:15:58,076 INFO L281 TraceCheckUtils]: 21: Hoare triple {1434#false} assume !false; {1434#false} is VALID [2021-09-13 14:15:58,077 INFO L281 TraceCheckUtils]: 20: Hoare triple {1512#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {1434#false} is VALID [2021-09-13 14:15:58,077 INFO L281 TraceCheckUtils]: 19: Hoare triple {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1512#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:15:58,078 INFO L281 TraceCheckUtils]: 18: Hoare triple {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !~bvult32(main_~l~0, main_~n~0); {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:15:58,089 INFO L281 TraceCheckUtils]: 17: Hoare triple {1523#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:00,092 INFO L281 TraceCheckUtils]: 16: Hoare triple {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume 0bv32 == ~bvurem32(main_~l~0, 2bv32);main_~j~0 := ~bvadd32(1bv32, main_~j~0); {1523#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:16:00,093 INFO L281 TraceCheckUtils]: 15: Hoare triple {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:00,093 INFO L281 TraceCheckUtils]: 14: Hoare triple {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:00,093 INFO L281 TraceCheckUtils]: 13: Hoare triple {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:00,094 INFO L281 TraceCheckUtils]: 12: Hoare triple {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvult32(main_~l~0, main_~n~0); {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:00,104 INFO L281 TraceCheckUtils]: 11: Hoare triple {1523#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:02,112 INFO L281 TraceCheckUtils]: 10: Hoare triple {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {1523#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:16:02,113 INFO L281 TraceCheckUtils]: 9: Hoare triple {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:02,113 INFO L281 TraceCheckUtils]: 8: Hoare triple {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:02,114 INFO L281 TraceCheckUtils]: 7: Hoare triple {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:02,114 INFO L281 TraceCheckUtils]: 6: Hoare triple {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvult32(main_~l~0, main_~n~0); {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:02,126 INFO L281 TraceCheckUtils]: 5: Hoare triple {1523#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:04,131 INFO L281 TraceCheckUtils]: 4: Hoare triple {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {1523#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:16:04,132 INFO L281 TraceCheckUtils]: 3: Hoare triple {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvult32(main_~l~0, main_~n~0); {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:04,132 INFO L281 TraceCheckUtils]: 2: Hoare triple {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvule32(main_~n~0, ~SIZE~0); {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:04,133 INFO L281 TraceCheckUtils]: 1: Hoare triple {1433#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {1516#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:04,133 INFO L281 TraceCheckUtils]: 0: Hoare triple {1433#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {1433#true} is VALID [2021-09-13 14:16:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-09-13 14:16:04,134 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:16:04,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077918470] [2021-09-13 14:16:04,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077918470] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:16:04,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-09-13 14:16:04,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2021-09-13 14:16:04,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036026150] [2021-09-13 14:16:04,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-09-13 14:16:04,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:16:04,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:10,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 12 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:10,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:16:10,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:16:10,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:16:10,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:16:10,205 INFO L87 Difference]: Start difference. First operand 55 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:12,886 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:16:14,945 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:16:15,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:15,164 INFO L93 Difference]: Finished difference Result 85 states and 122 transitions. [2021-09-13 14:16:15,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:16:15,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-09-13 14:16:15,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:16:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2021-09-13 14:16:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2021-09-13 14:16:15,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2021-09-13 14:16:21,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 28 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:21,288 INFO L225 Difference]: With dead ends: 85 [2021-09-13 14:16:21,288 INFO L226 Difference]: Without dead ends: 81 [2021-09-13 14:16:21,289 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 334.71ms TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:16:21,289 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4379.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.70ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4382.46ms IncrementalHoareTripleChecker+Time [2021-09-13 14:16:21,289 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 68 Unknown, 0 Unchecked, 0.70ms Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 2 Unknown, 0 Unchecked, 4382.46ms Time] [2021-09-13 14:16:21,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-09-13 14:16:21,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-09-13 14:16:21,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:16:21,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:21,321 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:21,322 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:21,324 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2021-09-13 14:16:21,324 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 113 transitions. [2021-09-13 14:16:21,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:21,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:21,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 81 states. [2021-09-13 14:16:21,325 INFO L87 Difference]: Start difference. First operand has 81 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 81 states. [2021-09-13 14:16:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:21,328 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2021-09-13 14:16:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 113 transitions. [2021-09-13 14:16:21,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:21,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:21,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:16:21,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:16:21,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 113 transitions. [2021-09-13 14:16:21,331 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 113 transitions. Word has length 22 [2021-09-13 14:16:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:16:21,331 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 113 transitions. [2021-09-13 14:16:21,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 113 transitions. [2021-09-13 14:16:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-09-13 14:16:21,332 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:16:21,333 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:16:21,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-09-13 14:16:21,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:16:21,548 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:16:21,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:16:21,548 INFO L82 PathProgramCache]: Analyzing trace with hash -863224061, now seen corresponding path program 1 times [2021-09-13 14:16:21,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:16:21,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393136244] [2021-09-13 14:16:21,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:21,549 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:16:21,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:16:21,550 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:16:21,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-09-13 14:16:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:21,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2021-09-13 14:16:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:21,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:16:22,762 INFO L281 TraceCheckUtils]: 0: Hoare triple {1934#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {1934#true} is VALID [2021-09-13 14:16:22,763 INFO L281 TraceCheckUtils]: 1: Hoare triple {1934#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {1942#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:16:22,764 INFO L281 TraceCheckUtils]: 2: Hoare triple {1942#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {1942#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:16:22,764 INFO L281 TraceCheckUtils]: 3: Hoare triple {1942#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {1942#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:16:22,765 INFO L281 TraceCheckUtils]: 4: Hoare triple {1942#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {1952#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:16:22,765 INFO L281 TraceCheckUtils]: 5: Hoare triple {1952#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1956#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:16:22,765 INFO L281 TraceCheckUtils]: 6: Hoare triple {1956#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {1956#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:16:22,766 INFO L281 TraceCheckUtils]: 7: Hoare triple {1956#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {1956#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:16:22,766 INFO L281 TraceCheckUtils]: 8: Hoare triple {1956#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1956#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:16:22,767 INFO L281 TraceCheckUtils]: 9: Hoare triple {1956#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1956#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:16:22,770 INFO L281 TraceCheckUtils]: 10: Hoare triple {1956#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {1972#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:16:22,771 INFO L281 TraceCheckUtils]: 11: Hoare triple {1972#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1976#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:16:22,771 INFO L281 TraceCheckUtils]: 12: Hoare triple {1976#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume !!~bvult32(main_~l~0, main_~n~0); {1976#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:16:22,772 INFO L281 TraceCheckUtils]: 13: Hoare triple {1976#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {1976#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:16:22,772 INFO L281 TraceCheckUtils]: 14: Hoare triple {1976#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1976#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:16:22,772 INFO L281 TraceCheckUtils]: 15: Hoare triple {1976#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {1976#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:16:22,773 INFO L281 TraceCheckUtils]: 16: Hoare triple {1976#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume 0bv32 == ~bvurem32(main_~l~0, 2bv32);main_~j~0 := ~bvadd32(1bv32, main_~j~0); {1992#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:16:22,773 INFO L281 TraceCheckUtils]: 17: Hoare triple {1992#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {1996#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:16:22,774 INFO L281 TraceCheckUtils]: 18: Hoare triple {1996#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {1996#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:16:22,774 INFO L281 TraceCheckUtils]: 19: Hoare triple {1996#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {1996#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:16:22,775 INFO L281 TraceCheckUtils]: 20: Hoare triple {1996#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {1996#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:16:22,775 INFO L281 TraceCheckUtils]: 21: Hoare triple {1996#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 3bv32);main_~i~0 := ~bvadd32(1bv32, main_~i~0); {2009#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:16:22,775 INFO L281 TraceCheckUtils]: 22: Hoare triple {2009#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {2013#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= (_ bv4 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:16:22,777 INFO L281 TraceCheckUtils]: 23: Hoare triple {2013#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= (_ bv4 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} assume !~bvult32(main_~l~0, main_~n~0); {2013#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= (_ bv4 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:16:22,777 INFO L281 TraceCheckUtils]: 24: Hoare triple {2013#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= (_ bv4 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2020#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:16:22,778 INFO L281 TraceCheckUtils]: 25: Hoare triple {2020#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {1935#false} is VALID [2021-09-13 14:16:22,778 INFO L281 TraceCheckUtils]: 26: Hoare triple {1935#false} assume !false; {1935#false} is VALID [2021-09-13 14:16:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:16:22,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:16:29,246 INFO L281 TraceCheckUtils]: 26: Hoare triple {1935#false} assume !false; {1935#false} is VALID [2021-09-13 14:16:29,247 INFO L281 TraceCheckUtils]: 25: Hoare triple {2030#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {1935#false} is VALID [2021-09-13 14:16:29,247 INFO L281 TraceCheckUtils]: 24: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2030#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:16:29,248 INFO L281 TraceCheckUtils]: 23: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !~bvult32(main_~l~0, main_~n~0); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:29,258 INFO L281 TraceCheckUtils]: 22: Hoare triple {2041#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:31,263 INFO L281 TraceCheckUtils]: 21: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume 0bv32 == ~bvurem32(main_~l~0, 3bv32);main_~i~0 := ~bvadd32(1bv32, main_~i~0); {2041#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:16:31,264 INFO L281 TraceCheckUtils]: 20: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:31,264 INFO L281 TraceCheckUtils]: 19: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:31,264 INFO L281 TraceCheckUtils]: 18: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvult32(main_~l~0, main_~n~0); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:31,278 INFO L281 TraceCheckUtils]: 17: Hoare triple {2041#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:33,280 INFO L281 TraceCheckUtils]: 16: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume 0bv32 == ~bvurem32(main_~l~0, 2bv32);main_~j~0 := ~bvadd32(1bv32, main_~j~0); {2041#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:16:33,281 INFO L281 TraceCheckUtils]: 15: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:33,281 INFO L281 TraceCheckUtils]: 14: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:33,281 INFO L281 TraceCheckUtils]: 13: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:33,282 INFO L281 TraceCheckUtils]: 12: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvult32(main_~l~0, main_~n~0); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:33,294 INFO L281 TraceCheckUtils]: 11: Hoare triple {2041#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:35,297 INFO L281 TraceCheckUtils]: 10: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {2041#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:16:35,297 INFO L281 TraceCheckUtils]: 9: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:35,298 INFO L281 TraceCheckUtils]: 8: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:35,298 INFO L281 TraceCheckUtils]: 7: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:35,299 INFO L281 TraceCheckUtils]: 6: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvult32(main_~l~0, main_~n~0); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:35,317 INFO L281 TraceCheckUtils]: 5: Hoare triple {2041#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:37,321 INFO L281 TraceCheckUtils]: 4: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {2041#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:16:37,322 INFO L281 TraceCheckUtils]: 3: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvult32(main_~l~0, main_~n~0); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:37,323 INFO L281 TraceCheckUtils]: 2: Hoare triple {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvule32(main_~n~0, ~SIZE~0); {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:37,323 INFO L281 TraceCheckUtils]: 1: Hoare triple {1934#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {2034#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:16:37,323 INFO L281 TraceCheckUtils]: 0: Hoare triple {1934#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {1934#true} is VALID [2021-09-13 14:16:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-09-13 14:16:37,324 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:16:37,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393136244] [2021-09-13 14:16:37,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393136244] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:16:37,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-09-13 14:16:37,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2021-09-13 14:16:37,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042264959] [2021-09-13 14:16:37,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-09-13 14:16:37,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:16:37,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:45,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 12 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:45,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:16:45,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:16:45,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:16:45,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:16:45,450 INFO L87 Difference]: Start difference. First operand 81 states and 113 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:48,094 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:16:48,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:48,481 INFO L93 Difference]: Finished difference Result 115 states and 166 transitions. [2021-09-13 14:16:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:16:48,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-09-13 14:16:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:16:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2021-09-13 14:16:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2021-09-13 14:16:48,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2021-09-13 14:16:56,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 27 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2021-09-13 14:16:56,642 INFO L225 Difference]: With dead ends: 115 [2021-09-13 14:16:56,642 INFO L226 Difference]: Without dead ends: 111 [2021-09-13 14:16:56,642 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 386.20ms TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:16:56,643 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2356.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.74ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2358.54ms IncrementalHoareTripleChecker+Time [2021-09-13 14:16:56,643 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.74ms Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 1 Unknown, 0 Unchecked, 2358.54ms Time] [2021-09-13 14:16:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-09-13 14:16:56,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 85. [2021-09-13 14:16:56,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:16:56,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 85 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:56,675 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 85 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:56,676 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 85 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:56,678 INFO L93 Difference]: Finished difference Result 111 states and 157 transitions. [2021-09-13 14:16:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2021-09-13 14:16:56,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:56,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:56,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 111 states. [2021-09-13 14:16:56,680 INFO L87 Difference]: Start difference. First operand has 85 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 111 states. [2021-09-13 14:16:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:16:56,683 INFO L93 Difference]: Finished difference Result 111 states and 157 transitions. [2021-09-13 14:16:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2021-09-13 14:16:56,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:16:56,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:16:56,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:16:56,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:16:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 119 transitions. [2021-09-13 14:16:56,686 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 119 transitions. Word has length 27 [2021-09-13 14:16:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:16:56,686 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 119 transitions. [2021-09-13 14:16:56,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:16:56,687 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 119 transitions. [2021-09-13 14:16:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-09-13 14:16:56,687 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:16:56,687 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:16:56,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-09-13 14:16:56,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:16:56,904 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:16:56,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:16:56,905 INFO L82 PathProgramCache]: Analyzing trace with hash 741054715, now seen corresponding path program 1 times [2021-09-13 14:16:56,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:16:56,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909799299] [2021-09-13 14:16:56,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:16:56,905 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:16:56,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:16:56,906 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:16:56,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-09-13 14:16:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:57,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:16:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:16:57,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:16:57,235 INFO L281 TraceCheckUtils]: 0: Hoare triple {2568#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {2568#true} is VALID [2021-09-13 14:16:57,236 INFO L281 TraceCheckUtils]: 1: Hoare triple {2568#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {2576#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:16:57,236 INFO L281 TraceCheckUtils]: 2: Hoare triple {2576#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume !!~bvule32(main_~n~0, ~SIZE~0); {2576#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:16:57,236 INFO L281 TraceCheckUtils]: 3: Hoare triple {2576#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume !!~bvult32(main_~l~0, main_~n~0); {2576#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:16:57,237 INFO L281 TraceCheckUtils]: 4: Hoare triple {2576#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {2576#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:16:57,237 INFO L281 TraceCheckUtils]: 5: Hoare triple {2576#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {2589#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:57,238 INFO L281 TraceCheckUtils]: 6: Hoare triple {2589#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !!~bvult32(main_~l~0, main_~n~0); {2589#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:57,238 INFO L281 TraceCheckUtils]: 7: Hoare triple {2589#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {2589#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:57,239 INFO L281 TraceCheckUtils]: 8: Hoare triple {2589#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {2589#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:57,239 INFO L281 TraceCheckUtils]: 9: Hoare triple {2589#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {2589#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:57,240 INFO L281 TraceCheckUtils]: 10: Hoare triple {2589#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {2589#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:16:57,240 INFO L281 TraceCheckUtils]: 11: Hoare triple {2589#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {2608#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:57,241 INFO L281 TraceCheckUtils]: 12: Hoare triple {2608#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {2608#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:57,241 INFO L281 TraceCheckUtils]: 13: Hoare triple {2608#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {2608#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:57,241 INFO L281 TraceCheckUtils]: 14: Hoare triple {2608#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {2608#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:57,242 INFO L281 TraceCheckUtils]: 15: Hoare triple {2608#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {2608#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:57,242 INFO L281 TraceCheckUtils]: 16: Hoare triple {2608#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 2bv32);main_~j~0 := ~bvadd32(1bv32, main_~j~0); {2608#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:57,243 INFO L281 TraceCheckUtils]: 17: Hoare triple {2608#(= (_ bv2 32) ULTIMATE.start_main_~l~0)} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {2627#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:57,243 INFO L281 TraceCheckUtils]: 18: Hoare triple {2627#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} assume !!~bvult32(main_~l~0, main_~n~0); {2627#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} is VALID [2021-09-13 14:16:57,244 INFO L281 TraceCheckUtils]: 19: Hoare triple {2627#(= (_ bv3 32) ULTIMATE.start_main_~l~0)} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {2569#false} is VALID [2021-09-13 14:16:57,244 INFO L281 TraceCheckUtils]: 20: Hoare triple {2569#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {2569#false} is VALID [2021-09-13 14:16:57,244 INFO L281 TraceCheckUtils]: 21: Hoare triple {2569#false} assume !!~bvult32(main_~l~0, main_~n~0); {2569#false} is VALID [2021-09-13 14:16:57,244 INFO L281 TraceCheckUtils]: 22: Hoare triple {2569#false} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {2569#false} is VALID [2021-09-13 14:16:57,245 INFO L281 TraceCheckUtils]: 23: Hoare triple {2569#false} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {2569#false} is VALID [2021-09-13 14:16:57,245 INFO L281 TraceCheckUtils]: 24: Hoare triple {2569#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {2569#false} is VALID [2021-09-13 14:16:57,245 INFO L281 TraceCheckUtils]: 25: Hoare triple {2569#false} assume !~bvult32(main_~l~0, main_~n~0); {2569#false} is VALID [2021-09-13 14:16:57,245 INFO L281 TraceCheckUtils]: 26: Hoare triple {2569#false} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2569#false} is VALID [2021-09-13 14:16:57,245 INFO L281 TraceCheckUtils]: 27: Hoare triple {2569#false} assume 0bv32 == __VERIFIER_assert_~cond; {2569#false} is VALID [2021-09-13 14:16:57,246 INFO L281 TraceCheckUtils]: 28: Hoare triple {2569#false} assume !false; {2569#false} is VALID [2021-09-13 14:16:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-09-13 14:16:57,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:16:58,535 INFO L281 TraceCheckUtils]: 28: Hoare triple {2569#false} assume !false; {2569#false} is VALID [2021-09-13 14:16:58,536 INFO L281 TraceCheckUtils]: 27: Hoare triple {2569#false} assume 0bv32 == __VERIFIER_assert_~cond; {2569#false} is VALID [2021-09-13 14:16:58,536 INFO L281 TraceCheckUtils]: 26: Hoare triple {2569#false} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2569#false} is VALID [2021-09-13 14:16:58,536 INFO L281 TraceCheckUtils]: 25: Hoare triple {2569#false} assume !~bvult32(main_~l~0, main_~n~0); {2569#false} is VALID [2021-09-13 14:16:58,536 INFO L281 TraceCheckUtils]: 24: Hoare triple {2569#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {2569#false} is VALID [2021-09-13 14:16:58,536 INFO L281 TraceCheckUtils]: 23: Hoare triple {2569#false} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {2569#false} is VALID [2021-09-13 14:16:58,536 INFO L281 TraceCheckUtils]: 22: Hoare triple {2569#false} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {2569#false} is VALID [2021-09-13 14:16:58,536 INFO L281 TraceCheckUtils]: 21: Hoare triple {2569#false} assume !!~bvult32(main_~l~0, main_~n~0); {2569#false} is VALID [2021-09-13 14:16:58,536 INFO L281 TraceCheckUtils]: 20: Hoare triple {2569#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {2569#false} is VALID [2021-09-13 14:16:58,537 INFO L281 TraceCheckUtils]: 19: Hoare triple {2688#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv5 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {2569#false} is VALID [2021-09-13 14:16:58,537 INFO L281 TraceCheckUtils]: 18: Hoare triple {2688#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv5 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {2688#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv5 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:58,537 INFO L281 TraceCheckUtils]: 17: Hoare triple {2695#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv5 32)) (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {2688#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv5 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:58,538 INFO L281 TraceCheckUtils]: 16: Hoare triple {2695#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv5 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 2bv32);main_~j~0 := ~bvadd32(1bv32, main_~j~0); {2695#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv5 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:58,538 INFO L281 TraceCheckUtils]: 15: Hoare triple {2695#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv5 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {2695#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv5 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:58,539 INFO L281 TraceCheckUtils]: 14: Hoare triple {2695#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv5 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {2695#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv5 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:58,540 INFO L281 TraceCheckUtils]: 13: Hoare triple {2695#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv5 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {2695#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv5 32)) (_ bv0 32)))} is VALID [2021-09-13 14:16:58,540 INFO L281 TraceCheckUtils]: 12: Hoare triple {2695#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv5 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {2695#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv5 32)) (_ bv0 32)))} is VALID [2021-09-13 14:17:00,548 INFO L281 TraceCheckUtils]: 11: Hoare triple {2714#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv5 32))))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {2695#(not (= (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv5 32)) (_ bv0 32)))} is UNKNOWN [2021-09-13 14:17:00,549 INFO L281 TraceCheckUtils]: 10: Hoare triple {2714#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv5 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {2714#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv5 32))))} is VALID [2021-09-13 14:17:00,549 INFO L281 TraceCheckUtils]: 9: Hoare triple {2714#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv5 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {2714#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv5 32))))} is VALID [2021-09-13 14:17:00,549 INFO L281 TraceCheckUtils]: 8: Hoare triple {2714#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv5 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {2714#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv5 32))))} is VALID [2021-09-13 14:17:00,550 INFO L281 TraceCheckUtils]: 7: Hoare triple {2714#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv5 32))))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {2714#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv5 32))))} is VALID [2021-09-13 14:17:00,550 INFO L281 TraceCheckUtils]: 6: Hoare triple {2714#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv5 32))))} assume !!~bvult32(main_~l~0, main_~n~0); {2714#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv5 32))))} is VALID [2021-09-13 14:17:02,557 INFO L281 TraceCheckUtils]: 5: Hoare triple {2733#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv5 32)) (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {2714#(not (= (_ bv0 32) (bvurem (bvadd (_ bv2 32) ULTIMATE.start_main_~l~0) (_ bv5 32))))} is UNKNOWN [2021-09-13 14:17:02,558 INFO L281 TraceCheckUtils]: 4: Hoare triple {2733#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv5 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {2733#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv5 32)) (_ bv0 32)))} is VALID [2021-09-13 14:17:02,558 INFO L281 TraceCheckUtils]: 3: Hoare triple {2733#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv5 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {2733#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv5 32)) (_ bv0 32)))} is VALID [2021-09-13 14:17:02,558 INFO L281 TraceCheckUtils]: 2: Hoare triple {2733#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv5 32)) (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {2733#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv5 32)) (_ bv0 32)))} is VALID [2021-09-13 14:17:02,559 INFO L281 TraceCheckUtils]: 1: Hoare triple {2568#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {2733#(not (= (bvurem (bvadd (_ bv3 32) ULTIMATE.start_main_~l~0) (_ bv5 32)) (_ bv0 32)))} is VALID [2021-09-13 14:17:02,559 INFO L281 TraceCheckUtils]: 0: Hoare triple {2568#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {2568#true} is VALID [2021-09-13 14:17:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-09-13 14:17:02,559 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:17:02,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909799299] [2021-09-13 14:17:02,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909799299] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:17:02,560 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:17:02,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-09-13 14:17:02,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821954392] [2021-09-13 14:17:02,560 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-09-13 14:17:02,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:17:02,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:06,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 45 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:06,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:17:06,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:17:06,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:17:06,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:17:06,875 INFO L87 Difference]: Start difference. First operand 85 states and 119 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:12,958 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:17:22,806 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:17:26,633 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:17:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:27,273 INFO L93 Difference]: Finished difference Result 277 states and 403 transitions. [2021-09-13 14:17:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-09-13 14:17:27,274 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-09-13 14:17:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:17:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2021-09-13 14:17:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2021-09-13 14:17:27,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 106 transitions. [2021-09-13 14:17:39,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 101 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2021-09-13 14:17:39,474 INFO L225 Difference]: With dead ends: 277 [2021-09-13 14:17:39,474 INFO L226 Difference]: Without dead ends: 213 [2021-09-13 14:17:39,475 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 5040.61ms TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:17:39,475 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7710.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.11ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7712.45ms IncrementalHoareTripleChecker+Time [2021-09-13 14:17:39,475 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 134 Unknown, 0 Unchecked, 3.11ms Time], IncrementalHoareTripleChecker [11 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 7712.45ms Time] [2021-09-13 14:17:39,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-09-13 14:17:39,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2021-09-13 14:17:39,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:17:39,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 196 states, 195 states have (on average 1.3846153846153846) internal successors, (270), 195 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:39,548 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 196 states, 195 states have (on average 1.3846153846153846) internal successors, (270), 195 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:39,548 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 196 states, 195 states have (on average 1.3846153846153846) internal successors, (270), 195 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:39,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:39,553 INFO L93 Difference]: Finished difference Result 213 states and 283 transitions. [2021-09-13 14:17:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 283 transitions. [2021-09-13 14:17:39,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:39,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:39,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 195 states have (on average 1.3846153846153846) internal successors, (270), 195 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 213 states. [2021-09-13 14:17:39,555 INFO L87 Difference]: Start difference. First operand has 196 states, 195 states have (on average 1.3846153846153846) internal successors, (270), 195 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 213 states. [2021-09-13 14:17:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:17:39,560 INFO L93 Difference]: Finished difference Result 213 states and 283 transitions. [2021-09-13 14:17:39,560 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 283 transitions. [2021-09-13 14:17:39,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:17:39,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:17:39,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:17:39,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:17:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.3846153846153846) internal successors, (270), 195 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 270 transitions. [2021-09-13 14:17:39,565 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 270 transitions. Word has length 29 [2021-09-13 14:17:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:17:39,566 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 270 transitions. [2021-09-13 14:17:39,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:17:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 270 transitions. [2021-09-13 14:17:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-09-13 14:17:39,567 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:17:39,567 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:17:39,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-09-13 14:17:39,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:17:39,781 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:17:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:17:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1930488534, now seen corresponding path program 1 times [2021-09-13 14:17:39,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:17:39,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843715180] [2021-09-13 14:17:39,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:17:39,782 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:17:39,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:17:39,789 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:17:39,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-09-13 14:17:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:39,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 19 conjunts are in the unsatisfiable core [2021-09-13 14:17:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:17:39,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:17:41,171 INFO L281 TraceCheckUtils]: 0: Hoare triple {3757#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {3757#true} is VALID [2021-09-13 14:17:41,172 INFO L281 TraceCheckUtils]: 1: Hoare triple {3757#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {3765#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:17:41,172 INFO L281 TraceCheckUtils]: 2: Hoare triple {3765#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {3765#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:17:41,173 INFO L281 TraceCheckUtils]: 3: Hoare triple {3765#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {3765#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:17:41,173 INFO L281 TraceCheckUtils]: 4: Hoare triple {3765#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {3775#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:17:41,173 INFO L281 TraceCheckUtils]: 5: Hoare triple {3775#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {3779#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:17:41,174 INFO L281 TraceCheckUtils]: 6: Hoare triple {3779#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {3779#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:17:41,174 INFO L281 TraceCheckUtils]: 7: Hoare triple {3779#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {3779#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:17:41,175 INFO L281 TraceCheckUtils]: 8: Hoare triple {3779#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {3779#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:17:41,175 INFO L281 TraceCheckUtils]: 9: Hoare triple {3779#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {3779#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:17:41,176 INFO L281 TraceCheckUtils]: 10: Hoare triple {3779#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {3795#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:17:41,176 INFO L281 TraceCheckUtils]: 11: Hoare triple {3795#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~l~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {3799#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:17:41,176 INFO L281 TraceCheckUtils]: 12: Hoare triple {3799#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume !!~bvult32(main_~l~0, main_~n~0); {3799#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:17:41,177 INFO L281 TraceCheckUtils]: 13: Hoare triple {3799#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {3799#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:17:41,177 INFO L281 TraceCheckUtils]: 14: Hoare triple {3799#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {3799#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:17:41,178 INFO L281 TraceCheckUtils]: 15: Hoare triple {3799#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {3799#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:17:41,178 INFO L281 TraceCheckUtils]: 16: Hoare triple {3799#(and (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} assume 0bv32 == ~bvurem32(main_~l~0, 2bv32);main_~j~0 := ~bvadd32(1bv32, main_~j~0); {3815#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:17:41,179 INFO L281 TraceCheckUtils]: 17: Hoare triple {3815#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)) (= (_ bv2 32) ULTIMATE.start_main_~l~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {3819#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:41,179 INFO L281 TraceCheckUtils]: 18: Hoare triple {3819#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {3819#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:41,179 INFO L281 TraceCheckUtils]: 19: Hoare triple {3819#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {3819#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:41,180 INFO L281 TraceCheckUtils]: 20: Hoare triple {3819#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {3819#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:41,180 INFO L281 TraceCheckUtils]: 21: Hoare triple {3819#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~i~0 (_ bv0 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 3bv32);main_~i~0 := ~bvadd32(1bv32, main_~i~0); {3832#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:41,181 INFO L281 TraceCheckUtils]: 22: Hoare triple {3832#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= (_ bv3 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {3836#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= (_ bv4 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:41,181 INFO L281 TraceCheckUtils]: 23: Hoare triple {3836#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= (_ bv4 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {3836#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= (_ bv4 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:41,182 INFO L281 TraceCheckUtils]: 24: Hoare triple {3836#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= (_ bv4 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {3836#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= (_ bv4 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:41,182 INFO L281 TraceCheckUtils]: 25: Hoare triple {3836#(and (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~v4~0 (_ bv0 32)) (= (_ bv4 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {3846#(and (= ULTIMATE.start_main_~v4~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= (_ bv4 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:41,183 INFO L281 TraceCheckUtils]: 26: Hoare triple {3846#(and (= ULTIMATE.start_main_~v4~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= (_ bv4 32) ULTIMATE.start_main_~l~0) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {3850#(and (= ULTIMATE.start_main_~v4~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~l~0 (_ bv5 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:41,183 INFO L281 TraceCheckUtils]: 27: Hoare triple {3850#(and (= ULTIMATE.start_main_~v4~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~l~0 (_ bv5 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} assume !~bvult32(main_~l~0, main_~n~0); {3850#(and (= ULTIMATE.start_main_~v4~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~l~0 (_ bv5 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} is VALID [2021-09-13 14:17:41,183 INFO L281 TraceCheckUtils]: 28: Hoare triple {3850#(and (= ULTIMATE.start_main_~v4~0 (_ bv1 32)) (= ULTIMATE.start_main_~j~0 (_ bv1 32)) (= ULTIMATE.start_main_~i~0 (_ bv1 32)) (= ULTIMATE.start_main_~k~0 (_ bv1 32)) (= ULTIMATE.start_main_~l~0 (_ bv5 32)) (= ULTIMATE.start_main_~v3~0 (_ bv1 32)))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3857#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:17:41,184 INFO L281 TraceCheckUtils]: 29: Hoare triple {3857#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {3758#false} is VALID [2021-09-13 14:17:41,184 INFO L281 TraceCheckUtils]: 30: Hoare triple {3758#false} assume !false; {3758#false} is VALID [2021-09-13 14:17:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:17:41,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:17:53,874 INFO L281 TraceCheckUtils]: 30: Hoare triple {3758#false} assume !false; {3758#false} is VALID [2021-09-13 14:17:53,875 INFO L281 TraceCheckUtils]: 29: Hoare triple {3867#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {3758#false} is VALID [2021-09-13 14:17:53,875 INFO L281 TraceCheckUtils]: 28: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} __VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v4~0), main_~v3~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3867#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:17:53,876 INFO L281 TraceCheckUtils]: 27: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !~bvult32(main_~l~0, main_~n~0); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:53,889 INFO L281 TraceCheckUtils]: 26: Hoare triple {3878#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:55,891 INFO L281 TraceCheckUtils]: 25: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume 0bv32 == ~bvurem32(main_~l~0, 4bv32);main_~v4~0 := ~bvadd32(1bv32, main_~v4~0); {3878#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:17:55,892 INFO L281 TraceCheckUtils]: 24: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:55,892 INFO L281 TraceCheckUtils]: 23: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvult32(main_~l~0, main_~n~0); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:55,903 INFO L281 TraceCheckUtils]: 22: Hoare triple {3878#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:57,909 INFO L281 TraceCheckUtils]: 21: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume 0bv32 == ~bvurem32(main_~l~0, 3bv32);main_~i~0 := ~bvadd32(1bv32, main_~i~0); {3878#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:17:57,910 INFO L281 TraceCheckUtils]: 20: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:57,910 INFO L281 TraceCheckUtils]: 19: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:57,910 INFO L281 TraceCheckUtils]: 18: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvult32(main_~l~0, main_~n~0); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:57,921 INFO L281 TraceCheckUtils]: 17: Hoare triple {3878#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:59,925 INFO L281 TraceCheckUtils]: 16: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume 0bv32 == ~bvurem32(main_~l~0, 2bv32);main_~j~0 := ~bvadd32(1bv32, main_~j~0); {3878#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:17:59,926 INFO L281 TraceCheckUtils]: 15: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:59,926 INFO L281 TraceCheckUtils]: 14: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:59,926 INFO L281 TraceCheckUtils]: 13: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:59,926 INFO L281 TraceCheckUtils]: 12: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvult32(main_~l~0, main_~n~0); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:17:59,937 INFO L281 TraceCheckUtils]: 11: Hoare triple {3878#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:18:01,940 INFO L281 TraceCheckUtils]: 10: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {3878#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:18:01,940 INFO L281 TraceCheckUtils]: 9: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:18:01,941 INFO L281 TraceCheckUtils]: 8: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:18:01,941 INFO L281 TraceCheckUtils]: 7: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:18:01,941 INFO L281 TraceCheckUtils]: 6: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvult32(main_~l~0, main_~n~0); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:18:01,954 INFO L281 TraceCheckUtils]: 5: Hoare triple {3878#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} main_~l~0 := ~bvadd32(1bv32, main_~l~0); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:18:03,959 INFO L281 TraceCheckUtils]: 4: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume 0bv32 == ~bvurem32(main_~l~0, 5bv32);main_~v3~0 := ~bvadd32(1bv32, main_~v3~0); {3878#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is UNKNOWN [2021-09-13 14:18:03,960 INFO L281 TraceCheckUtils]: 3: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvult32(main_~l~0, main_~n~0); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:18:03,960 INFO L281 TraceCheckUtils]: 2: Hoare triple {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} assume !!~bvule32(main_~n~0, ~SIZE~0); {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:18:03,961 INFO L281 TraceCheckUtils]: 1: Hoare triple {3757#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v3~0, main_~v4~0;main_~n~0 := 0bv32;main_~i~0 := 0bv32;main_~k~0 := 0bv32;main_~j~0 := 0bv32;main_~l~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {3871#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0))} is VALID [2021-09-13 14:18:03,961 INFO L281 TraceCheckUtils]: 0: Hoare triple {3757#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~SIZE~0 := 20000001bv32; {3757#true} is VALID [2021-09-13 14:18:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-09-13 14:18:03,961 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:18:03,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843715180] [2021-09-13 14:18:03,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843715180] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:18:03,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-09-13 14:18:03,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2021-09-13 14:18:03,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137049175] [2021-09-13 14:18:03,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-09-13 14:18:03,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:03,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:14,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 12 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:14,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:18:14,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:18:14,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:18:14,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-09-13 14:18:14,060 INFO L87 Difference]: Start difference. First operand 196 states and 270 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:14,857 INFO L93 Difference]: Finished difference Result 196 states and 270 transitions. [2021-09-13 14:18:14,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:18:14,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-09-13 14:18:14,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2021-09-13 14:18:14,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2021-09-13 14:18:14,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 17 transitions. [2021-09-13 14:18:24,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 12 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:24,968 INFO L225 Difference]: With dead ends: 196 [2021-09-13 14:18:24,968 INFO L226 Difference]: Without dead ends: 0 [2021-09-13 14:18:24,969 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 459.61ms TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-09-13 14:18:24,970 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 286.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.59ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 287.20ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:24,970 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 0.59ms Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 287.20ms Time] [2021-09-13 14:18:24,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-09-13 14:18:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-09-13 14:18:24,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:24,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:24,971 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:24,971 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:24,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:24,971 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:18:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:18:24,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:24,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:24,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2021-09-13 14:18:24,971 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2021-09-13 14:18:24,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:24,971 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:18:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:18:24,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:24,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:24,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:24,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-09-13 14:18:24,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2021-09-13 14:18:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:24,972 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-09-13 14:18:24,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:18:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:18:24,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:24,974 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-09-13 14:18:24,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-09-13 14:18:25,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:18:25,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-09-13 14:18:25,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:18:25,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:18:25,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:18:25,238 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 32) no Hoare annotation was computed. [2021-09-13 14:18:25,238 INFO L858 garLoopResultBuilder]: For program point L23(lines 23 32) no Hoare annotation was computed. [2021-09-13 14:18:25,238 INFO L861 garLoopResultBuilder]: At program point L36(lines 16 37) the Hoare annotation is: true [2021-09-13 14:18:25,238 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-09-13 14:18:25,238 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-09-13 14:18:25,239 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-09-13 14:18:25,239 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2021-09-13 14:18:25,239 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2021-09-13 14:18:25,239 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-09-13 14:18:25,239 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 32) no Hoare annotation was computed. [2021-09-13 14:18:25,239 INFO L858 garLoopResultBuilder]: For program point L29-2(lines 23 32) no Hoare annotation was computed. [2021-09-13 14:18:25,239 INFO L858 garLoopResultBuilder]: For program point L25(lines 25 32) no Hoare annotation was computed. [2021-09-13 14:18:25,240 INFO L854 garLoopResultBuilder]: At program point L21-2(lines 21 34) the Hoare annotation is: (= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v3~0 ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~k~0)) [2021-09-13 14:18:25,240 INFO L858 garLoopResultBuilder]: For program point L21-3(lines 21 34) no Hoare annotation was computed. [2021-09-13 14:18:25,240 INFO L858 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2021-09-13 14:18:25,240 INFO L861 garLoopResultBuilder]: At program point L9-2(lines 8 13) the Hoare annotation is: true [2021-09-13 14:18:25,240 INFO L858 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2021-09-13 14:18:25,244 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:18:25,247 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:18:25,247 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:18:25,247 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2021-09-13 14:18:25,247 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2021-09-13 14:18:25,247 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:18:25,247 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2021-09-13 14:18:25,247 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2021-09-13 14:18:25,247 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2021-09-13 14:18:25,248 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:18:25,248 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2021-09-13 14:18:25,248 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2021-09-13 14:18:25,248 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2021-09-13 14:18:25,248 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2021-09-13 14:18:25,248 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2021-09-13 14:18:25,248 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2021-09-13 14:18:25,248 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2021-09-13 14:18:25,248 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2021-09-13 14:18:25,249 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2021-09-13 14:18:25,249 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2021-09-13 14:18:25,249 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2021-09-13 14:18:25,249 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2021-09-13 14:18:25,249 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2021-09-13 14:18:25,249 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2021-09-13 14:18:25,249 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 14:18:25,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:18:25 BoogieIcfgContainer [2021-09-13 14:18:25,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:18:25,257 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:18:25,257 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:18:25,257 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:18:25,258 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:14:39" (3/4) ... [2021-09-13 14:18:25,260 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-09-13 14:18:25,267 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-09-13 14:18:25,268 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-09-13 14:18:25,268 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:18:25,268 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:18:25,291 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-13 14:18:25,292 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:18:25,293 INFO L158 Benchmark]: Toolchain (without parser) took 226794.82ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 29.8MB in the beginning and 18.1MB in the end (delta: 11.7MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2021-09-13 14:18:25,293 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 34.4MB in the beginning and 34.4MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:18:25,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.28ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 29.5MB in the beginning and 46.0MB in the end (delta: -16.5MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2021-09-13 14:18:25,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.44ms. Allocated memory is still 62.9MB. Free memory was 46.0MB in the beginning and 44.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:18:25,294 INFO L158 Benchmark]: Boogie Preprocessor took 20.87ms. Allocated memory is still 62.9MB. Free memory was 44.2MB in the beginning and 43.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:18:25,294 INFO L158 Benchmark]: RCFGBuilder took 275.31ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 32.6MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:18:25,295 INFO L158 Benchmark]: TraceAbstraction took 226227.08ms. Allocated memory is still 62.9MB. Free memory was 32.3MB in the beginning and 20.7MB in the end (delta: 11.5MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2021-09-13 14:18:25,295 INFO L158 Benchmark]: Witness Printer took 34.84ms. Allocated memory is still 62.9MB. Free memory was 20.7MB in the beginning and 18.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:18:25,296 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 34.4MB in the beginning and 34.4MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.28ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 29.5MB in the beginning and 46.0MB in the end (delta: -16.5MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.44ms. Allocated memory is still 62.9MB. Free memory was 46.0MB in the beginning and 44.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.87ms. Allocated memory is still 62.9MB. Free memory was 44.2MB in the beginning and 43.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 275.31ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 32.6MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 226227.08ms. Allocated memory is still 62.9MB. Free memory was 32.3MB in the beginning and 20.7MB in the end (delta: 11.5MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 34.84ms. Allocated memory is still 62.9MB. Free memory was 20.7MB in the beginning and 18.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 226170.77ms, OverallIterations: 10, TraceHistogramMax: 5, EmptinessCheckTime: 14.35ms, AutomataDifference: 109044.25ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 62.01ms, InitialAbstractionConstructionTime: 6.97ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 37703.24ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 37652.40ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 203 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 715 IncrementalHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 0 mSDtfsCounter, 715 mSolverCounterSat, 12.65ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 7980.00ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=9, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 321.46ms AutomataMinimizationTime, 10 MinimizatonAttempts, 78 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 29 NumberOfFragments, 10 HoareAnnotationTreeSize, 3 FomulaSimplifications, 579 FormulaSimplificationTreeSizeReduction, 47.40ms HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 8.46ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 68.11ms SsaConstructionTime, 536.61ms SatisfiabilityAnalysisTime, 76611.08ms InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 2966 SizeOfPredicates, 45 NumberOfNonLiveVariables, 489 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 20 InterpolantComputations, 9 PerfectInterpolantSequences, 155/308 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: l == ~bvadd64(v3, v4, i, j, k) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-09-13 14:18:25,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...