./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/sumt4.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/sumt4.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 0e6a60ee4460b65708a3f1334ace9766e80adc6f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:14:04,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:14:04,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:14:04,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:14:04,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:14:04,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:14:04,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:14:04,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:14:04,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:14:04,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:14:04,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:14:04,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:14:04,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:14:04,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:14:04,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:14:04,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:14:04,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:14:04,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:14:04,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:14:04,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:14:04,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:14:04,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:14:04,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:14:04,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:14:04,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:14:04,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:14:04,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:14:04,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:14:04,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:14:04,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:14:04,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:14:04,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:14:04,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:14:04,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:14:04,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:14:04,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:14:04,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:14:04,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:14:04,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:14:04,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:14:04,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:14:04,639 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:04,666 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:14:04,669 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:14:04,671 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:14:04,671 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:14:04,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:14:04,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:14:04,675 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:14:04,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:14:04,675 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:14:04,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:14:04,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:14:04,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:14:04,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:14:04,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:14:04,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:14:04,677 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:14:04,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:14:04,677 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:14:04,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:14:04,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:14:04,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:14:04,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:14:04,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:14:04,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:14:04,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:14:04,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:14:04,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:14:04,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:14:04,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:14:04,687 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:14:04,687 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 -> 0e6a60ee4460b65708a3f1334ace9766e80adc6f [2021-09-13 14:14:04,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:14:04,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:14:04,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:14:04,994 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:14:04,995 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:14:04,997 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/sumt4.c [2021-09-13 14:14:05,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cf290f63/56c7cd1ecb3642888aeef14fc92475ed/FLAG54b8747c5 [2021-09-13 14:14:05,515 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:14:05,516 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt4.c [2021-09-13 14:14:05,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cf290f63/56c7cd1ecb3642888aeef14fc92475ed/FLAG54b8747c5 [2021-09-13 14:14:05,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cf290f63/56c7cd1ecb3642888aeef14fc92475ed [2021-09-13 14:14:05,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:14:05,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:14:05,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:14:05,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:14:05,551 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:14:05,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:14:05" (1/1) ... [2021-09-13 14:14:05,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19db24aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:05, skipping insertion in model container [2021-09-13 14:14:05,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:14:05" (1/1) ... [2021-09-13 14:14:05,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:14:05,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:14:05,670 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/sumt4.c[403,416] [2021-09-13 14:14:05,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:14:05,690 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:14:05,700 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/sumt4.c[403,416] [2021-09-13 14:14:05,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:14:05,719 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:14:05,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:05 WrapperNode [2021-09-13 14:14:05,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:14:05,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:14:05,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:14:05,721 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:14:05,727 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:05" (1/1) ... [2021-09-13 14:14:05,732 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:05" (1/1) ... [2021-09-13 14:14:05,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:14:05,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:14:05,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:14:05,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:14:05,764 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:05" (1/1) ... [2021-09-13 14:14:05,765 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:05" (1/1) ... [2021-09-13 14:14:05,766 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:05" (1/1) ... [2021-09-13 14:14:05,766 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:05" (1/1) ... [2021-09-13 14:14:05,770 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:05" (1/1) ... [2021-09-13 14:14:05,773 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:05" (1/1) ... [2021-09-13 14:14:05,776 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:05" (1/1) ... [2021-09-13 14:14:05,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:14:05,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:14:05,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:14:05,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:14:05,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:05" (1/1) ... [2021-09-13 14:14:05,805 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:14:05,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:14:05,825 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:05,836 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:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:14:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:14:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:14:05,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:14:06,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:14:06,029 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-09-13 14:14:06,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:14:06 BoogieIcfgContainer [2021-09-13 14:14:06,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:14:06,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:14:06,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:14:06,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:14:06,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:14:05" (1/3) ... [2021-09-13 14:14:06,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0faf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:14:06, skipping insertion in model container [2021-09-13 14:14:06,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:14:05" (2/3) ... [2021-09-13 14:14:06,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0faf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:14:06, skipping insertion in model container [2021-09-13 14:14:06,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:14:06" (3/3) ... [2021-09-13 14:14:06,042 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt4.c [2021-09-13 14:14:06,046 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:14:06,047 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 14:14:06,099 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:14:06,107 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:06,107 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 14:14:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 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:14:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-09-13 14:14:06,128 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:06,128 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:06,129 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:06,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:06,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1807612808, now seen corresponding path program 1 times [2021-09-13 14:14:06,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:06,142 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495439528] [2021-09-13 14:14:06,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:06,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:06,320 INFO L281 TraceCheckUtils]: 0: Hoare triple {19#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; {19#true} is VALID [2021-09-13 14:14:06,320 INFO L281 TraceCheckUtils]: 1: Hoare triple {19#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~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_~v4~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {19#true} is VALID [2021-09-13 14:14:06,321 INFO L281 TraceCheckUtils]: 2: Hoare triple {19#true} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {19#true} is VALID [2021-09-13 14:14:06,322 INFO L281 TraceCheckUtils]: 3: Hoare triple {19#true} assume !true; {20#false} is VALID [2021-09-13 14:14:06,322 INFO L281 TraceCheckUtils]: 4: Hoare triple {20#false} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {20#false} is VALID [2021-09-13 14:14:06,323 INFO L281 TraceCheckUtils]: 5: Hoare triple {20#false} assume 0 == __VERIFIER_assert_~cond; {20#false} is VALID [2021-09-13 14:14:06,323 INFO L281 TraceCheckUtils]: 6: Hoare triple {20#false} assume !false; {20#false} is VALID [2021-09-13 14:14:06,324 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:06,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:06,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495439528] [2021-09-13 14:14:06,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495439528] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:14:06,327 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:14:06,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:14:06,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348887633] [2021-09-13 14:14:06,335 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:14:06,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:06,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:06,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:06,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:14:06,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:06,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:14:06,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:14:06,434 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:08,514 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:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:08,741 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2021-09-13 14:14:08,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:14:08,742 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:14:08,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2021-09-13 14:14:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 30 transitions. [2021-09-13 14:14:08,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 30 transitions. [2021-09-13 14:14:08,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:08,824 INFO L225 Difference]: With dead ends: 24 [2021-09-13 14:14:08,831 INFO L226 Difference]: Without dead ends: 12 [2021-09-13 14:14:08,834 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.06ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:14:08,838 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2068.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.50ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2086.57ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:08,842 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 20 Unknown, 0 Unchecked, 0.50ms Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 2086.57ms Time] [2021-09-13 14:14:08,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-09-13 14:14:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-09-13 14:14:08,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:08,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:08,873 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:08,873 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:08,877 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2021-09-13 14:14:08,877 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2021-09-13 14:14:08,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:08,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:08,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2021-09-13 14:14:08,880 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2021-09-13 14:14:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:08,887 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2021-09-13 14:14:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2021-09-13 14:14:08,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:08,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:08,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:08,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2021-09-13 14:14:08,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 7 [2021-09-13 14:14:08,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:08,899 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2021-09-13 14:14:08,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:08,900 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2021-09-13 14:14:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-09-13 14:14:08,901 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:08,901 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:08,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:14:08,902 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:08,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:08,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1806987197, now seen corresponding path program 1 times [2021-09-13 14:14:08,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:08,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424571539] [2021-09-13 14:14:08,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:08,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:09,341 INFO L281 TraceCheckUtils]: 0: Hoare triple {89#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; {89#true} is VALID [2021-09-13 14:14:09,343 INFO L281 TraceCheckUtils]: 1: Hoare triple {89#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~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_~v4~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {91#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:09,344 INFO L281 TraceCheckUtils]: 2: Hoare triple {91#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {91#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:09,345 INFO L281 TraceCheckUtils]: 3: Hoare triple {91#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {91#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:09,346 INFO L281 TraceCheckUtils]: 4: Hoare triple {91#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {92#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:14:09,346 INFO L281 TraceCheckUtils]: 5: Hoare triple {92#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {90#false} is VALID [2021-09-13 14:14:09,347 INFO L281 TraceCheckUtils]: 6: Hoare triple {90#false} assume !false; {90#false} is VALID [2021-09-13 14:14:09,348 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:09,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:09,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424571539] [2021-09-13 14:14:09,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424571539] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:14:09,352 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:14:09,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:14:09,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722041219] [2021-09-13 14:14:09,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:14:09,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:09,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:09,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:09,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:14:09,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:09,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:14:09,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:14:09,379 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:11,547 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:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:11,762 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2021-09-13 14:14:11,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:14:11,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-13 14:14:11,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:11,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2021-09-13 14:14:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2021-09-13 14:14:11,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2021-09-13 14:14:11,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:11,803 INFO L225 Difference]: With dead ends: 25 [2021-09-13 14:14:11,803 INFO L226 Difference]: Without dead ends: 14 [2021-09-13 14:14:11,804 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.10ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:14:11,805 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2091.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.23ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2264.43ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:11,806 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 3.23ms Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 1 Unknown, 0 Unchecked, 2264.43ms Time] [2021-09-13 14:14:11,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-09-13 14:14:11,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-09-13 14:14:11,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:11,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:11,814 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:11,815 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:11,816 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2021-09-13 14:14:11,816 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2021-09-13 14:14:11,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:11,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:11,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2021-09-13 14:14:11,817 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2021-09-13 14:14:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:11,818 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2021-09-13 14:14:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2021-09-13 14:14:11,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:11,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:11,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:11,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:11,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2021-09-13 14:14:11,821 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 7 [2021-09-13 14:14:11,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:11,821 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2021-09-13 14:14:11,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:11,822 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2021-09-13 14:14:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:14:11,822 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:11,822 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:11,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-13 14:14:11,823 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:11,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:11,823 INFO L82 PathProgramCache]: Analyzing trace with hash 87918451, now seen corresponding path program 1 times [2021-09-13 14:14:11,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:11,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177639493] [2021-09-13 14:14:11,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:11,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:12,406 INFO L281 TraceCheckUtils]: 0: Hoare triple {169#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {169#true} is VALID [2021-09-13 14:14:12,407 INFO L281 TraceCheckUtils]: 1: Hoare triple {169#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0;main_~i~0 := 0;main_~k~0 := 0;main_~j~0 := 0;main_~l~0 := 0;main_~v4~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {171#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:12,408 INFO L281 TraceCheckUtils]: 2: Hoare triple {171#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {171#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:12,409 INFO L281 TraceCheckUtils]: 3: Hoare triple {171#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {172#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (<= (+ (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)) 1) ULTIMATE.start_main_~n~0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:12,429 INFO L281 TraceCheckUtils]: 4: Hoare triple {172#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (<= (+ (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)) 1) ULTIMATE.start_main_~n~0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296;main_~v4~0 := 1 + main_~v4~0; {173#(and (= ULTIMATE.start_main_~k~0 0) (<= (+ 2 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296))) (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~v4~0)) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~v4~0 1) (<= 1 ULTIMATE.start_main_~v4~0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:12,431 INFO L281 TraceCheckUtils]: 5: Hoare triple {173#(and (= ULTIMATE.start_main_~k~0 0) (<= (+ 2 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296))) (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~v4~0)) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~v4~0 1) (<= 1 ULTIMATE.start_main_~v4~0) (= ULTIMATE.start_main_~j~0 0))} main_~l~0 := 1 + main_~l~0; {174#(and (= ULTIMATE.start_main_~k~0 0) (or (<= (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296))) (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296)))) (and (<= (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)) 1) (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~v4~0)) (<= ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~l~0))) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0) (< (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296))) (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296)) 1)) (< (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (+ (div ULTIMATE.start_main_~l~0 4294967296) 1)))} is VALID [2021-09-13 14:14:12,434 INFO L281 TraceCheckUtils]: 6: Hoare triple {174#(and (= ULTIMATE.start_main_~k~0 0) (or (<= (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296))) (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296)))) (and (<= (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)) 1) (+ ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~v4~0)) (<= ULTIMATE.start_main_~v4~0 ULTIMATE.start_main_~l~0))) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0) (< (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296))) (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296)) 1)) (< (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (+ (div ULTIMATE.start_main_~l~0 4294967296) 1)))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {175#(and (<= (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296))) (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296)))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0) (< (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296))) (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296)) 1)) (< (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (+ (div ULTIMATE.start_main_~l~0 4294967296) 1)))} is VALID [2021-09-13 14:14:12,435 INFO L281 TraceCheckUtils]: 7: Hoare triple {175#(and (<= (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296))) (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296)))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0) (< (+ ULTIMATE.start_main_~l~0 (* 4294967296 (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296))) (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0 (* 4294967296 (div ULTIMATE.start_main_~l~0 4294967296)) 1)) (< (div (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (+ (div ULTIMATE.start_main_~l~0 4294967296) 1)))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {176#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:14:12,436 INFO L281 TraceCheckUtils]: 8: Hoare triple {176#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {170#false} is VALID [2021-09-13 14:14:12,436 INFO L281 TraceCheckUtils]: 9: Hoare triple {170#false} assume !false; {170#false} is VALID [2021-09-13 14:14:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:12,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:12,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177639493] [2021-09-13 14:14:12,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177639493] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:12,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565438811] [2021-09-13 14:14:12,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:12,437 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:14:12,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:14:12,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:14:12,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-09-13 14:14:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:12,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2021-09-13 14:14:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:12,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:14:12,965 INFO L281 TraceCheckUtils]: 0: Hoare triple {169#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {169#true} is VALID [2021-09-13 14:14:12,966 INFO L281 TraceCheckUtils]: 1: Hoare triple {169#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0;main_~i~0 := 0;main_~k~0 := 0;main_~j~0 := 0;main_~l~0 := 0;main_~v4~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {171#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:12,967 INFO L281 TraceCheckUtils]: 2: Hoare triple {171#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {171#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:12,967 INFO L281 TraceCheckUtils]: 3: Hoare triple {171#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {171#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:12,968 INFO L281 TraceCheckUtils]: 4: Hoare triple {171#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296;main_~v4~0 := 1 + main_~v4~0; {192#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:12,968 INFO L281 TraceCheckUtils]: 5: Hoare triple {192#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} main_~l~0 := 1 + main_~l~0; {196#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:12,969 INFO L281 TraceCheckUtils]: 6: Hoare triple {196#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {196#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:12,970 INFO L281 TraceCheckUtils]: 7: Hoare triple {196#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {203#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:14:12,971 INFO L281 TraceCheckUtils]: 8: Hoare triple {203#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {170#false} is VALID [2021-09-13 14:14:12,971 INFO L281 TraceCheckUtils]: 9: Hoare triple {170#false} assume !false; {170#false} is VALID [2021-09-13 14:14:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:12,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:14:13,244 INFO L281 TraceCheckUtils]: 9: Hoare triple {170#false} assume !false; {170#false} is VALID [2021-09-13 14:14:13,245 INFO L281 TraceCheckUtils]: 8: Hoare triple {203#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {170#false} is VALID [2021-09-13 14:14:13,246 INFO L281 TraceCheckUtils]: 7: Hoare triple {216#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {203#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:14:13,246 INFO L281 TraceCheckUtils]: 6: Hoare triple {216#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {216#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:13,247 INFO L281 TraceCheckUtils]: 5: Hoare triple {223#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} main_~l~0 := 1 + main_~l~0; {216#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:13,253 INFO L281 TraceCheckUtils]: 4: Hoare triple {216#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296;main_~v4~0 := 1 + main_~v4~0; {223#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} is VALID [2021-09-13 14:14:13,254 INFO L281 TraceCheckUtils]: 3: Hoare triple {216#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {216#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:13,254 INFO L281 TraceCheckUtils]: 2: Hoare triple {216#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {216#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:13,255 INFO L281 TraceCheckUtils]: 1: Hoare triple {169#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~0, main_~v4~0;main_~n~0 := 0;main_~i~0 := 0;main_~k~0 := 0;main_~j~0 := 0;main_~l~0 := 0;main_~v4~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {216#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:13,255 INFO L281 TraceCheckUtils]: 0: Hoare triple {169#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(8);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~SIZE~0 := 20000001; {169#true} is VALID [2021-09-13 14:14:13,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-09-13 14:14:13,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565438811] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:13,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:14:13,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 6] total 13 [2021-09-13 14:14:13,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908592149] [2021-09-13 14:14:13,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:14:13,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:13,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:13,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:13,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:14:13,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:13,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:14:13,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:14:13,370 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:15,523 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:17,648 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:17,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:17,873 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2021-09-13 14:14:17,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:14:17,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-13 14:14:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2021-09-13 14:14:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2021-09-13 14:14:17,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2021-09-13 14:14:17,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:17,992 INFO L225 Difference]: With dead ends: 22 [2021-09-13 14:14:17,992 INFO L226 Difference]: Without dead ends: 18 [2021-09-13 14:14:17,992 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 386.36ms TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:14:17,993 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4096.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.25ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4378.72ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:17,994 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 0 Invalid, 55 Unknown, 0 Unchecked, 1.25ms Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 2 Unknown, 0 Unchecked, 4378.72ms Time] [2021-09-13 14:14:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-09-13 14:14:18,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-09-13 14:14:18,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:18,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:18,002 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:18,002 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:18,003 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2021-09-13 14:14:18,004 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2021-09-13 14:14:18,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:18,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:18,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2021-09-13 14:14:18,005 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2021-09-13 14:14:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:18,006 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2021-09-13 14:14:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2021-09-13 14:14:18,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:18,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:18,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:18,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-09-13 14:14:18,008 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2021-09-13 14:14:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:18,009 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-09-13 14:14:18,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-09-13 14:14:18,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 14:14:18,010 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:18,010 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:18,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-09-13 14:14:18,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:14:18,221 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:18,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:18,222 INFO L82 PathProgramCache]: Analyzing trace with hash -116405439, now seen corresponding path program 1 times [2021-09-13 14:14:18,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:18,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235876835] [2021-09-13 14:14:18,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:18,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:18,562 INFO L281 TraceCheckUtils]: 0: Hoare triple {321#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; {323#(and (<= ~SIZE~0 20000001) (< 0 (+ (div ~SIZE~0 4294967296) 1)))} is VALID [2021-09-13 14:14:18,563 INFO L281 TraceCheckUtils]: 1: Hoare triple {323#(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_~v4~0;main_~n~0 := 0;main_~i~0 := 0;main_~k~0 := 0;main_~j~0 := 0;main_~l~0 := 0;main_~v4~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {324#(and (<= ~SIZE~0 20000001) (= ULTIMATE.start_main_~l~0 0) (< 0 (+ (div ~SIZE~0 4294967296) 1)))} is VALID [2021-09-13 14:14:18,564 INFO L281 TraceCheckUtils]: 2: Hoare triple {324#(and (<= ~SIZE~0 20000001) (= ULTIMATE.start_main_~l~0 0) (< 0 (+ (div ~SIZE~0 4294967296) 1)))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {325#(and (<= ULTIMATE.start_main_~n~0 (+ 20000001 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)))) (= ULTIMATE.start_main_~l~0 0))} is VALID [2021-09-13 14:14:18,565 INFO L281 TraceCheckUtils]: 3: Hoare triple {325#(and (<= ULTIMATE.start_main_~n~0 (+ 20000001 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)))) (= ULTIMATE.start_main_~l~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {325#(and (<= ULTIMATE.start_main_~n~0 (+ 20000001 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)))) (= ULTIMATE.start_main_~l~0 0))} is VALID [2021-09-13 14:14:18,565 INFO L281 TraceCheckUtils]: 4: Hoare triple {325#(and (<= ULTIMATE.start_main_~n~0 (+ 20000001 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)))) (= ULTIMATE.start_main_~l~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296;main_~v4~0 := 1 + main_~v4~0; {325#(and (<= ULTIMATE.start_main_~n~0 (+ 20000001 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)))) (= ULTIMATE.start_main_~l~0 0))} is VALID [2021-09-13 14:14:18,566 INFO L281 TraceCheckUtils]: 5: Hoare triple {325#(and (<= ULTIMATE.start_main_~n~0 (+ 20000001 (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296)))) (= ULTIMATE.start_main_~l~0 0))} main_~l~0 := 1 + main_~l~0; {326#(<= (+ (* 36893488151714070528 (div ULTIMATE.start_main_~l~0 4294967296)) ULTIMATE.start_main_~n~0 8569934592 (* 36893488151714070528 (div (+ ULTIMATE.start_main_~l~0 (* (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3) (- 3)) (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* 25769803776 (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3))) (+ (* 8589934593 ULTIMATE.start_main_~l~0) (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296))))} is VALID [2021-09-13 14:14:18,574 INFO L281 TraceCheckUtils]: 6: Hoare triple {326#(<= (+ (* 36893488151714070528 (div ULTIMATE.start_main_~l~0 4294967296)) ULTIMATE.start_main_~n~0 8569934592 (* 36893488151714070528 (div (+ ULTIMATE.start_main_~l~0 (* (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3) (- 3)) (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* 25769803776 (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3))) (+ (* 8589934593 ULTIMATE.start_main_~l~0) (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296))))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {327#(<= (+ (* 6 (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3)) (* 8589934593 (div (+ ULTIMATE.start_main_~l~0 (* (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3) (- 3)) (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 4294967296)) 2 (* 8589934592 (div ULTIMATE.start_main_~l~0 4294967296))) (* 2 ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:14:18,575 INFO L281 TraceCheckUtils]: 7: Hoare triple {327#(<= (+ (* 6 (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3)) (* 8589934593 (div (+ ULTIMATE.start_main_~l~0 (* (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3) (- 3)) (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 4294967296)) 2 (* 8589934592 (div ULTIMATE.start_main_~l~0 4294967296))) (* 2 ULTIMATE.start_main_~l~0))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296); {327#(<= (+ (* 6 (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3)) (* 8589934593 (div (+ ULTIMATE.start_main_~l~0 (* (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3) (- 3)) (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 4294967296)) 2 (* 8589934592 (div ULTIMATE.start_main_~l~0 4294967296))) (* 2 ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:14:18,578 INFO L281 TraceCheckUtils]: 8: Hoare triple {327#(<= (+ (* 6 (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3)) (* 8589934593 (div (+ ULTIMATE.start_main_~l~0 (* (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3) (- 3)) (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 4294967296)) 2 (* 8589934592 (div ULTIMATE.start_main_~l~0 4294967296))) (* 2 ULTIMATE.start_main_~l~0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296;main_~i~0 := 1 + main_~i~0; {322#false} is VALID [2021-09-13 14:14:18,578 INFO L281 TraceCheckUtils]: 9: Hoare triple {322#false} main_~l~0 := 1 + main_~l~0; {322#false} is VALID [2021-09-13 14:14:18,578 INFO L281 TraceCheckUtils]: 10: Hoare triple {322#false} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {322#false} is VALID [2021-09-13 14:14:18,579 INFO L281 TraceCheckUtils]: 11: Hoare triple {322#false} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {322#false} is VALID [2021-09-13 14:14:18,579 INFO L281 TraceCheckUtils]: 12: Hoare triple {322#false} assume 0 == __VERIFIER_assert_~cond; {322#false} is VALID [2021-09-13 14:14:18,579 INFO L281 TraceCheckUtils]: 13: Hoare triple {322#false} assume !false; {322#false} is VALID [2021-09-13 14:14:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:18,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:18,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235876835] [2021-09-13 14:14:18,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235876835] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:18,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378077331] [2021-09-13 14:14:18,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:18,580 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:14:18,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:14:18,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:14:18,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-09-13 14:14:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:18,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2021-09-13 14:14:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:18,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:14:19,247 INFO L281 TraceCheckUtils]: 0: Hoare triple {321#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; {321#true} is VALID [2021-09-13 14:14:19,248 INFO L281 TraceCheckUtils]: 1: Hoare triple {321#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~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_~v4~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {334#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,249 INFO L281 TraceCheckUtils]: 2: Hoare triple {334#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {334#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,250 INFO L281 TraceCheckUtils]: 3: Hoare triple {334#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {334#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,250 INFO L281 TraceCheckUtils]: 4: Hoare triple {334#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296;main_~v4~0 := 1 + main_~v4~0; {344#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,251 INFO L281 TraceCheckUtils]: 5: Hoare triple {344#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} main_~l~0 := 1 + main_~l~0; {348#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,252 INFO L281 TraceCheckUtils]: 6: Hoare triple {348#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {348#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,252 INFO L281 TraceCheckUtils]: 7: Hoare triple {348#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296); {348#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,253 INFO L281 TraceCheckUtils]: 8: Hoare triple {348#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296;main_~i~0 := 1 + main_~i~0; {358#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,254 INFO L281 TraceCheckUtils]: 9: Hoare triple {358#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} main_~l~0 := 1 + main_~l~0; {362#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,255 INFO L281 TraceCheckUtils]: 10: Hoare triple {362#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {362#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:19,256 INFO L281 TraceCheckUtils]: 11: Hoare triple {362#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {369#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:14:19,256 INFO L281 TraceCheckUtils]: 12: Hoare triple {369#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {322#false} is VALID [2021-09-13 14:14:19,256 INFO L281 TraceCheckUtils]: 13: Hoare triple {322#false} assume !false; {322#false} is VALID [2021-09-13 14:14:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:19,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:14:19,685 INFO L281 TraceCheckUtils]: 13: Hoare triple {322#false} assume !false; {322#false} is VALID [2021-09-13 14:14:19,685 INFO L281 TraceCheckUtils]: 12: Hoare triple {369#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {322#false} is VALID [2021-09-13 14:14:19,686 INFO L281 TraceCheckUtils]: 11: Hoare triple {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {369#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:14:19,686 INFO L281 TraceCheckUtils]: 10: Hoare triple {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:19,688 INFO L281 TraceCheckUtils]: 9: Hoare triple {389#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} main_~l~0 := 1 + main_~l~0; {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:21,806 INFO L281 TraceCheckUtils]: 8: Hoare triple {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296;main_~i~0 := 1 + main_~i~0; {389#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} is UNKNOWN [2021-09-13 14:14:21,807 INFO L281 TraceCheckUtils]: 7: Hoare triple {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296); {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:21,807 INFO L281 TraceCheckUtils]: 6: Hoare triple {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:21,812 INFO L281 TraceCheckUtils]: 5: Hoare triple {389#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} main_~l~0 := 1 + main_~l~0; {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:22,332 INFO L281 TraceCheckUtils]: 4: Hoare triple {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296;main_~v4~0 := 1 + main_~v4~0; {389#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} is VALID [2021-09-13 14:14:22,333 INFO L281 TraceCheckUtils]: 3: Hoare triple {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:22,334 INFO L281 TraceCheckUtils]: 2: Hoare triple {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:22,334 INFO L281 TraceCheckUtils]: 1: Hoare triple {321#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~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_~v4~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {382#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:22,334 INFO L281 TraceCheckUtils]: 0: Hoare triple {321#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; {321#true} is VALID [2021-09-13 14:14:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-09-13 14:14:22,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378077331] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:22,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:14:22,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 8] total 15 [2021-09-13 14:14:22,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488123900] [2021-09-13 14:14:22,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 14:14:22,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:22,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:24,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 11 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:24,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:14:24,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:24,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:14:24,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:14:24,492 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:26,582 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:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:26,840 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2021-09-13 14:14:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:14:26,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 14:14:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2021-09-13 14:14:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2021-09-13 14:14:26,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2021-09-13 14:14:29,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:29,017 INFO L225 Difference]: With dead ends: 25 [2021-09-13 14:14:29,017 INFO L226 Difference]: Without dead ends: 21 [2021-09-13 14:14:29,017 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 443.40ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:14:29,018 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2076.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.80ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2090.01ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:29,018 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 55 Unknown, 0 Unchecked, 0.80ms Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 2090.01ms Time] [2021-09-13 14:14:29,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-09-13 14:14:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2021-09-13 14:14:29,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:29,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:29,033 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:29,033 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:29,037 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2021-09-13 14:14:29,037 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2021-09-13 14:14:29,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:29,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:29,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2021-09-13 14:14:29,038 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2021-09-13 14:14:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:29,039 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2021-09-13 14:14:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2021-09-13 14:14:29,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:29,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:29,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:29,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:29,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2021-09-13 14:14:29,041 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 14 [2021-09-13 14:14:29,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:29,042 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2021-09-13 14:14:29,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2021-09-13 14:14:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-13 14:14:29,043 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:29,043 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:29,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-09-13 14:14:29,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-09-13 14:14:29,249 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:29,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:29,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1931219048, now seen corresponding path program 1 times [2021-09-13 14:14:29,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:29,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181546698] [2021-09-13 14:14:29,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:29,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:29,317 INFO L281 TraceCheckUtils]: 0: Hoare triple {510#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; {510#true} is VALID [2021-09-13 14:14:29,318 INFO L281 TraceCheckUtils]: 1: Hoare triple {510#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~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_~v4~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {512#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:29,319 INFO L281 TraceCheckUtils]: 2: Hoare triple {512#(= ULTIMATE.start_main_~l~0 0)} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {512#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:29,319 INFO L281 TraceCheckUtils]: 3: Hoare triple {512#(= ULTIMATE.start_main_~l~0 0)} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {512#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:29,320 INFO L281 TraceCheckUtils]: 4: Hoare triple {512#(= ULTIMATE.start_main_~l~0 0)} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296;main_~v4~0 := 1 + main_~v4~0; {512#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:29,320 INFO L281 TraceCheckUtils]: 5: Hoare triple {512#(= ULTIMATE.start_main_~l~0 0)} main_~l~0 := 1 + main_~l~0; {513#(and (<= (div ULTIMATE.start_main_~l~0 2) 0) (<= 1 ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:14:29,322 INFO L281 TraceCheckUtils]: 6: Hoare triple {513#(and (<= (div ULTIMATE.start_main_~l~0 2) 0) (<= 1 ULTIMATE.start_main_~l~0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {513#(and (<= (div ULTIMATE.start_main_~l~0 2) 0) (<= 1 ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:14:29,322 INFO L281 TraceCheckUtils]: 7: Hoare triple {513#(and (<= (div ULTIMATE.start_main_~l~0 2) 0) (<= 1 ULTIMATE.start_main_~l~0))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296); {513#(and (<= (div ULTIMATE.start_main_~l~0 2) 0) (<= 1 ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:14:29,323 INFO L281 TraceCheckUtils]: 8: Hoare triple {513#(and (<= (div ULTIMATE.start_main_~l~0 2) 0) (<= 1 ULTIMATE.start_main_~l~0))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296); {513#(and (<= (div ULTIMATE.start_main_~l~0 2) 0) (<= 1 ULTIMATE.start_main_~l~0))} is VALID [2021-09-13 14:14:29,324 INFO L281 TraceCheckUtils]: 9: Hoare triple {513#(and (<= (div ULTIMATE.start_main_~l~0 2) 0) (<= 1 ULTIMATE.start_main_~l~0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 2 then main_~l~0 % 4294967296 % 2 - 2 else main_~l~0 % 4294967296 % 2) % 4294967296;main_~j~0 := 1 + main_~j~0; {511#false} is VALID [2021-09-13 14:14:29,324 INFO L281 TraceCheckUtils]: 10: Hoare triple {511#false} main_~l~0 := 1 + main_~l~0; {511#false} is VALID [2021-09-13 14:14:29,324 INFO L281 TraceCheckUtils]: 11: Hoare triple {511#false} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {511#false} is VALID [2021-09-13 14:14:29,325 INFO L281 TraceCheckUtils]: 12: Hoare triple {511#false} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {511#false} is VALID [2021-09-13 14:14:29,325 INFO L281 TraceCheckUtils]: 13: Hoare triple {511#false} assume 0 == __VERIFIER_assert_~cond; {511#false} is VALID [2021-09-13 14:14:29,325 INFO L281 TraceCheckUtils]: 14: Hoare triple {511#false} assume !false; {511#false} is VALID [2021-09-13 14:14:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:29,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:29,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181546698] [2021-09-13 14:14:29,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181546698] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:29,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521652960] [2021-09-13 14:14:29,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:29,326 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:14:29,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:14:29,327 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:14:29,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-09-13 14:14:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:29,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 21 conjunts are in the unsatisfiable core [2021-09-13 14:14:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:29,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:14:29,946 INFO L281 TraceCheckUtils]: 0: Hoare triple {510#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; {510#true} is VALID [2021-09-13 14:14:29,947 INFO L281 TraceCheckUtils]: 1: Hoare triple {510#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~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_~v4~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {520#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:29,948 INFO L281 TraceCheckUtils]: 2: Hoare triple {520#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {520#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:29,949 INFO L281 TraceCheckUtils]: 3: Hoare triple {520#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {520#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:29,952 INFO L281 TraceCheckUtils]: 4: Hoare triple {520#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296;main_~v4~0 := 1 + main_~v4~0; {530#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:29,952 INFO L281 TraceCheckUtils]: 5: Hoare triple {530#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} main_~l~0 := 1 + main_~l~0; {534#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:29,953 INFO L281 TraceCheckUtils]: 6: Hoare triple {534#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {534#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:29,954 INFO L281 TraceCheckUtils]: 7: Hoare triple {534#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296); {534#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:29,954 INFO L281 TraceCheckUtils]: 8: Hoare triple {534#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296); {534#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:29,955 INFO L281 TraceCheckUtils]: 9: Hoare triple {534#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 2 then main_~l~0 % 4294967296 % 2 - 2 else main_~l~0 % 4294967296 % 2) % 4294967296;main_~j~0 := 1 + main_~j~0; {547#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 1))} is VALID [2021-09-13 14:14:29,957 INFO L281 TraceCheckUtils]: 10: Hoare triple {547#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 1))} main_~l~0 := 1 + main_~l~0; {551#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 1))} is VALID [2021-09-13 14:14:29,957 INFO L281 TraceCheckUtils]: 11: Hoare triple {551#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 1))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {551#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 1))} is VALID [2021-09-13 14:14:29,963 INFO L281 TraceCheckUtils]: 12: Hoare triple {551#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 1))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {558#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:14:29,964 INFO L281 TraceCheckUtils]: 13: Hoare triple {558#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {511#false} is VALID [2021-09-13 14:14:29,965 INFO L281 TraceCheckUtils]: 14: Hoare triple {511#false} assume !false; {511#false} is VALID [2021-09-13 14:14:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:29,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:14:30,287 INFO L281 TraceCheckUtils]: 14: Hoare triple {511#false} assume !false; {511#false} is VALID [2021-09-13 14:14:30,295 INFO L281 TraceCheckUtils]: 13: Hoare triple {558#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {511#false} is VALID [2021-09-13 14:14:30,298 INFO L281 TraceCheckUtils]: 12: Hoare triple {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {558#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:14:30,299 INFO L281 TraceCheckUtils]: 11: Hoare triple {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:30,301 INFO L281 TraceCheckUtils]: 10: Hoare triple {578#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} main_~l~0 := 1 + main_~l~0; {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:30,329 INFO L281 TraceCheckUtils]: 9: Hoare triple {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 2 then main_~l~0 % 4294967296 % 2 - 2 else main_~l~0 % 4294967296 % 2) % 4294967296;main_~j~0 := 1 + main_~j~0; {578#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} is VALID [2021-09-13 14:14:30,330 INFO L281 TraceCheckUtils]: 8: Hoare triple {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296); {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:30,330 INFO L281 TraceCheckUtils]: 7: Hoare triple {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296); {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:30,331 INFO L281 TraceCheckUtils]: 6: Hoare triple {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:30,332 INFO L281 TraceCheckUtils]: 5: Hoare triple {578#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} main_~l~0 := 1 + main_~l~0; {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:30,366 INFO L281 TraceCheckUtils]: 4: Hoare triple {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296;main_~v4~0 := 1 + main_~v4~0; {578#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} is VALID [2021-09-13 14:14:30,366 INFO L281 TraceCheckUtils]: 3: Hoare triple {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:30,368 INFO L281 TraceCheckUtils]: 2: Hoare triple {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:30,368 INFO L281 TraceCheckUtils]: 1: Hoare triple {510#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~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_~v4~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {571#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:30,368 INFO L281 TraceCheckUtils]: 0: Hoare triple {510#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; {510#true} is VALID [2021-09-13 14:14:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-09-13 14:14:30,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521652960] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:30,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:14:30,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 8] total 12 [2021-09-13 14:14:30,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962240679] [2021-09-13 14:14:30,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 15 [2021-09-13 14:14:30,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:30,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:30,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:14:30,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:30,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:14:30,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:14:30,428 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:32,514 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:34,619 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:14:34,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:34,915 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2021-09-13 14:14:34,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:14:34,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 15 [2021-09-13 14:14:34,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2021-09-13 14:14:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2021-09-13 14:14:34,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2021-09-13 14:14:34,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:34,978 INFO L225 Difference]: With dead ends: 31 [2021-09-13 14:14:34,978 INFO L226 Difference]: Without dead ends: 27 [2021-09-13 14:14:34,979 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 259.62ms TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:14:34,979 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4117.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.82ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4373.17ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:34,980 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.82ms Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 2 Unknown, 0 Unchecked, 4373.17ms Time] [2021-09-13 14:14:34,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-09-13 14:14:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-09-13 14:14:34,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:34,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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:34,988 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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:34,988 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:34,990 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2021-09-13 14:14:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2021-09-13 14:14:34,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:34,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:34,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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:14:34,991 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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:14:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:34,992 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2021-09-13 14:14:34,992 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2021-09-13 14:14:34,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:34,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:34,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:34,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2021-09-13 14:14:34,994 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 15 [2021-09-13 14:14:34,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:34,995 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2021-09-13 14:14:34,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:34,995 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2021-09-13 14:14:34,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-13 14:14:34,996 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:34,996 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:35,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-09-13 14:14:35,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:14:35,214 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:35,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:35,214 INFO L82 PathProgramCache]: Analyzing trace with hash -527836022, now seen corresponding path program 1 times [2021-09-13 14:14:35,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:35,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444075158] [2021-09-13 14:14:35,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:35,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:35,323 INFO L281 TraceCheckUtils]: 0: Hoare triple {732#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; {732#true} is VALID [2021-09-13 14:14:35,324 INFO L281 TraceCheckUtils]: 1: Hoare triple {732#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~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_~v4~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {734#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:35,324 INFO L281 TraceCheckUtils]: 2: Hoare triple {734#(= ULTIMATE.start_main_~l~0 0)} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {734#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:35,325 INFO L281 TraceCheckUtils]: 3: Hoare triple {734#(= ULTIMATE.start_main_~l~0 0)} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {734#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:35,325 INFO L281 TraceCheckUtils]: 4: Hoare triple {734#(= ULTIMATE.start_main_~l~0 0)} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296;main_~v4~0 := 1 + main_~v4~0; {734#(= ULTIMATE.start_main_~l~0 0)} is VALID [2021-09-13 14:14:35,326 INFO L281 TraceCheckUtils]: 5: Hoare triple {734#(= ULTIMATE.start_main_~l~0 0)} main_~l~0 := 1 + main_~l~0; {735#(<= (+ (* 36893488151714070528 (div ULTIMATE.start_main_~l~0 4294967296)) ULTIMATE.start_main_~n~0 (* 36893488151714070528 (div (+ ULTIMATE.start_main_~l~0 (* (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3) (- 3)) (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* 25769803776 (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* 8589934593 ULTIMATE.start_main_~l~0) (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296))))} is VALID [2021-09-13 14:14:35,326 INFO L281 TraceCheckUtils]: 6: Hoare triple {735#(<= (+ (* 36893488151714070528 (div ULTIMATE.start_main_~l~0 4294967296)) ULTIMATE.start_main_~n~0 (* 36893488151714070528 (div (+ ULTIMATE.start_main_~l~0 (* (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3) (- 3)) (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* 25769803776 (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* 8589934593 ULTIMATE.start_main_~l~0) (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296))))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {735#(<= (+ (* 36893488151714070528 (div ULTIMATE.start_main_~l~0 4294967296)) ULTIMATE.start_main_~n~0 (* 36893488151714070528 (div (+ ULTIMATE.start_main_~l~0 (* (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3) (- 3)) (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* 25769803776 (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* 8589934593 ULTIMATE.start_main_~l~0) (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296))))} is VALID [2021-09-13 14:14:35,327 INFO L281 TraceCheckUtils]: 7: Hoare triple {735#(<= (+ (* 36893488151714070528 (div ULTIMATE.start_main_~l~0 4294967296)) ULTIMATE.start_main_~n~0 (* 36893488151714070528 (div (+ ULTIMATE.start_main_~l~0 (* (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3) (- 3)) (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* 25769803776 (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* 8589934593 ULTIMATE.start_main_~l~0) (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296))))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296); {735#(<= (+ (* 36893488151714070528 (div ULTIMATE.start_main_~l~0 4294967296)) ULTIMATE.start_main_~n~0 (* 36893488151714070528 (div (+ ULTIMATE.start_main_~l~0 (* (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3) (- 3)) (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* 25769803776 (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* 8589934593 ULTIMATE.start_main_~l~0) (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296))))} is VALID [2021-09-13 14:14:35,329 INFO L281 TraceCheckUtils]: 8: Hoare triple {735#(<= (+ (* 36893488151714070528 (div ULTIMATE.start_main_~l~0 4294967296)) ULTIMATE.start_main_~n~0 (* 36893488151714070528 (div (+ ULTIMATE.start_main_~l~0 (* (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3) (- 3)) (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* 25769803776 (div (+ ULTIMATE.start_main_~l~0 (* (div ULTIMATE.start_main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* 8589934593 ULTIMATE.start_main_~l~0) (* 4294967296 (div ULTIMATE.start_main_~n~0 4294967296))))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296;main_~i~0 := 1 + main_~i~0; {733#false} is VALID [2021-09-13 14:14:35,329 INFO L281 TraceCheckUtils]: 9: Hoare triple {733#false} main_~l~0 := 1 + main_~l~0; {733#false} is VALID [2021-09-13 14:14:35,330 INFO L281 TraceCheckUtils]: 10: Hoare triple {733#false} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {733#false} is VALID [2021-09-13 14:14:35,330 INFO L281 TraceCheckUtils]: 11: Hoare triple {733#false} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296); {733#false} is VALID [2021-09-13 14:14:35,330 INFO L281 TraceCheckUtils]: 12: Hoare triple {733#false} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296); {733#false} is VALID [2021-09-13 14:14:35,330 INFO L281 TraceCheckUtils]: 13: Hoare triple {733#false} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 2 then main_~l~0 % 4294967296 % 2 - 2 else main_~l~0 % 4294967296 % 2) % 4294967296;main_~j~0 := 1 + main_~j~0; {733#false} is VALID [2021-09-13 14:14:35,330 INFO L281 TraceCheckUtils]: 14: Hoare triple {733#false} main_~l~0 := 1 + main_~l~0; {733#false} is VALID [2021-09-13 14:14:35,330 INFO L281 TraceCheckUtils]: 15: Hoare triple {733#false} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {733#false} is VALID [2021-09-13 14:14:35,330 INFO L281 TraceCheckUtils]: 16: Hoare triple {733#false} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {733#false} is VALID [2021-09-13 14:14:35,330 INFO L281 TraceCheckUtils]: 17: Hoare triple {733#false} assume 0 == __VERIFIER_assert_~cond; {733#false} is VALID [2021-09-13 14:14:35,330 INFO L281 TraceCheckUtils]: 18: Hoare triple {733#false} assume !false; {733#false} is VALID [2021-09-13 14:14:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-09-13 14:14:35,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:35,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444075158] [2021-09-13 14:14:35,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444075158] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:35,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28140411] [2021-09-13 14:14:35,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:35,331 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:14:35,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:14:35,333 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:14:35,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-09-13 14:14:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:35,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 25 conjunts are in the unsatisfiable core [2021-09-13 14:14:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:35,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:14:36,080 INFO L281 TraceCheckUtils]: 0: Hoare triple {732#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; {732#true} is VALID [2021-09-13 14:14:36,082 INFO L281 TraceCheckUtils]: 1: Hoare triple {732#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~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_~v4~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {742#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:36,082 INFO L281 TraceCheckUtils]: 2: Hoare triple {742#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {742#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:36,083 INFO L281 TraceCheckUtils]: 3: Hoare triple {742#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {742#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:36,084 INFO L281 TraceCheckUtils]: 4: Hoare triple {742#(and (= ULTIMATE.start_main_~v4~0 0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296;main_~v4~0 := 1 + main_~v4~0; {752#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:36,086 INFO L281 TraceCheckUtils]: 5: Hoare triple {752#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 0) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} main_~l~0 := 1 + main_~l~0; {756#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:36,087 INFO L281 TraceCheckUtils]: 6: Hoare triple {756#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {756#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:36,087 INFO L281 TraceCheckUtils]: 7: Hoare triple {756#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296); {756#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:36,088 INFO L281 TraceCheckUtils]: 8: Hoare triple {756#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~i~0 0) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296;main_~i~0 := 1 + main_~i~0; {766#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:36,088 INFO L281 TraceCheckUtils]: 9: Hoare triple {766#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 1) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} main_~l~0 := 1 + main_~l~0; {770#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:36,089 INFO L281 TraceCheckUtils]: 10: Hoare triple {770#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {770#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:36,089 INFO L281 TraceCheckUtils]: 11: Hoare triple {770#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296); {770#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:36,090 INFO L281 TraceCheckUtils]: 12: Hoare triple {770#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296); {770#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} is VALID [2021-09-13 14:14:36,091 INFO L281 TraceCheckUtils]: 13: Hoare triple {770#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 0))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 2 then main_~l~0 % 4294967296 % 2 - 2 else main_~l~0 % 4294967296 % 2) % 4294967296;main_~j~0 := 1 + main_~j~0; {783#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 1))} is VALID [2021-09-13 14:14:36,091 INFO L281 TraceCheckUtils]: 14: Hoare triple {783#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 2) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 1))} main_~l~0 := 1 + main_~l~0; {787#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 3) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 1))} is VALID [2021-09-13 14:14:36,092 INFO L281 TraceCheckUtils]: 15: Hoare triple {787#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 3) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 1))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {787#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 3) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 1))} is VALID [2021-09-13 14:14:36,092 INFO L281 TraceCheckUtils]: 16: Hoare triple {787#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~l~0 3) (= ULTIMATE.start_main_~v4~0 1) (= ULTIMATE.start_main_~i~0 1) (= ULTIMATE.start_main_~j~0 1))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {794#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:14:36,093 INFO L281 TraceCheckUtils]: 17: Hoare triple {794#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {733#false} is VALID [2021-09-13 14:14:36,093 INFO L281 TraceCheckUtils]: 18: Hoare triple {733#false} assume !false; {733#false} is VALID [2021-09-13 14:14:36,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:14:36,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:14:36,495 INFO L281 TraceCheckUtils]: 18: Hoare triple {733#false} assume !false; {733#false} is VALID [2021-09-13 14:14:36,496 INFO L281 TraceCheckUtils]: 17: Hoare triple {794#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {733#false} is VALID [2021-09-13 14:14:36,496 INFO L281 TraceCheckUtils]: 16: Hoare triple {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} __VERIFIER_assert_#in~cond := (if (main_~i~0 + main_~j~0 + main_~k~0 + main_~v4~0) % 4294967296 == main_~l~0 % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {794#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:14:36,497 INFO L281 TraceCheckUtils]: 15: Hoare triple {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:36,498 INFO L281 TraceCheckUtils]: 14: Hoare triple {814#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} main_~l~0 := 1 + main_~l~0; {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:36,556 INFO L281 TraceCheckUtils]: 13: Hoare triple {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 2 then main_~l~0 % 4294967296 % 2 - 2 else main_~l~0 % 4294967296 % 2) % 4294967296;main_~j~0 := 1 + main_~j~0; {814#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} is VALID [2021-09-13 14:14:36,557 INFO L281 TraceCheckUtils]: 12: Hoare triple {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296); {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:36,557 INFO L281 TraceCheckUtils]: 11: Hoare triple {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296); {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:36,557 INFO L281 TraceCheckUtils]: 10: Hoare triple {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:36,559 INFO L281 TraceCheckUtils]: 9: Hoare triple {814#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} main_~l~0 := 1 + main_~l~0; {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:38,661 INFO L281 TraceCheckUtils]: 8: Hoare triple {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 3 then main_~l~0 % 4294967296 % 3 - 3 else main_~l~0 % 4294967296 % 3) % 4294967296;main_~i~0 := 1 + main_~i~0; {814#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} is UNKNOWN [2021-09-13 14:14:38,662 INFO L281 TraceCheckUtils]: 7: Hoare triple {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !(0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296); {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:38,662 INFO L281 TraceCheckUtils]: 6: Hoare triple {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:38,665 INFO L281 TraceCheckUtils]: 5: Hoare triple {814#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} main_~l~0 := 1 + main_~l~0; {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:38,709 INFO L281 TraceCheckUtils]: 4: Hoare triple {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume 0 == (if main_~l~0 % 4294967296 < 0 && 0 != main_~l~0 % 4294967296 % 4 then main_~l~0 % 4294967296 % 4 - 4 else main_~l~0 % 4294967296 % 4) % 4294967296;main_~v4~0 := 1 + main_~v4~0; {814#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod (+ ULTIMATE.start_main_~l~0 1) 4294967296))} is VALID [2021-09-13 14:14:38,709 INFO L281 TraceCheckUtils]: 3: Hoare triple {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~l~0 % 4294967296 < main_~n~0 % 4294967296); {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:38,709 INFO L281 TraceCheckUtils]: 2: Hoare triple {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} assume !!(main_~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:38,715 INFO L281 TraceCheckUtils]: 1: Hoare triple {732#true} havoc main_#res;havoc main_#t~nondet7, main_~n~0, main_~i~0, main_~k~0, main_~j~0, main_~l~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_~v4~0 := 0;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; {807#(= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296))} is VALID [2021-09-13 14:14:38,716 INFO L281 TraceCheckUtils]: 0: Hoare triple {732#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; {732#true} is VALID [2021-09-13 14:14:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-09-13 14:14:38,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28140411] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:38,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:14:38,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 10] total 14 [2021-09-13 14:14:38,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973287629] [2021-09-13 14:14:38,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-09-13 14:14:38,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:38,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:40,930 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:40,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:14:40,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:40,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:14:40,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:14:40,931 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:42,997 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:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:43,301 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2021-09-13 14:14:43,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:14:43,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-09-13 14:14:43,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2021-09-13 14:14:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2021-09-13 14:14:43,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 15 transitions. [2021-09-13 14:14:45,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:45,512 INFO L225 Difference]: With dead ends: 27 [2021-09-13 14:14:45,512 INFO L226 Difference]: Without dead ends: 0 [2021-09-13 14:14:45,512 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 332.46ms TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:14:45,513 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2107.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.64ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2121.45ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:45,513 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.64ms Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 2121.45ms Time] [2021-09-13 14:14:45,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-09-13 14:14:45,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-09-13 14:14:45,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:45,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:45,515 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:45,515 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:45,515 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:14:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:14:45,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:45,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:45,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2021-09-13 14:14:45,516 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2021-09-13 14:14:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:45,516 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:14:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:14:45,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:45,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:45,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:45,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-09-13 14:14:45,517 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2021-09-13 14:14:45,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:45,518 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-09-13 14:14:45,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:14:45,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:45,520 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-09-13 14:14:45,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-09-13 14:14:45,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:14:45,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-09-13 14:14:45,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:14:45,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:14:45,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:14:45,761 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-09-13 14:14:45,761 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 30) no Hoare annotation was computed. [2021-09-13 14:14:45,761 INFO L858 garLoopResultBuilder]: For program point L25(lines 25 30) no Hoare annotation was computed. [2021-09-13 14:14:45,761 INFO L858 garLoopResultBuilder]: For program point L27-2(lines 23 30) no Hoare annotation was computed. [2021-09-13 14:14:45,761 INFO L858 garLoopResultBuilder]: For program point L23(lines 23 30) no Hoare annotation was computed. [2021-09-13 14:14:45,762 INFO L854 garLoopResultBuilder]: At program point L21-2(lines 21 32) the Hoare annotation is: (= (mod (+ ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~v4~0) 4294967296) (mod ULTIMATE.start_main_~l~0 4294967296)) [2021-09-13 14:14:45,762 INFO L858 garLoopResultBuilder]: For program point L21-3(lines 21 32) no Hoare annotation was computed. [2021-09-13 14:14:45,762 INFO L858 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2021-09-13 14:14:45,762 INFO L861 garLoopResultBuilder]: At program point L9-2(lines 8 13) the Hoare annotation is: true [2021-09-13 14:14:45,762 INFO L861 garLoopResultBuilder]: At program point L34(lines 16 35) the Hoare annotation is: true [2021-09-13 14:14:45,762 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-09-13 14:14:45,762 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-09-13 14:14:45,762 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-09-13 14:14:45,763 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2021-09-13 14:14:45,763 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2021-09-13 14:14:45,763 INFO L858 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2021-09-13 14:14:45,767 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:14:45,770 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:14:45,770 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:14:45,770 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2021-09-13 14:14:45,771 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2021-09-13 14:14:45,771 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:14:45,771 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2021-09-13 14:14:45,771 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2021-09-13 14:14:45,771 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2021-09-13 14:14:45,771 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:14:45,771 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2021-09-13 14:14:45,771 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2021-09-13 14:14:45,771 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2021-09-13 14:14:45,772 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2021-09-13 14:14:45,772 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2021-09-13 14:14:45,772 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2021-09-13 14:14:45,772 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2021-09-13 14:14:45,772 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2021-09-13 14:14:45,772 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2021-09-13 14:14:45,772 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2021-09-13 14:14:45,772 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2021-09-13 14:14:45,773 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2021-09-13 14:14:45,773 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 14:14:45,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:14:45 BoogieIcfgContainer [2021-09-13 14:14:45,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:14:45,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:14:45,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:14:45,788 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:14:45,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:14:06" (3/4) ... [2021-09-13 14:14:45,791 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-09-13 14:14:45,797 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-09-13 14:14:45,797 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-09-13 14:14:45,798 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:14:45,798 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:14:45,823 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-13 14:14:45,823 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:14:45,824 INFO L158 Benchmark]: Toolchain (without parser) took 40278.43ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 48.6MB in the beginning and 22.6MB in the end (delta: 26.0MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2021-09-13 14:14:45,824 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 65.0MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:14:45,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.98ms. Allocated memory is still 65.0MB. Free memory was 48.3MB in the beginning and 38.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:14:45,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.65ms. Allocated memory is still 65.0MB. Free memory was 38.2MB in the beginning and 36.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:14:45,825 INFO L158 Benchmark]: Boogie Preprocessor took 25.76ms. Allocated memory is still 65.0MB. Free memory was 36.7MB in the beginning and 49.2MB in the end (delta: -12.5MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2021-09-13 14:14:45,825 INFO L158 Benchmark]: RCFGBuilder took 251.81ms. Allocated memory is still 65.0MB. Free memory was 49.2MB in the beginning and 39.3MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:14:45,826 INFO L158 Benchmark]: TraceAbstraction took 39755.63ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 38.8MB in the beginning and 24.7MB in the end (delta: 14.1MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2021-09-13 14:14:45,826 INFO L158 Benchmark]: Witness Printer took 35.04ms. Allocated memory is still 81.8MB. Free memory was 24.7MB in the beginning and 22.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:14:45,828 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.65ms. Allocated memory is still 65.0MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.98ms. Allocated memory is still 65.0MB. Free memory was 48.3MB in the beginning and 38.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.65ms. Allocated memory is still 65.0MB. Free memory was 38.2MB in the beginning and 36.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.76ms. Allocated memory is still 65.0MB. Free memory was 36.7MB in the beginning and 49.2MB in the end (delta: -12.5MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * RCFGBuilder took 251.81ms. Allocated memory is still 65.0MB. Free memory was 49.2MB in the beginning and 39.3MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 39755.63ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 38.8MB in the beginning and 24.7MB in the end (delta: 14.1MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * Witness Printer took 35.04ms. Allocated memory is still 81.8MB. Free memory was 24.7MB in the beginning and 22.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39669.14ms, OverallIterations: 6, TraceHistogramMax: 3, EmptinessCheckTime: 13.92ms, AutomataDifference: 23166.91ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 24.65ms, InitialAbstractionConstructionTime: 9.47ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 17314.36ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 16557.53ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 256 IncrementalHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 0 mSDtfsCounter, 256 mSolverCounterSat, 7.24ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 81 SyntacticMatches, 13 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1476.99ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 110.62ms AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 7 NumberOfFragments, 13 HoareAnnotationTreeSize, 3 FomulaSimplifications, 28 FormulaSimplificationTreeSizeReduction, 13.82ms HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 4.45ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 26.37ms SsaConstructionTime, 219.04ms SatisfiabilityAnalysisTime, 10324.20ms InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 1934 SizeOfPredicates, 24 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 41/72 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (k + j + i + v4) % 4294967296 == l % 4294967296 RESULT: Ultimate proved your program to be correct! [2021-09-13 14:14:45,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...