./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/sumt7.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/sumt7.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 83a28450a46642ab2e91fd63f7d92584be86354c ...................................................................................................................................................................................................................................................................................................................................................................................... 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/sumt7.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 83a28450a46642ab2e91fd63f7d92584be86354c ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@701a5810 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:14:16,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:14:16,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:14:16,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:14:16,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:14:16,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:14:16,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:14:16,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:14:16,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:14:16,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:14:16,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:14:16,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:14:16,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:14:16,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:14:16,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:14:16,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:14:16,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:14:16,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:14:16,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:14:16,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:14:16,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:14:16,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:14:16,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:14:16,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:14:16,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:14:16,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:14:16,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:14:16,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:14:16,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:14:16,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:14:16,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:14:16,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:14:16,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:14:16,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:14:16,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:14:16,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:14:16,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:14:16,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:14:16,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:14:16,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:14:16,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:14:16,959 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:16,986 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:14:16,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:14:16,987 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:14:16,987 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:14:16,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:14:16,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:14:16,989 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:14:16,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:14:16,989 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:14:16,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:14:16,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:14:16,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:14:16,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:14:16,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:14:16,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:14:16,991 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:14:16,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:14:16,991 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:14:16,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:14:16,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:14:16,991 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:14:16,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:14:16,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:14:16,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:14:16,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:14:16,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:14:16,992 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:14:16,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:14:16,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:14:16,993 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:14:16,993 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 -> 83a28450a46642ab2e91fd63f7d92584be86354c [2021-09-13 14:14:17,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:14:17,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:14:17,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:14:17,274 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:14:17,274 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:14:17,275 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/sumt7.c [2021-09-13 14:14:17,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a29c7de/70c1a9207a1f41778ff4c1ba78ac2f1b/FLAG532220ff2 [2021-09-13 14:14:17,703 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:14:17,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt7.c [2021-09-13 14:14:17,709 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a29c7de/70c1a9207a1f41778ff4c1ba78ac2f1b/FLAG532220ff2 [2021-09-13 14:14:18,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a29c7de/70c1a9207a1f41778ff4c1ba78ac2f1b [2021-09-13 14:14:18,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:14:18,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:14:18,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:14:18,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:14:18,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:14:18,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:14:18" (1/1) ... [2021-09-13 14:14:18,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cac6bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:18, skipping insertion in model container [2021-09-13 14:14:18,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:14:18" (1/1) ... [2021-09-13 14:14:18,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:14:18,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:14:18,268 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/sumt7.c[403,416] [2021-09-13 14:14:18,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:14:18,321 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:14:18,331 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/sumt7.c[403,416] [2021-09-13 14:14:18,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:14:18,362 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:14:18,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:18 WrapperNode [2021-09-13 14:14:18,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:14:18,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:14:18,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:14:18,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:14:18,384 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:18" (1/1) ... [2021-09-13 14:14:18,398 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:18" (1/1) ... [2021-09-13 14:14:18,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:14:18,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:14:18,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:14:18,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:14:18,437 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:18" (1/1) ... [2021-09-13 14:14:18,437 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:18" (1/1) ... [2021-09-13 14:14:18,440 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:18" (1/1) ... [2021-09-13 14:14:18,440 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:18" (1/1) ... [2021-09-13 14:14:18,451 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:18" (1/1) ... [2021-09-13 14:14:18,455 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:18" (1/1) ... [2021-09-13 14:14:18,461 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:18" (1/1) ... [2021-09-13 14:14:18,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:14:18,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:14:18,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:14:18,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:14:18,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:18" (1/1) ... [2021-09-13 14:14:18,472 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:14:18,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:14:18,502 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:18,560 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:18,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:14:18,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:14:18,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:14:18,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:14:18,807 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:14:18,807 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-09-13 14:14:18,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:14:18 BoogieIcfgContainer [2021-09-13 14:14:18,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:14:18,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:14:18,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:14:18,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:14:18,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:14:18" (1/3) ... [2021-09-13 14:14:18,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564d0a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:14:18, skipping insertion in model container [2021-09-13 14:14:18,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:18" (2/3) ... [2021-09-13 14:14:18,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564d0a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:14:18, skipping insertion in model container [2021-09-13 14:14:18,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:14:18" (3/3) ... [2021-09-13 14:14:18,816 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt7.c [2021-09-13 14:14:18,830 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:14:18,830 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 14:14:18,876 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:14:18,884 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:18,885 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 14:14:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 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:18,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-09-13 14:14:18,904 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:18,904 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:18,905 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:18,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:18,909 INFO L82 PathProgramCache]: Analyzing trace with hash 183347083, now seen corresponding path program 1 times [2021-09-13 14:14:18,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:18,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542051307] [2021-09-13 14:14:18,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:18,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:19,299 INFO L281 TraceCheckUtils]: 0: Hoare triple {21#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; {21#true} is VALID [2021-09-13 14:14:19,301 INFO L281 TraceCheckUtils]: 1: Hoare triple {21#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~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_~v1~0 := 0;main_~v2~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; {23#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v1~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,303 INFO L281 TraceCheckUtils]: 2: Hoare triple {23#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v1~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {23#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v1~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,304 INFO L281 TraceCheckUtils]: 3: Hoare triple {23#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v1~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {23#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v1~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,305 INFO L281 TraceCheckUtils]: 4: Hoare triple {23#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v1~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 7 then main_~l~0 % 4294967296 % 7 - 7 else main_~l~0 % 4294967296 % 7) % 4294967296;main_~v1~0 := 1 + main_~v1~0; {24#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (<= ULTIMATE.start_main_~v1~0 1) (<= 1 ULTIMATE.start_main_~v1~0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,309 INFO L281 TraceCheckUtils]: 5: Hoare triple {24#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (<= ULTIMATE.start_main_~v1~0 1) (<= 1 ULTIMATE.start_main_~v1~0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v3~0 0) (= ULTIMATE.start_main_~v2~0 0) (= ULTIMATE.start_main_~j~0 0))} main_~l~0 := 1 + main_~l~0;__VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v1~0 + main_~v2~0 + main_~v3~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {25#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:14:19,309 INFO L281 TraceCheckUtils]: 6: Hoare triple {25#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {22#false} is VALID [2021-09-13 14:14:19,310 INFO L281 TraceCheckUtils]: 7: Hoare triple {22#false} assume !false; {22#false} is VALID [2021-09-13 14:14:19,311 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:19,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:19,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542051307] [2021-09-13 14:14:19,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542051307] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:14:19,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:14:19,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:14:19,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762395325] [2021-09-13 14:14:19,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2021-09-13 14:14:19,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:19,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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:19,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:19,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:14:19,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:19,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:14:19,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:14:19,358 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 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 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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:21,482 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:23,708 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:25,893 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,124 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:30,313 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:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:30,522 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2021-09-13 14:14:30,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:14:30,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2021-09-13 14:14:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2021-09-13 14:14:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2021-09-13 14:14:30,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2021-09-13 14:14:30,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:30,607 INFO L225 Difference]: With dead ends: 42 [2021-09-13 14:14:30,607 INFO L226 Difference]: Without dead ends: 19 [2021-09-13 14:14:30,609 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.26ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:14:30,611 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10148.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.24ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10672.53ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:30,611 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 102 Unknown, 0 Unchecked, 2.24ms Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 5 Unknown, 0 Unchecked, 10672.53ms Time] [2021-09-13 14:14:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-09-13 14:14:30,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-09-13 14:14:30,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:30,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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,638 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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,638 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:30,640 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2021-09-13 14:14:30,640 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2021-09-13 14:14:30,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:30,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:30,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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 19 states. [2021-09-13 14:14:30,641 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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 19 states. [2021-09-13 14:14:30,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:30,645 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2021-09-13 14:14:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2021-09-13 14:14:30,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:30,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:30,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:30,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2021-09-13 14:14:30,653 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 8 [2021-09-13 14:14:30,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:30,654 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2021-09-13 14:14:30,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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,654 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2021-09-13 14:14:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-09-13 14:14:30,655 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:30,655 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:30,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:14:30,659 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:30,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:30,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1389921443, now seen corresponding path program 1 times [2021-09-13 14:14:30,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:30,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223689584] [2021-09-13 14:14:30,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:30,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:31,032 INFO L281 TraceCheckUtils]: 0: Hoare triple {134#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; {136#(and (<= ~SIZE~0 20000001) (< 0 (+ (div ~SIZE~0 4294967296) 1)))} is VALID [2021-09-13 14:14:31,033 INFO L281 TraceCheckUtils]: 1: Hoare triple {136#(and (<= ~SIZE~0 20000001) (< 0 (+ (div ~SIZE~0 4294967296) 1)))} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~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_~v1~0 := 0;main_~v2~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; {137#(and (<= (div ~SIZE~0 4294967296) (div ULTIMATE.start_main_~l~0 4294967296)) (= ULTIMATE.start_main_~l~0 0))} is VALID [2021-09-13 14:14:31,034 INFO L281 TraceCheckUtils]: 2: Hoare triple {137#(and (<= (div ~SIZE~0 4294967296) (div ULTIMATE.start_main_~l~0 4294967296)) (= ULTIMATE.start_main_~l~0 0))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {138#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:31,036 INFO L281 TraceCheckUtils]: 3: Hoare triple {138#(= ULTIMATE.start_main_~l~0 0)} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {138#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:31,036 INFO L281 TraceCheckUtils]: 4: Hoare triple {138#(= ULTIMATE.start_main_~l~0 0)} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 7 then main_~l~0 % 4294967296 % 7 - 7 else main_~l~0 % 4294967296 % 7) % 4294967296); {135#false} is VALID [2021-09-13 14:14:31,038 INFO L281 TraceCheckUtils]: 5: Hoare triple {135#false} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 6 then main_~l~0 % 4294967296 % 6 - 6 else main_~l~0 % 4294967296 % 6) % 4294967296;main_~v2~0 := 1 + main_~v2~0; {135#false} is VALID [2021-09-13 14:14:31,038 INFO L281 TraceCheckUtils]: 6: Hoare triple {135#false} main_~l~0 := 1 + main_~l~0;__VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v1~0 + main_~v2~0 + main_~v3~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {135#false} is VALID [2021-09-13 14:14:31,039 INFO L281 TraceCheckUtils]: 7: Hoare triple {135#false} assume 0 == __VERIFIER_assert_~cond; {135#false} is VALID [2021-09-13 14:14:31,039 INFO L281 TraceCheckUtils]: 8: Hoare triple {135#false} assume !false; {135#false} is VALID [2021-09-13 14:14:31,039 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:31,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:31,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223689584] [2021-09-13 14:14:31,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223689584] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:14:31,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:14:31,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:14:31,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849399537] [2021-09-13 14:14:31,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2021-09-13 14:14:31,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:31,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 8 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:33,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:14:33,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:33,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:14:33,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:14:33,220 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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,292 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:37,421 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:37,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:14:37,587 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.76ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:14:37,588 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4024.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.36ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4145.60ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:37,588 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 20 Unknown, 0 Unchecked, 0.36ms Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 4145.60ms Time] [2021-09-13 14:14:37,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-13 14:14:37,589 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@126dec3b 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:37,592 INFO L158 Benchmark]: Toolchain (without parser) took 19455.65ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 41.7MB in the beginning and 40.9MB in the end (delta: 827.1kB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2021-09-13 14:14:37,592 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 46.1MB. Free memory was 28.3MB in the beginning and 28.2MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:14:37,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.40ms. Allocated memory is still 56.6MB. Free memory was 41.5MB in the beginning and 40.9MB in the end (delta: 609.8kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-09-13 14:14:37,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.47ms. Allocated memory is still 56.6MB. Free memory was 40.7MB in the beginning and 39.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:14:37,593 INFO L158 Benchmark]: Boogie Preprocessor took 33.95ms. Allocated memory is still 56.6MB. Free memory was 39.0MB in the beginning and 37.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:14:37,593 INFO L158 Benchmark]: RCFGBuilder took 344.95ms. Allocated memory is still 56.6MB. Free memory was 37.8MB in the beginning and 27.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:14:37,593 INFO L158 Benchmark]: TraceAbstraction took 18780.43ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 26.9MB in the beginning and 40.9MB in the end (delta: -13.9MB). Peak memory consumption was 220.4kB. Max. memory is 16.1GB. [2021-09-13 14:14:37,595 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.14ms. Allocated memory is still 46.1MB. Free memory was 28.3MB in the beginning and 28.2MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.40ms. Allocated memory is still 56.6MB. Free memory was 41.5MB in the beginning and 40.9MB in the end (delta: 609.8kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.47ms. Allocated memory is still 56.6MB. Free memory was 40.7MB in the beginning and 39.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.95ms. Allocated memory is still 56.6MB. Free memory was 39.0MB in the beginning and 37.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 344.95ms. Allocated memory is still 56.6MB. Free memory was 37.8MB in the beginning and 27.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18780.43ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 26.9MB in the beginning and 40.9MB in the end (delta: -13.9MB). Peak memory consumption was 220.4kB. 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@126dec3b de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@126dec3b: 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:37,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:14:40,044 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:14:40,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:14:40,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:14:40,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:14:40,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:14:40,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:14:40,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:14:40,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:14:40,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:14:40,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:14:40,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:14:40,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:14:40,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:14:40,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:14:40,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:14:40,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:14:40,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:14:40,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:14:40,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:14:40,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:14:40,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:14:40,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:14:40,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:14:40,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:14:40,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:14:40,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:14:40,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:14:40,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:14:40,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:14:40,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:14:40,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:14:40,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:14:40,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:14:40,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:14:40,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:14:40,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:14:40,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:14:40,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:14:40,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:14:40,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:14:40,171 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:40,198 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:14:40,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:14:40,200 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:14:40,200 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:14:40,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:14:40,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:14:40,202 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:14:40,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:14:40,202 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:14:40,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:14:40,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:14:40,203 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:14:40,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:14:40,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:14:40,204 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-09-13 14:14:40,204 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-09-13 14:14:40,204 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:14:40,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:14:40,204 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:14:40,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:14:40,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:14:40,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:14:40,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:14:40,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:14:40,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:14:40,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:14:40,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:14:40,206 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-09-13 14:14:40,206 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-09-13 14:14:40,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:14:40,206 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:14:40,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-09-13 14:14:40,206 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 -> 83a28450a46642ab2e91fd63f7d92584be86354c [2021-09-13 14:14:40,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:14:40,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:14:40,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:14:40,486 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:14:40,487 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:14:40,487 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/sumt7.c [2021-09-13 14:14:40,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718e4f157/9cd7bfe027984047b8fdf444eda0dfad/FLAGfd1942a11 [2021-09-13 14:14:40,864 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:14:40,865 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt7.c [2021-09-13 14:14:40,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718e4f157/9cd7bfe027984047b8fdf444eda0dfad/FLAGfd1942a11 [2021-09-13 14:14:41,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718e4f157/9cd7bfe027984047b8fdf444eda0dfad [2021-09-13 14:14:41,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:14:41,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:14:41,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:14:41,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:14:41,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:14:41,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:14:41" (1/1) ... [2021-09-13 14:14:41,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630976b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:41, skipping insertion in model container [2021-09-13 14:14:41,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:14:41" (1/1) ... [2021-09-13 14:14:41,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:14:41,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:14:41,432 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/sumt7.c[403,416] [2021-09-13 14:14:41,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:14:41,475 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:14:41,483 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/sumt7.c[403,416] [2021-09-13 14:14:41,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:14:41,514 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:14:41,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:41 WrapperNode [2021-09-13 14:14:41,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:14:41,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:14:41,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:14:41,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:14:41,520 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:41" (1/1) ... [2021-09-13 14:14:41,538 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:41" (1/1) ... [2021-09-13 14:14:41,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:14:41,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:14:41,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:14:41,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:14:41,567 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:41" (1/1) ... [2021-09-13 14:14:41,567 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:41" (1/1) ... [2021-09-13 14:14:41,574 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:41" (1/1) ... [2021-09-13 14:14:41,574 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:41" (1/1) ... [2021-09-13 14:14:41,585 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:41" (1/1) ... [2021-09-13 14:14:41,587 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:41" (1/1) ... [2021-09-13 14:14:41,590 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:41" (1/1) ... [2021-09-13 14:14:41,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:14:41,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:14:41,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:14:41,595 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:14:41,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:41" (1/1) ... [2021-09-13 14:14:41,600 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:14:41,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:14:41,647 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:41,714 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:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-09-13 14:14:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:14:41,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:14:41,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:14:41,923 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:14:41,924 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-09-13 14:14:41,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:14:41 BoogieIcfgContainer [2021-09-13 14:14:41,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:14:41,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:14:41,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:14:41,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:14:41,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:14:41" (1/3) ... [2021-09-13 14:14:41,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432034d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:14:41, skipping insertion in model container [2021-09-13 14:14:41,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:41" (2/3) ... [2021-09-13 14:14:41,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432034d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:14:41, skipping insertion in model container [2021-09-13 14:14:41,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:14:41" (3/3) ... [2021-09-13 14:14:41,942 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt7.c [2021-09-13 14:14:41,945 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:14:41,946 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 14:14:41,995 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:14:41,999 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:42,000 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 14:14:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 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,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-09-13 14:14:42,018 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:42,018 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:42,019 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:42,025 INFO L82 PathProgramCache]: Analyzing trace with hash 183347083, now seen corresponding path program 1 times [2021-09-13 14:14:42,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:14:42,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627485596] [2021-09-13 14:14:42,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:42,033 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:14:42,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:14:42,035 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:42,037 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:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:42,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 14:14:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:42,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:14:42,571 INFO L281 TraceCheckUtils]: 0: Hoare triple {21#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; {21#true} is VALID [2021-09-13 14:14:42,572 INFO L281 TraceCheckUtils]: 1: Hoare triple {21#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~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_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {29#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= 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_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:14:42,573 INFO L281 TraceCheckUtils]: 2: Hoare triple {29#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= 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_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {29#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= 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_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:14:42,573 INFO L281 TraceCheckUtils]: 3: Hoare triple {29#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= 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_~v2~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); {29#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= 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_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:14:42,574 INFO L281 TraceCheckUtils]: 4: Hoare triple {29#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= 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_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 7bv32);main_~v1~0 := ~bvadd32(1bv32, main_~v1~0); {39#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:14:42,575 INFO L281 TraceCheckUtils]: 5: Hoare triple {39#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {43#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:14:42,575 INFO L281 TraceCheckUtils]: 6: Hoare triple {43#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {22#false} is VALID [2021-09-13 14:14:42,576 INFO L281 TraceCheckUtils]: 7: Hoare triple {22#false} assume !false; {22#false} is VALID [2021-09-13 14:14:42,576 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,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:14:50,819 INFO L281 TraceCheckUtils]: 7: Hoare triple {22#false} assume !false; {22#false} is VALID [2021-09-13 14:14:50,820 INFO L281 TraceCheckUtils]: 6: Hoare triple {53#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {22#false} is VALID [2021-09-13 14:14:50,836 INFO L281 TraceCheckUtils]: 5: Hoare triple {57#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {53#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:14:52,843 INFO L281 TraceCheckUtils]: 4: Hoare triple {61#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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, 7bv32);main_~v1~0 := ~bvadd32(1bv32, main_~v1~0); {57#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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,844 INFO L281 TraceCheckUtils]: 3: Hoare triple {61#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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); {61#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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,844 INFO L281 TraceCheckUtils]: 2: Hoare triple {61#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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); {61#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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,845 INFO L281 TraceCheckUtils]: 1: Hoare triple {21#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~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_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {61#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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,845 INFO L281 TraceCheckUtils]: 0: Hoare triple {21#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; {21#true} is VALID [2021-09-13 14:14:52,845 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:52,846 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:14:52,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627485596] [2021-09-13 14:14:52,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627485596] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:14:52,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:14:52,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-09-13 14:14:52,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062912718] [2021-09-13 14:14:52,853 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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 8 [2021-09-13 14:14:52,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:52,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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:14:54,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 13 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:54,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:14:54,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:14:55,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:14:55,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:14:55,012 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 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 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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:14:58,104 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:00,513 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:02,792 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:04,946 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:07,336 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:09,366 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:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:09,900 INFO L93 Difference]: Finished difference Result 54 states and 81 transitions. [2021-09-13 14:15:09,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:15:09,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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 8 [2021-09-13 14:15:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:15:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2021-09-13 14:15:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2021-09-13 14:15:09,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2021-09-13 14:15:12,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 80 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:15:12,331 INFO L225 Difference]: With dead ends: 54 [2021-09-13 14:15:12,331 INFO L226 Difference]: Without dead ends: 27 [2021-09-13 14:15:12,333 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 262.19ms TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:15:12,336 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 19 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13149.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.62ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13169.19ms IncrementalHoareTripleChecker+Time [2021-09-13 14:15:12,351 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 156 Unknown, 0 Unchecked, 4.62ms Time], IncrementalHoareTripleChecker [19 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 13169.19ms Time] [2021-09-13 14:15:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-09-13 14:15:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2021-09-13 14:15:12,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:15:12,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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:12,400 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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:12,400 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:12,406 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2021-09-13 14:15:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2021-09-13 14:15:12,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:12,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:12,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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 27 states. [2021-09-13 14:15:12,408 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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 27 states. [2021-09-13 14:15:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:12,415 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2021-09-13 14:15:12,416 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2021-09-13 14:15:12,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:12,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:12,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:15:12,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:15:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2021-09-13 14:15:12,428 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 8 [2021-09-13 14:15:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:15:12,431 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2021-09-13 14:15:12,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2021-09-13 14:15:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-13 14:15:12,434 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:15:12,435 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:15:12,448 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:15:12,645 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:15:12,646 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:15:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:15:12,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1917043118, now seen corresponding path program 1 times [2021-09-13 14:15:12,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:15:12,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529199391] [2021-09-13 14:15:12,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:15:12,648 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:15:12,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:15:12,649 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:15:12,651 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:15:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:12,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:15:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:12,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:15:12,801 INFO L281 TraceCheckUtils]: 0: Hoare triple {216#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; {216#true} is VALID [2021-09-13 14:15:12,802 INFO L281 TraceCheckUtils]: 1: Hoare triple {216#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~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_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {224#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:12,802 INFO L281 TraceCheckUtils]: 2: Hoare triple {224#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume !!~bvule32(main_~n~0, ~SIZE~0); {224#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:12,802 INFO L281 TraceCheckUtils]: 3: Hoare triple {224#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume !!~bvult32(main_~l~0, main_~n~0); {224#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:12,803 INFO L281 TraceCheckUtils]: 4: Hoare triple {224#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(main_~l~0, 7bv32);main_~v1~0 := ~bvadd32(1bv32, main_~v1~0); {224#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} is VALID [2021-09-13 14:15:12,803 INFO L281 TraceCheckUtils]: 5: Hoare triple {224#(= ULTIMATE.start_main_~l~0 (_ bv0 32))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {237#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:12,804 INFO L281 TraceCheckUtils]: 6: Hoare triple {237#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == __VERIFIER_assert_~cond); {237#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:12,804 INFO L281 TraceCheckUtils]: 7: Hoare triple {237#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !!~bvult32(main_~l~0, main_~n~0); {237#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:12,804 INFO L281 TraceCheckUtils]: 8: Hoare triple {237#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {237#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} is VALID [2021-09-13 14:15:12,805 INFO L281 TraceCheckUtils]: 9: Hoare triple {237#(= ULTIMATE.start_main_~l~0 (_ bv1 32))} assume 0bv32 == ~bvurem32(main_~l~0, 6bv32);main_~v2~0 := ~bvadd32(1bv32, main_~v2~0); {217#false} is VALID [2021-09-13 14:15:12,805 INFO L281 TraceCheckUtils]: 10: Hoare triple {217#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {217#false} is VALID [2021-09-13 14:15:12,805 INFO L281 TraceCheckUtils]: 11: Hoare triple {217#false} assume 0bv32 == __VERIFIER_assert_~cond; {217#false} is VALID [2021-09-13 14:15:12,805 INFO L281 TraceCheckUtils]: 12: Hoare triple {217#false} assume !false; {217#false} is VALID [2021-09-13 14:15:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:15:12,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:15:13,301 INFO L281 TraceCheckUtils]: 12: Hoare triple {217#false} assume !false; {217#false} is VALID [2021-09-13 14:15:13,301 INFO L281 TraceCheckUtils]: 11: Hoare triple {217#false} assume 0bv32 == __VERIFIER_assert_~cond; {217#false} is VALID [2021-09-13 14:15:13,302 INFO L281 TraceCheckUtils]: 10: Hoare triple {217#false} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {217#false} is VALID [2021-09-13 14:15:13,302 INFO L281 TraceCheckUtils]: 9: Hoare triple {268#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 6bv32);main_~v2~0 := ~bvadd32(1bv32, main_~v2~0); {217#false} is VALID [2021-09-13 14:15:13,302 INFO L281 TraceCheckUtils]: 8: Hoare triple {268#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {268#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:13,303 INFO L281 TraceCheckUtils]: 7: Hoare triple {268#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} assume !!~bvult32(main_~l~0, main_~n~0); {268#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:13,303 INFO L281 TraceCheckUtils]: 6: Hoare triple {268#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} assume !(0bv32 == __VERIFIER_assert_~cond); {268#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:13,304 INFO L281 TraceCheckUtils]: 5: Hoare triple {281#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {268#(not (= (bvurem ULTIMATE.start_main_~l~0 (_ bv6 32)) (_ bv0 32)))} is VALID [2021-09-13 14:15:13,304 INFO L281 TraceCheckUtils]: 4: Hoare triple {281#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} assume 0bv32 == ~bvurem32(main_~l~0, 7bv32);main_~v1~0 := ~bvadd32(1bv32, main_~v1~0); {281#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} is VALID [2021-09-13 14:15:13,305 INFO L281 TraceCheckUtils]: 3: Hoare triple {281#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} assume !!~bvult32(main_~l~0, main_~n~0); {281#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} is VALID [2021-09-13 14:15:13,305 INFO L281 TraceCheckUtils]: 2: Hoare triple {281#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} assume !!~bvule32(main_~n~0, ~SIZE~0); {281#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} is VALID [2021-09-13 14:15:13,306 INFO L281 TraceCheckUtils]: 1: Hoare triple {216#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~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_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {281#(not (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (_ bv6 32))))} is VALID [2021-09-13 14:15:13,306 INFO L281 TraceCheckUtils]: 0: Hoare triple {216#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; {216#true} is VALID [2021-09-13 14:15:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:15:13,306 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:15:13,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529199391] [2021-09-13 14:15:13,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529199391] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:15:13,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:15:13,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-09-13 14:15:13,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724825274] [2021-09-13 14:15:13,307 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 13 [2021-09-13 14:15:13,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:15:13,308 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:13,450 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:13,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:15:13,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:15:13,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:15:13,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:15:13,451 INFO L87 Difference]: Start difference. First operand 20 states and 27 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:20,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:20,939 INFO L93 Difference]: Finished difference Result 60 states and 87 transitions. [2021-09-13 14:15:20,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-13 14:15:20,940 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 13 [2021-09-13 14:15:20,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:15:20,940 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:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2021-09-13 14:15:20,941 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:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2021-09-13 14:15:20,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2021-09-13 14:15:21,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:15:21,904 INFO L225 Difference]: With dead ends: 60 [2021-09-13 14:15:21,904 INFO L226 Difference]: Without dead ends: 45 [2021-09-13 14:15:21,904 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 549.06ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:15:21,905 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3618.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.63ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3621.10ms IncrementalHoareTripleChecker+Time [2021-09-13 14:15:21,905 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 94 Unknown, 0 Unchecked, 2.63ms Time], IncrementalHoareTripleChecker [11 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 3621.10ms Time] [2021-09-13 14:15:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-09-13 14:15:21,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2021-09-13 14:15:21,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:15:21,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 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:21,919 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 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:21,919 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 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:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:21,921 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2021-09-13 14:15:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2021-09-13 14:15:21,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:21,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:21,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 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 45 states. [2021-09-13 14:15:21,921 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 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 45 states. [2021-09-13 14:15:21,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:15:21,923 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2021-09-13 14:15:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2021-09-13 14:15:21,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:15:21,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:15:21,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:15:21,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:15:21,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 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:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2021-09-13 14:15:21,927 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 13 [2021-09-13 14:15:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:15:21,927 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2021-09-13 14:15:21,928 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:21,928 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2021-09-13 14:15:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-13 14:15:21,931 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:15:21,932 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:15:21,940 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:15:22,133 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:15:22,134 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:15:22,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:15:22,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1952152930, now seen corresponding path program 1 times [2021-09-13 14:15:22,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:15:22,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054422766] [2021-09-13 14:15:22,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:15:22,135 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:15:22,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:15:22,149 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:15:22,150 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:15:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:22,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:15:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:15:22,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:15:23,122 INFO L281 TraceCheckUtils]: 0: Hoare triple {499#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; {499#true} is VALID [2021-09-13 14:15:23,123 INFO L281 TraceCheckUtils]: 1: Hoare triple {499#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~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_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {507#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= 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_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:23,123 INFO L281 TraceCheckUtils]: 2: Hoare triple {507#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= 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_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !!~bvule32(main_~n~0, ~SIZE~0); {507#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= 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_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:23,124 INFO L281 TraceCheckUtils]: 3: Hoare triple {507#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= 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_~v2~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); {507#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= 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_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:23,124 INFO L281 TraceCheckUtils]: 4: Hoare triple {507#(and (= ULTIMATE.start_main_~v1~0 (_ bv0 32)) (= 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_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume 0bv32 == ~bvurem32(main_~l~0, 7bv32);main_~v1~0 := ~bvadd32(1bv32, main_~v1~0); {517#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:23,125 INFO L281 TraceCheckUtils]: 5: Hoare triple {517#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~l~0 (_ bv0 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:23,125 INFO L281 TraceCheckUtils]: 6: Hoare triple {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == __VERIFIER_assert_~cond); {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:23,126 INFO L281 TraceCheckUtils]: 7: Hoare triple {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~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); {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:23,131 INFO L281 TraceCheckUtils]: 8: Hoare triple {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 7bv32)); {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:23,132 INFO L281 TraceCheckUtils]: 9: Hoare triple {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 6bv32)); {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:23,132 INFO L281 TraceCheckUtils]: 10: Hoare triple {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 5bv32)); {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:23,133 INFO L281 TraceCheckUtils]: 11: Hoare triple {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 4bv32)); {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:23,133 INFO L281 TraceCheckUtils]: 12: Hoare triple {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 3bv32)); {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:23,134 INFO L281 TraceCheckUtils]: 13: Hoare triple {521#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} assume !(0bv32 == ~bvurem32(main_~l~0, 2bv32));main_~k~0 := ~bvadd32(1bv32, main_~k~0); {546#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} is VALID [2021-09-13 14:15:23,134 INFO L281 TraceCheckUtils]: 14: Hoare triple {546#(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_~v1~0 (_ bv1 32)) (= ULTIMATE.start_main_~v2~0 (_ bv0 32)) (= ULTIMATE.start_main_~v3~0 (_ bv0 32)) (= ULTIMATE.start_main_~j~0 (_ bv0 32)))} main_~l~0 := ~bvadd32(1bv32, main_~l~0);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {550#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:15:23,135 INFO L281 TraceCheckUtils]: 15: Hoare triple {550#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {500#false} is VALID [2021-09-13 14:15:23,136 INFO L281 TraceCheckUtils]: 16: Hoare triple {500#false} assume !false; {500#false} is VALID [2021-09-13 14:15:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:15:23,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:15:31,840 INFO L281 TraceCheckUtils]: 16: Hoare triple {500#false} assume !false; {500#false} is VALID [2021-09-13 14:15:31,841 INFO L281 TraceCheckUtils]: 15: Hoare triple {560#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {500#false} is VALID [2021-09-13 14:15:31,861 INFO L281 TraceCheckUtils]: 14: Hoare triple {564#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {560#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:15:33,867 INFO L281 TraceCheckUtils]: 13: Hoare triple {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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); {564#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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:33,868 INFO L281 TraceCheckUtils]: 12: Hoare triple {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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)); {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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:33,868 INFO L281 TraceCheckUtils]: 11: Hoare triple {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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)); {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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:33,869 INFO L281 TraceCheckUtils]: 10: Hoare triple {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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)); {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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:33,869 INFO L281 TraceCheckUtils]: 9: Hoare triple {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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, 6bv32)); {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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:33,870 INFO L281 TraceCheckUtils]: 8: Hoare triple {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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, 7bv32)); {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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:33,871 INFO L281 TraceCheckUtils]: 7: Hoare triple {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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); {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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:33,872 INFO L281 TraceCheckUtils]: 6: Hoare triple {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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 == __VERIFIER_assert_~cond); {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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:33,891 INFO L281 TraceCheckUtils]: 5: Hoare triple {564#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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);__VERIFIER_assert_#in~cond := (if ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(~bvadd32(main_~i~0, main_~j~0), main_~k~0), main_~v1~0), main_~v2~0), main_~v3~0), main_~v4~0) == main_~l~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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:35,897 INFO L281 TraceCheckUtils]: 4: Hoare triple {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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, 7bv32);main_~v1~0 := ~bvadd32(1bv32, main_~v1~0); {564#(= (bvadd ULTIMATE.start_main_~l~0 (_ bv1 32)) (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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:35,898 INFO L281 TraceCheckUtils]: 3: Hoare triple {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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); {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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:35,898 INFO L281 TraceCheckUtils]: 2: Hoare triple {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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); {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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:35,899 INFO L281 TraceCheckUtils]: 1: Hoare triple {499#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v1~0, main_~v2~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_~v1~0 := 0bv32;main_~v2~0 := 0bv32;main_~v3~0 := 0bv32;main_~v4~0 := 0bv32;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {568#(= ULTIMATE.start_main_~l~0 (bvadd ULTIMATE.start_main_~v1~0 ULTIMATE.start_main_~v2~0 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:35,899 INFO L281 TraceCheckUtils]: 0: Hoare triple {499#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; {499#true} is VALID [2021-09-13 14:15:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-09-13 14:15:35,899 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:15:35,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054422766] [2021-09-13 14:15:35,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054422766] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:15:35,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:15:35,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2021-09-13 14:15:35,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959521203] [2021-09-13 14:15:35,900 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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 17 [2021-09-13 14:15:35,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:15:35,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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:40,132 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:40,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:15:40,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:15:40,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:15:40,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:15:40,134 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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:43,523 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:43,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:15:43,531 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 578.26ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:15:43,532 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2660.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.90ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2661.96ms IncrementalHoareTripleChecker+Time [2021-09-13 14:15:43,532 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 98 Unknown, 0 Unchecked, 1.90ms Time], IncrementalHoareTripleChecker [8 Valid, 89 Invalid, 1 Unknown, 0 Unchecked, 2661.96ms Time] [2021-09-13 14:15:43,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-09-13 14:15:43,733 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:43,734 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@701a5810 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:15:43,738 INFO L158 Benchmark]: Toolchain (without parser) took 62462.29ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 37.7MB in the beginning and 48.5MB in the end (delta: -10.8MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2021-09-13 14:15:43,738 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 44.0MB. Free memory was 26.4MB in the beginning and 26.3MB in the end (delta: 43.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:15:43,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.24ms. Allocated memory is still 54.5MB. Free memory was 37.6MB in the beginning and 38.9MB in the end (delta: -1.4MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2021-09-13 14:15:43,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.67ms. Allocated memory is still 54.5MB. Free memory was 38.7MB in the beginning and 37.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:15:43,739 INFO L158 Benchmark]: Boogie Preprocessor took 31.53ms. Allocated memory is still 54.5MB. Free memory was 37.1MB in the beginning and 35.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:15:43,739 INFO L158 Benchmark]: RCFGBuilder took 331.43ms. Allocated memory is still 54.5MB. Free memory was 35.8MB in the beginning and 25.6MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:15:43,739 INFO L158 Benchmark]: TraceAbstraction took 61810.67ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 25.3MB in the beginning and 48.5MB in the end (delta: -23.2MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2021-09-13 14:15:43,741 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.14ms. Allocated memory is still 44.0MB. Free memory was 26.4MB in the beginning and 26.3MB in the end (delta: 43.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.24ms. Allocated memory is still 54.5MB. Free memory was 37.6MB in the beginning and 38.9MB in the end (delta: -1.4MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.67ms. Allocated memory is still 54.5MB. Free memory was 38.7MB in the beginning and 37.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.53ms. Allocated memory is still 54.5MB. Free memory was 37.1MB in the beginning and 35.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 331.43ms. Allocated memory is still 54.5MB. Free memory was 35.8MB in the beginning and 25.6MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 61810.67ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 25.3MB in the beginning and 48.5MB in the end (delta: -23.2MB). Peak memory consumption was 21.2MB. 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@701a5810 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@701a5810: 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:15:43,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...