./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invariants/linear-inequality-inv-a.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 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/loop-invariants/linear-inequality-inv-a.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 e6ceef81d5d5c6ec4b435ae3bf6300a70928e11f3a8c1d376463323495e50f12 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:09:32,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:09:32,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:09:32,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:09:32,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:09:32,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:09:32,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:09:32,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:09:32,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:09:32,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:09:32,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:09:32,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:09:32,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:09:32,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:09:32,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:09:32,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:09:32,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:09:32,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:09:32,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:09:32,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:09:32,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:09:32,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:09:32,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:09:32,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:09:32,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:09:32,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:09:32,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:09:32,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:09:32,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:09:32,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:09:32,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:09:32,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:09:32,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:09:32,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:09:32,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:09:32,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:09:32,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:09:32,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:09:32,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:09:32,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:09:32,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:09:32,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:09:32,985 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:09:32,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:09:32,985 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:09:32,986 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:09:32,986 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:09:32,986 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:09:32,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:09:32,987 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:09:32,987 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:09:32,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:09:32,988 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:09:32,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:09:32,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:09:32,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:09:32,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:09:32,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:09:32,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:09:32,989 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:09:32,990 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:09:32,990 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:09:32,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:09:32,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:09:32,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:09:32,991 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:09:32,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:09:32,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:09:32,991 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:09:32,991 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:09:32,991 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:09:32,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:09:32,992 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:09:32,992 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:09:32,992 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:09:32,992 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 -> e6ceef81d5d5c6ec4b435ae3bf6300a70928e11f3a8c1d376463323495e50f12 [2022-02-20 17:09:33,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:09:33,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:09:33,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:09:33,233 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:09:33,235 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:09:33,236 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invariants/linear-inequality-inv-a.c [2022-02-20 17:09:33,299 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89be4cb9a/ea845169fdd4425a9d4958ef825141cf/FLAGb0ce4c8f5 [2022-02-20 17:09:33,665 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:09:33,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invariants/linear-inequality-inv-a.c [2022-02-20 17:09:33,680 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89be4cb9a/ea845169fdd4425a9d4958ef825141cf/FLAGb0ce4c8f5 [2022-02-20 17:09:34,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89be4cb9a/ea845169fdd4425a9d4958ef825141cf [2022-02-20 17:09:34,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:09:34,101 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:09:34,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:09:34,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:09:34,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:09:34,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:09:34" (1/1) ... [2022-02-20 17:09:34,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4abe2a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34, skipping insertion in model container [2022-02-20 17:09:34,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:09:34" (1/1) ... [2022-02-20 17:09:34,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:09:34,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:09:34,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invariants/linear-inequality-inv-a.c[557,570] [2022-02-20 17:09:34,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invariants/linear-inequality-inv-a.c[613,626] [2022-02-20 17:09:34,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:09:34,227 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:09:34,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invariants/linear-inequality-inv-a.c[557,570] [2022-02-20 17:09:34,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invariants/linear-inequality-inv-a.c[613,626] [2022-02-20 17:09:34,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:09:34,250 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:09:34,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34 WrapperNode [2022-02-20 17:09:34,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:09:34,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:09:34,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:09:34,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:09:34,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34" (1/1) ... [2022-02-20 17:09:34,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34" (1/1) ... [2022-02-20 17:09:34,280 INFO L137 Inliner]: procedures = 11, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2022-02-20 17:09:34,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:09:34,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:09:34,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:09:34,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:09:34,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34" (1/1) ... [2022-02-20 17:09:34,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34" (1/1) ... [2022-02-20 17:09:34,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34" (1/1) ... [2022-02-20 17:09:34,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34" (1/1) ... [2022-02-20 17:09:34,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34" (1/1) ... [2022-02-20 17:09:34,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34" (1/1) ... [2022-02-20 17:09:34,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34" (1/1) ... [2022-02-20 17:09:34,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:09:34,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:09:34,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:09:34,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:09:34,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34" (1/1) ... [2022-02-20 17:09:34,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:09:34,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:34,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:09:34,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:09:34,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:09:34,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:09:34,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:09:34,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:09:34,415 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:09:34,417 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:09:34,518 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:09:34,523 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:09:34,523 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:09:34,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:09:34 BoogieIcfgContainer [2022-02-20 17:09:34,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:09:34,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:09:34,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:09:34,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:09:34,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:09:34" (1/3) ... [2022-02-20 17:09:34,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a548a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:09:34, skipping insertion in model container [2022-02-20 17:09:34,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:09:34" (2/3) ... [2022-02-20 17:09:34,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a548a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:09:34, skipping insertion in model container [2022-02-20 17:09:34,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:09:34" (3/3) ... [2022-02-20 17:09:34,531 INFO L111 eAbstractionObserver]: Analyzing ICFG linear-inequality-inv-a.c [2022-02-20 17:09:34,535 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:09:34,535 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 17:09:34,572 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:09:34,577 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:09:34,578 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 17:09:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 17:09:34,609 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:34,609 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 17:09:34,610 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:34,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:34,618 INFO L85 PathProgramCache]: Analyzing trace with hash 889577263, now seen corresponding path program 1 times [2022-02-20 17:09:34,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:34,627 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259618523] [2022-02-20 17:09:34,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:34,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:34,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {16#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {16#true} is VALID [2022-02-20 17:09:34,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {16#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {16#true} is VALID [2022-02-20 17:09:34,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {16#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {16#true} is VALID [2022-02-20 17:09:34,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {16#true} assume !true; {17#false} is VALID [2022-02-20 17:09:34,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {17#false} assume main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296; {17#false} is VALID [2022-02-20 17:09:34,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {17#false} assume !false; {17#false} is VALID [2022-02-20 17:09:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:34,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:34,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259618523] [2022-02-20 17:09:34,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259618523] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:09:34,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:09:34,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:09:34,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37446751] [2022-02-20 17:09:34,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:34,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 17:09:34,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:34,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:34,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:34,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:09:34,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:34,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:09:34,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:09:34,866 INFO L87 Difference]: Start difference. First operand has 13 states, 10 states have (on average 1.7) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:34,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:34,904 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-20 17:09:34,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:09:34,905 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 17:09:34,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 27 transitions. [2022-02-20 17:09:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 27 transitions. [2022-02-20 17:09:34,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 27 transitions. [2022-02-20 17:09:34,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:34,955 INFO L225 Difference]: With dead ends: 22 [2022-02-20 17:09:34,955 INFO L226 Difference]: Without dead ends: 10 [2022-02-20 17:09:34,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:09:34,964 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:34,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-20 17:09:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-20 17:09:34,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:34,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 8 states have (on average 1.25) internal successors, (10), 9 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) [2022-02-20 17:09:34,985 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 8 states have (on average 1.25) internal successors, (10), 9 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) [2022-02-20 17:09:34,985 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 8 states have (on average 1.25) internal successors, (10), 9 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) [2022-02-20 17:09:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:34,987 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 17:09:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:09:34,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:34,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:34,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 8 states have (on average 1.25) internal successors, (10), 9 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) Second operand 10 states. [2022-02-20 17:09:34,989 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.25) internal successors, (10), 9 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) Second operand 10 states. [2022-02-20 17:09:34,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:34,995 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 17:09:34,995 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:09:34,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:34,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:34,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:34,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 1.25) internal successors, (10), 9 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) [2022-02-20 17:09:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-02-20 17:09:35,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2022-02-20 17:09:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:35,000 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-02-20 17:09:35,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:09:35,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 17:09:35,001 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:35,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 17:09:35,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:09:35,003 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:35,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:35,007 INFO L85 PathProgramCache]: Analyzing trace with hash 889573419, now seen corresponding path program 1 times [2022-02-20 17:09:35,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:35,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078426387] [2022-02-20 17:09:35,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:35,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:35,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {76#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {76#true} is VALID [2022-02-20 17:09:35,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {76#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {76#true} is VALID [2022-02-20 17:09:35,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {76#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {78#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= |ULTIMATE.start_main_~n~0#1| (* 256 (div |ULTIMATE.start_main_~n~0#1| 256)))))} is VALID [2022-02-20 17:09:35,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {78#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (<= |ULTIMATE.start_main_~n~0#1| (* 256 (div |ULTIMATE.start_main_~n~0#1| 256)))))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {77#false} is VALID [2022-02-20 17:09:35,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {77#false} assume main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296; {77#false} is VALID [2022-02-20 17:09:35,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {77#false} assume !false; {77#false} is VALID [2022-02-20 17:09:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:35,089 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:35,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078426387] [2022-02-20 17:09:35,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078426387] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:09:35,090 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:09:35,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:09:35,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578087308] [2022-02-20 17:09:35,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:09:35,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 17:09:35,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:35,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:35,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:35,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:09:35,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:35,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:09:35,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:09:35,100 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:35,121 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-02-20 17:09:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:09:35,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-02-20 17:09:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-20 17:09:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-02-20 17:09:35,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2022-02-20 17:09:35,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:35,141 INFO L225 Difference]: With dead ends: 17 [2022-02-20 17:09:35,141 INFO L226 Difference]: Without dead ends: 11 [2022-02-20 17:09:35,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:09:35,143 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:35,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:35,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-20 17:09:35,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-20 17:09:35,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:35,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:35,148 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:35,148 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:35,149 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 17:09:35,149 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 17:09:35,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:35,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:35,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-20 17:09:35,150 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-20 17:09:35,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:35,151 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-02-20 17:09:35,151 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 17:09:35,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:35,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:35,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:35,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:35,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-02-20 17:09:35,153 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 6 [2022-02-20 17:09:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:35,154 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-02-20 17:09:35,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:35,154 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-02-20 17:09:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:09:35,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:35,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:35,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:09:35,155 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:35,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:35,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1807024099, now seen corresponding path program 1 times [2022-02-20 17:09:35,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:35,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932743865] [2022-02-20 17:09:35,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:35,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:35,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {135#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-02-20 17:09:35,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {135#true} is VALID [2022-02-20 17:09:35,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {137#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:09:35,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {137#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {138#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} is VALID [2022-02-20 17:09:35,286 INFO L290 TraceCheckUtils]: 4: Hoare triple {138#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {138#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} is VALID [2022-02-20 17:09:35,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {138#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} assume main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296; {136#false} is VALID [2022-02-20 17:09:35,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-02-20 17:09:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:35,288 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:35,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932743865] [2022-02-20 17:09:35,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932743865] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:35,289 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620859221] [2022-02-20 17:09:35,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:35,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:35,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:35,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:35,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:09:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:35,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:09:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:35,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:35,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {135#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-02-20 17:09:35,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {135#true} is VALID [2022-02-20 17:09:35,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {137#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:09:35,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {137#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {151#(= |ULTIMATE.start_main_~s~0#1| (mod |ULTIMATE.start_main_~v~0#1| 256))} is VALID [2022-02-20 17:09:35,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {151#(= |ULTIMATE.start_main_~s~0#1| (mod |ULTIMATE.start_main_~v~0#1| 256))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {151#(= |ULTIMATE.start_main_~s~0#1| (mod |ULTIMATE.start_main_~v~0#1| 256))} is VALID [2022-02-20 17:09:35,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {151#(= |ULTIMATE.start_main_~s~0#1| (mod |ULTIMATE.start_main_~v~0#1| 256))} assume main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296; {136#false} is VALID [2022-02-20 17:09:35,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-02-20 17:09:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:35,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:35,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-02-20 17:09:35,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {164#(not (< (mod |ULTIMATE.start_main_~s~0#1| 4294967296) (mod |ULTIMATE.start_main_~v~0#1| 256)))} assume main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296; {136#false} is VALID [2022-02-20 17:09:35,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {164#(not (< (mod |ULTIMATE.start_main_~s~0#1| 4294967296) (mod |ULTIMATE.start_main_~v~0#1| 256)))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {164#(not (< (mod |ULTIMATE.start_main_~s~0#1| 4294967296) (mod |ULTIMATE.start_main_~v~0#1| 256)))} is VALID [2022-02-20 17:09:35,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {171#(<= (div (+ (- 256) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {164#(not (< (mod |ULTIMATE.start_main_~s~0#1| 4294967296) (mod |ULTIMATE.start_main_~v~0#1| 256)))} is VALID [2022-02-20 17:09:35,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {171#(<= (div (+ (- 256) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1))} is VALID [2022-02-20 17:09:35,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {135#true} is VALID [2022-02-20 17:09:35,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {135#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-02-20 17:09:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:35,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620859221] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:35,857 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:35,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 17:09:35,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713152606] [2022-02-20 17:09:35,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:35,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 7 [2022-02-20 17:09:35,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:35,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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) [2022-02-20 17:09:35,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:35,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:09:35,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:35,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:09:35,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:09:35,873 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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) [2022-02-20 17:09:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:36,007 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-02-20 17:09:36,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:09:36,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 7 [2022-02-20 17:09:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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) [2022-02-20 17:09:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-02-20 17:09:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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) [2022-02-20 17:09:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-02-20 17:09:36,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-02-20 17:09:36,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:36,043 INFO L225 Difference]: With dead ends: 28 [2022-02-20 17:09:36,043 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:09:36,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:09:36,044 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:36,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 19 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:09:36,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:09:36,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2022-02-20 17:09:36,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:36,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 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) [2022-02-20 17:09:36,052 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 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) [2022-02-20 17:09:36,052 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 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) [2022-02-20 17:09:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:36,053 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-02-20 17:09:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-02-20 17:09:36,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:36,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:36,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 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 22 states. [2022-02-20 17:09:36,054 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 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 22 states. [2022-02-20 17:09:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:36,056 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-02-20 17:09:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-02-20 17:09:36,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:36,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:36,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:36,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:36,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 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) [2022-02-20 17:09:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 17:09:36,057 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 7 [2022-02-20 17:09:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:36,058 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 17:09:36,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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) [2022-02-20 17:09:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:09:36,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:09:36,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:36,058 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:36,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:36,259 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 [2022-02-20 17:09:36,259 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:36,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:36,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1384984081, now seen corresponding path program 1 times [2022-02-20 17:09:36,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:36,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089817699] [2022-02-20 17:09:36,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:36,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:36,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {281#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-02-20 17:09:36,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {281#true} is VALID [2022-02-20 17:09:36,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {283#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:09:36,377 INFO L290 TraceCheckUtils]: 3: Hoare triple {283#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {284#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} is VALID [2022-02-20 17:09:36,378 INFO L290 TraceCheckUtils]: 4: Hoare triple {284#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {285#(and (<= |ULTIMATE.start_main_~s~0#1| 510) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:09:36,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#(and (<= |ULTIMATE.start_main_~s~0#1| 510) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {285#(and (<= |ULTIMATE.start_main_~s~0#1| 510) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:09:36,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {285#(and (<= |ULTIMATE.start_main_~s~0#1| 510) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume !(main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296); {285#(and (<= |ULTIMATE.start_main_~s~0#1| 510) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:09:36,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {285#(and (<= |ULTIMATE.start_main_~s~0#1| 510) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume main_~s~0#1 % 4294967296 > 65025; {282#false} is VALID [2022-02-20 17:09:36,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-02-20 17:09:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:36,386 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:36,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089817699] [2022-02-20 17:09:36,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089817699] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:36,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377792818] [2022-02-20 17:09:36,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:36,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:36,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:36,388 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) [2022-02-20 17:09:36,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:09:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:36,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:09:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:36,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:37,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {281#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-02-20 17:09:37,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {281#true} is VALID [2022-02-20 17:09:37,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {283#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:09:37,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {283#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {284#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} is VALID [2022-02-20 17:09:37,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {284#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {285#(and (<= |ULTIMATE.start_main_~s~0#1| 510) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:09:37,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#(and (<= |ULTIMATE.start_main_~s~0#1| 510) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {285#(and (<= |ULTIMATE.start_main_~s~0#1| 510) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:09:37,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {285#(and (<= |ULTIMATE.start_main_~s~0#1| 510) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume !(main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296); {285#(and (<= |ULTIMATE.start_main_~s~0#1| 510) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:09:37,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {285#(and (<= |ULTIMATE.start_main_~s~0#1| 510) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume main_~s~0#1 % 4294967296 > 65025; {282#false} is VALID [2022-02-20 17:09:37,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-02-20 17:09:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:37,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:39,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-02-20 17:09:39,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {316#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} assume main_~s~0#1 % 4294967296 > 65025; {282#false} is VALID [2022-02-20 17:09:39,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {316#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} assume !(main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296); {316#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} is VALID [2022-02-20 17:09:39,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {316#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {316#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} is VALID [2022-02-20 17:09:39,259 INFO L290 TraceCheckUtils]: 4: Hoare triple {326#(<= (div (+ 64770 (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 4294967296)) 4294967296) 1))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {316#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} is VALID [2022-02-20 17:09:39,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {330#(<= (div (+ (- 4294902781) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 3 (div (+ (- 8589934592) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {326#(<= (div (+ 64770 (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 4294967296)) 4294967296) 1))} is VALID [2022-02-20 17:09:39,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {330#(<= (div (+ (- 4294902781) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 3 (div (+ (- 8589934592) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} is VALID [2022-02-20 17:09:39,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {281#true} is VALID [2022-02-20 17:09:39,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {281#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-02-20 17:09:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:39,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377792818] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:39,265 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:39,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-02-20 17:09:39,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806664212] [2022-02-20 17:09:39,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:39,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:09:39,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:39,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) [2022-02-20 17:09:39,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:39,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:09:39,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:39,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:09:39,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:09:39,324 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) [2022-02-20 17:09:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:39,482 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 17:09:39,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:09:39,483 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:09:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) [2022-02-20 17:09:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-02-20 17:09:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) [2022-02-20 17:09:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-02-20 17:09:39,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-02-20 17:09:39,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:39,543 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:09:39,543 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 17:09:39,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:09:39,545 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:39,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 20 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:09:39,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 17:09:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-02-20 17:09:39,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:39,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:39,564 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:39,565 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:39,566 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-20 17:09:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 17:09:39,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:39,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:39,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 17:09:39,567 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-20 17:09:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:39,568 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-20 17:09:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 17:09:39,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:39,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:39,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:39,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-02-20 17:09:39,570 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 9 [2022-02-20 17:09:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:39,570 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-20 17:09:39,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) [2022-02-20 17:09:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-20 17:09:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:09:39,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:39,571 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:39,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:39,771 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 [2022-02-20 17:09:39,772 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:39,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:39,772 INFO L85 PathProgramCache]: Analyzing trace with hash -13631957, now seen corresponding path program 2 times [2022-02-20 17:09:39,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:39,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727474814] [2022-02-20 17:09:39,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:39,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:39,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {432#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {432#true} is VALID [2022-02-20 17:09:39,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {432#true} is VALID [2022-02-20 17:09:39,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {434#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:09:39,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {434#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {435#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} is VALID [2022-02-20 17:09:39,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {435#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {436#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} is VALID [2022-02-20 17:09:39,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {436#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {437#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} is VALID [2022-02-20 17:09:39,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {438#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} is VALID [2022-02-20 17:09:39,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {438#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} is VALID [2022-02-20 17:09:39,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} assume main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296; {433#false} is VALID [2022-02-20 17:09:39,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {433#false} assume !false; {433#false} is VALID [2022-02-20 17:09:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:39,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:39,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727474814] [2022-02-20 17:09:39,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727474814] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:39,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010300459] [2022-02-20 17:09:39,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:09:39,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:39,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:39,894 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) [2022-02-20 17:09:39,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:09:39,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:09:39,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:39,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:09:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:39,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:41,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {432#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {432#true} is VALID [2022-02-20 17:09:41,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {432#true} is VALID [2022-02-20 17:09:41,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {434#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:09:41,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {434#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {435#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} is VALID [2022-02-20 17:09:41,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {435#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {436#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} is VALID [2022-02-20 17:09:41,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {436#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {437#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} is VALID [2022-02-20 17:09:41,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {460#(and (<= |ULTIMATE.start_main_~s~0#1| (+ 765 (mod |ULTIMATE.start_main_~v~0#1| 256))) (<= (mod |ULTIMATE.start_main_~v~0#1| 256) |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:09:41,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#(and (<= |ULTIMATE.start_main_~s~0#1| (+ 765 (mod |ULTIMATE.start_main_~v~0#1| 256))) (<= (mod |ULTIMATE.start_main_~v~0#1| 256) |ULTIMATE.start_main_~s~0#1|))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {460#(and (<= |ULTIMATE.start_main_~s~0#1| (+ 765 (mod |ULTIMATE.start_main_~v~0#1| 256))) (<= (mod |ULTIMATE.start_main_~v~0#1| 256) |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:09:41,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {460#(and (<= |ULTIMATE.start_main_~s~0#1| (+ 765 (mod |ULTIMATE.start_main_~v~0#1| 256))) (<= (mod |ULTIMATE.start_main_~v~0#1| 256) |ULTIMATE.start_main_~s~0#1|))} assume main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296; {433#false} is VALID [2022-02-20 17:09:41,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {433#false} assume !false; {433#false} is VALID [2022-02-20 17:09:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:41,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:44,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {433#false} assume !false; {433#false} is VALID [2022-02-20 17:09:44,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {473#(not (< (mod |ULTIMATE.start_main_~s~0#1| 4294967296) (mod |ULTIMATE.start_main_~v~0#1| 256)))} assume main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296; {433#false} is VALID [2022-02-20 17:09:44,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {473#(not (< (mod |ULTIMATE.start_main_~s~0#1| 4294967296) (mod |ULTIMATE.start_main_~v~0#1| 256)))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {473#(not (< (mod |ULTIMATE.start_main_~s~0#1| 4294967296) (mod |ULTIMATE.start_main_~v~0#1| 256)))} is VALID [2022-02-20 17:09:44,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {480#(<= (div (+ (- 256) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {473#(not (< (mod |ULTIMATE.start_main_~s~0#1| 4294967296) (mod |ULTIMATE.start_main_~v~0#1| 256)))} is VALID [2022-02-20 17:09:44,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {484#(<= (div (+ (- 4294967807) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 4294967296)) 4294967296) 3))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {480#(<= (div (+ (- 256) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1))} is VALID [2022-02-20 17:09:44,540 INFO L290 TraceCheckUtils]: 4: Hoare triple {488#(<= (div (+ (- 8589935358) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {484#(<= (div (+ (- 4294967807) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 4294967296)) 4294967296) 3))} is VALID [2022-02-20 17:09:44,546 INFO L290 TraceCheckUtils]: 3: Hoare triple {492#(<= (div (+ (- 12884902909) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 12884901888)) 4294967296) 7))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {488#(<= (div (+ (- 8589935358) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} is VALID [2022-02-20 17:09:44,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {492#(<= (div (+ (- 12884902909) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 12884901888)) 4294967296) 7))} is VALID [2022-02-20 17:09:44,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {432#true} is VALID [2022-02-20 17:09:44,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {432#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {432#true} is VALID [2022-02-20 17:09:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:44,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010300459] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:44,547 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:44,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 17:09:44,548 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073631440] [2022-02-20 17:09:44,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:44,548 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 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 [2022-02-20 17:09:44,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:44,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:44,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:44,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:09:44,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:44,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:09:44,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:09:44,678 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:45,060 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-02-20 17:09:45,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 17:09:45,060 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 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 [2022-02-20 17:09:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:45,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:45,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2022-02-20 17:09:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2022-02-20 17:09:45,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 45 transitions. [2022-02-20 17:09:45,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:45,116 INFO L225 Difference]: With dead ends: 40 [2022-02-20 17:09:45,116 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 17:09:45,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2022-02-20 17:09:45,118 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 36 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:45,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 32 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:09:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 17:09:45,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 21. [2022-02-20 17:09:45,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:45,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 21 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:45,153 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 21 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:45,153 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 21 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:45,155 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-02-20 17:09:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-02-20 17:09:45,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:45,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:45,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states. [2022-02-20 17:09:45,156 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 36 states. [2022-02-20 17:09:45,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:45,157 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-02-20 17:09:45,157 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-02-20 17:09:45,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:45,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:45,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:45,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-02-20 17:09:45,159 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2022-02-20 17:09:45,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:45,163 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-20 17:09:45,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 17:09:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:09:45,165 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:45,165 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:45,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:45,383 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 [2022-02-20 17:09:45,383 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:45,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:45,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1963737105, now seen corresponding path program 2 times [2022-02-20 17:09:45,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:45,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970329573] [2022-02-20 17:09:45,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:45,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:45,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {672#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {672#true} is VALID [2022-02-20 17:09:45,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {672#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {672#true} is VALID [2022-02-20 17:09:45,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {672#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {674#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:09:45,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {674#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {675#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} is VALID [2022-02-20 17:09:45,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {675#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {676#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} is VALID [2022-02-20 17:09:45,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {676#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {677#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} is VALID [2022-02-20 17:09:45,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {677#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {678#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} is VALID [2022-02-20 17:09:45,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {678#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {679#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} is VALID [2022-02-20 17:09:45,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {680#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:09:45,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {680#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {680#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:09:45,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {680#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume !(main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296); {680#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:09:45,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {680#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume main_~s~0#1 % 4294967296 > 65025; {673#false} is VALID [2022-02-20 17:09:45,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {673#false} assume !false; {673#false} is VALID [2022-02-20 17:09:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:45,605 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:45,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970329573] [2022-02-20 17:09:45,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970329573] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:45,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659927531] [2022-02-20 17:09:45,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:09:45,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:45,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:45,612 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) [2022-02-20 17:09:45,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:09:45,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:09:45,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:45,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 17:09:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:45,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:46,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {672#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {672#true} is VALID [2022-02-20 17:09:46,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {672#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {672#true} is VALID [2022-02-20 17:09:46,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {672#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {674#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:09:46,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {674#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {675#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} is VALID [2022-02-20 17:09:46,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {675#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {676#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} is VALID [2022-02-20 17:09:46,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {676#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {677#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} is VALID [2022-02-20 17:09:46,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {677#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {678#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} is VALID [2022-02-20 17:09:46,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {678#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {679#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} is VALID [2022-02-20 17:09:46,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {680#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:09:46,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {680#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {680#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:09:46,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {680#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume !(main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296); {680#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:09:46,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {680#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume main_~s~0#1 % 4294967296 > 65025; {673#false} is VALID [2022-02-20 17:09:46,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {673#false} assume !false; {673#false} is VALID [2022-02-20 17:09:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:46,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:09:54,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {673#false} assume !false; {673#false} is VALID [2022-02-20 17:09:54,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {723#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} assume main_~s~0#1 % 4294967296 > 65025; {673#false} is VALID [2022-02-20 17:09:54,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {723#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} assume !(main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296); {723#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} is VALID [2022-02-20 17:09:54,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {723#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {723#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} is VALID [2022-02-20 17:09:54,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {733#(<= (div (+ 64770 (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 4294967296)) 4294967296) 1))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {723#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} is VALID [2022-02-20 17:09:54,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {737#(<= (div (+ (- 4294902781) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 3 (div (+ (- 8589934592) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {733#(<= (div (+ 64770 (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 4294967296)) 4294967296) 1))} is VALID [2022-02-20 17:09:54,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {741#(<= (div (+ (- 8589870332) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 12884901888)) 4294967296) 5))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {737#(<= (div (+ (- 4294902781) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 3 (div (+ (- 8589934592) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} is VALID [2022-02-20 17:09:54,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {745#(<= (div (+ (- 12884837883) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {741#(<= (div (+ (- 8589870332) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 12884901888)) 4294967296) 5))} is VALID [2022-02-20 17:09:54,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {749#(<= (div (+ (- 17179805434) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 21474836480)) 4294967296) 9))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {745#(<= (div (+ (- 12884837883) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} is VALID [2022-02-20 17:09:54,159 INFO L290 TraceCheckUtils]: 3: Hoare triple {753#(<= (div (+ (- 21474772985) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 25769803776)) 4294967296) 11))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {749#(<= (div (+ (- 17179805434) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 21474836480)) 4294967296) 9))} is VALID [2022-02-20 17:09:54,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {672#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {753#(<= (div (+ (- 21474772985) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 25769803776)) 4294967296) 11))} is VALID [2022-02-20 17:09:54,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {672#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {672#true} is VALID [2022-02-20 17:09:54,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {672#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {672#true} is VALID [2022-02-20 17:09:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:54,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659927531] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:09:54,160 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:09:54,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-02-20 17:09:54,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857663087] [2022-02-20 17:09:54,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:09:54,161 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 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) Word has length 13 [2022-02-20 17:09:54,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:09:54,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 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) [2022-02-20 17:09:54,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:54,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 17:09:54,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:09:54,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 17:09:54,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:09:54,248 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 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) [2022-02-20 17:09:54,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:54,533 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-02-20 17:09:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 17:09:54,534 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 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) Word has length 13 [2022-02-20 17:09:54,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:09:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 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) [2022-02-20 17:09:54,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 53 transitions. [2022-02-20 17:09:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 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) [2022-02-20 17:09:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 53 transitions. [2022-02-20 17:09:54,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 53 transitions. [2022-02-20 17:09:54,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:09:54,632 INFO L225 Difference]: With dead ends: 42 [2022-02-20 17:09:54,632 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:09:54,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-02-20 17:09:54,633 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 29 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:09:54,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 22 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:09:54,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:09:54,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 17:09:54,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:09:54,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:54,679 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:54,679 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:54,680 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-02-20 17:09:54,680 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-02-20 17:09:54,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:54,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:54,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 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 28 states. [2022-02-20 17:09:54,681 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 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 28 states. [2022-02-20 17:09:54,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:09:54,682 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-02-20 17:09:54,682 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-02-20 17:09:54,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:09:54,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:09:54,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:09:54,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:09:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:09:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-02-20 17:09:54,683 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 13 [2022-02-20 17:09:54,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:09:54,683 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-02-20 17:09:54,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 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) [2022-02-20 17:09:54,684 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-02-20 17:09:54,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:09:54,684 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:09:54,684 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-02-20 17:09:54,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:09:54,891 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 [2022-02-20 17:09:54,891 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:09:54,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:09:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1418863403, now seen corresponding path program 3 times [2022-02-20 17:09:54,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:09:54,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889998811] [2022-02-20 17:09:54,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:09:54,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:09:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:55,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {915#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {915#true} is VALID [2022-02-20 17:09:55,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {915#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {915#true} is VALID [2022-02-20 17:09:55,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {915#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {917#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:09:55,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {917#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {918#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} is VALID [2022-02-20 17:09:55,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {918#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {919#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} is VALID [2022-02-20 17:09:55,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {919#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {920#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} is VALID [2022-02-20 17:09:55,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {920#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {921#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} is VALID [2022-02-20 17:09:55,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {921#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {922#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} is VALID [2022-02-20 17:09:55,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {922#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {923#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:09:55,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {923#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {924#(and (<= |ULTIMATE.start_main_~s~0#1| 1785) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:09:55,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {924#(and (<= |ULTIMATE.start_main_~s~0#1| 1785) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {925#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2040))} is VALID [2022-02-20 17:09:55,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {925#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2040))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {926#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2295))} is VALID [2022-02-20 17:09:55,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {926#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2295))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {927#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} is VALID [2022-02-20 17:09:55,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {927#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {927#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} is VALID [2022-02-20 17:09:55,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {927#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} assume main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296; {916#false} is VALID [2022-02-20 17:09:55,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {916#false} assume !false; {916#false} is VALID [2022-02-20 17:09:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:55,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:09:55,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889998811] [2022-02-20 17:09:55,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889998811] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:09:55,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764814938] [2022-02-20 17:09:55,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:09:55,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:09:55,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:09:55,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:09:55,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:09:55,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 17:09:55,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:09:55,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 17:09:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:09:55,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:09:57,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {915#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {915#true} is VALID [2022-02-20 17:09:57,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {915#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {915#true} is VALID [2022-02-20 17:09:57,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {915#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {917#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:09:57,555 INFO L290 TraceCheckUtils]: 3: Hoare triple {917#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {918#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} is VALID [2022-02-20 17:09:57,556 INFO L290 TraceCheckUtils]: 4: Hoare triple {918#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {919#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} is VALID [2022-02-20 17:09:57,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {919#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {920#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} is VALID [2022-02-20 17:09:57,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {920#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {921#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} is VALID [2022-02-20 17:09:57,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {921#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {922#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} is VALID [2022-02-20 17:09:57,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {922#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {923#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:09:57,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {923#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {924#(and (<= |ULTIMATE.start_main_~s~0#1| 1785) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:09:57,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {924#(and (<= |ULTIMATE.start_main_~s~0#1| 1785) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {925#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2040))} is VALID [2022-02-20 17:09:57,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {925#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2040))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {926#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2295))} is VALID [2022-02-20 17:09:57,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {926#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2295))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {967#(and (<= |ULTIMATE.start_main_~s~0#1| (+ 2295 (mod |ULTIMATE.start_main_~v~0#1| 256))) (<= (mod |ULTIMATE.start_main_~v~0#1| 256) |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:09:57,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {967#(and (<= |ULTIMATE.start_main_~s~0#1| (+ 2295 (mod |ULTIMATE.start_main_~v~0#1| 256))) (<= (mod |ULTIMATE.start_main_~v~0#1| 256) |ULTIMATE.start_main_~s~0#1|))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {967#(and (<= |ULTIMATE.start_main_~s~0#1| (+ 2295 (mod |ULTIMATE.start_main_~v~0#1| 256))) (<= (mod |ULTIMATE.start_main_~v~0#1| 256) |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:09:57,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {967#(and (<= |ULTIMATE.start_main_~s~0#1| (+ 2295 (mod |ULTIMATE.start_main_~v~0#1| 256))) (<= (mod |ULTIMATE.start_main_~v~0#1| 256) |ULTIMATE.start_main_~s~0#1|))} assume main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296; {916#false} is VALID [2022-02-20 17:09:57,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {916#false} assume !false; {916#false} is VALID [2022-02-20 17:09:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:09:57,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:10:06,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {916#false} assume !false; {916#false} is VALID [2022-02-20 17:10:06,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {980#(not (< (mod |ULTIMATE.start_main_~s~0#1| 4294967296) (mod |ULTIMATE.start_main_~v~0#1| 256)))} assume main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296; {916#false} is VALID [2022-02-20 17:10:06,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {980#(not (< (mod |ULTIMATE.start_main_~s~0#1| 4294967296) (mod |ULTIMATE.start_main_~v~0#1| 256)))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {980#(not (< (mod |ULTIMATE.start_main_~s~0#1| 4294967296) (mod |ULTIMATE.start_main_~v~0#1| 256)))} is VALID [2022-02-20 17:10:06,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {987#(<= (div (+ (- 256) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {980#(not (< (mod |ULTIMATE.start_main_~s~0#1| 4294967296) (mod |ULTIMATE.start_main_~v~0#1| 256)))} is VALID [2022-02-20 17:10:06,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {991#(<= (div (+ (- 4294967807) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 4294967296)) 4294967296) 3))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {987#(<= (div (+ (- 256) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1))} is VALID [2022-02-20 17:10:06,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {995#(<= (div (+ (- 8589935358) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {991#(<= (div (+ (- 4294967807) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 4294967296)) 4294967296) 3))} is VALID [2022-02-20 17:10:06,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#(<= (div (+ (- 12884902909) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 12884901888)) 4294967296) 7))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {995#(<= (div (+ (- 8589935358) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 5 (div (+ (- 8589934592) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} is VALID [2022-02-20 17:10:06,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {1003#(<= (div (+ (- 17179870460) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ (- 17179869184) |ULTIMATE.start_main_~s~0#1|) 4294967296) 9))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {999#(<= (div (+ (- 12884902909) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 12884901888)) 4294967296) 7))} is VALID [2022-02-20 17:10:06,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {1007#(<= (div (+ (- 21474838011) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 21474836480)) 4294967296) 11))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1003#(<= (div (+ (- 17179870460) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ (- 17179869184) |ULTIMATE.start_main_~s~0#1|) 4294967296) 9))} is VALID [2022-02-20 17:10:06,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {1011#(<= (div (+ (- 25769805562) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 25769803776)) 4294967296) 13))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1007#(<= (div (+ (- 21474838011) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 21474836480)) 4294967296) 11))} is VALID [2022-02-20 17:10:06,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {1015#(<= (div (+ (- 30064773113) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 15 (div (+ |ULTIMATE.start_main_~s~0#1| (- 30064771072)) 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1011#(<= (div (+ (- 25769805562) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 25769803776)) 4294967296) 13))} is VALID [2022-02-20 17:10:06,922 INFO L290 TraceCheckUtils]: 4: Hoare triple {1019#(<= (div (+ (- 34359740664) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 17 (div (+ |ULTIMATE.start_main_~s~0#1| (- 34359738368)) 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1015#(<= (div (+ (- 30064773113) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 15 (div (+ |ULTIMATE.start_main_~s~0#1| (- 30064771072)) 4294967296)))} is VALID [2022-02-20 17:10:06,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {1023#(<= (div (+ (- 38654708215) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 19 (div (+ |ULTIMATE.start_main_~s~0#1| (- 38654705664)) 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1019#(<= (div (+ (- 34359740664) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 17 (div (+ |ULTIMATE.start_main_~s~0#1| (- 34359738368)) 4294967296)))} is VALID [2022-02-20 17:10:06,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {915#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {1023#(<= (div (+ (- 38654708215) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 19 (div (+ |ULTIMATE.start_main_~s~0#1| (- 38654705664)) 4294967296)))} is VALID [2022-02-20 17:10:06,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {915#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {915#true} is VALID [2022-02-20 17:10:06,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {915#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {915#true} is VALID [2022-02-20 17:10:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:06,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764814938] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:10:06,966 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:10:06,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 17:10:06,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359585624] [2022-02-20 17:10:06,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:10:06,967 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 17:10:06,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:06,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:07,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:07,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 17:10:07,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:07,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 17:10:07,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=350, Unknown=0, NotChecked=0, Total=600 [2022-02-20 17:10:07,177 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:08,167 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-02-20 17:10:08,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 17:10:08,167 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 17:10:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 81 transitions. [2022-02-20 17:10:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 81 transitions. [2022-02-20 17:10:08,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 81 transitions. [2022-02-20 17:10:08,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:08,324 INFO L225 Difference]: With dead ends: 70 [2022-02-20 17:10:08,325 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 17:10:08,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=750, Invalid=1230, Unknown=0, NotChecked=0, Total=1980 [2022-02-20 17:10:08,326 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 104 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:08,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 38 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:10:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 17:10:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 33. [2022-02-20 17:10:08,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:08,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 33 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:08,381 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 33 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:08,381 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 33 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:08,383 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-02-20 17:10:08,383 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-02-20 17:10:08,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:08,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:08,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 64 states. [2022-02-20 17:10:08,384 INFO L87 Difference]: Start difference. First operand has 33 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 64 states. [2022-02-20 17:10:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:08,386 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-02-20 17:10:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-02-20 17:10:08,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:08,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:08,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:08,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-02-20 17:10:08,388 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 16 [2022-02-20 17:10:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:08,388 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-02-20 17:10:08,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:08,389 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-02-20 17:10:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 17:10:08,389 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:08,389 INFO L514 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:08,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:10:08,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:08,594 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:08,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:08,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1090479121, now seen corresponding path program 3 times [2022-02-20 17:10:08,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:08,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273059960] [2022-02-20 17:10:08,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:08,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:08,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {1349#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1349#true} is VALID [2022-02-20 17:10:08,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {1349#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1349#true} is VALID [2022-02-20 17:10:08,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {1349#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {1351#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:10:08,927 INFO L290 TraceCheckUtils]: 3: Hoare triple {1351#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1352#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} is VALID [2022-02-20 17:10:08,928 INFO L290 TraceCheckUtils]: 4: Hoare triple {1352#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1353#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} is VALID [2022-02-20 17:10:08,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {1353#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1354#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} is VALID [2022-02-20 17:10:08,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {1354#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1355#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} is VALID [2022-02-20 17:10:08,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {1355#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1356#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} is VALID [2022-02-20 17:10:08,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {1356#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1357#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:08,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {1357#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1358#(and (<= |ULTIMATE.start_main_~s~0#1| 1785) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:08,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {1358#(and (<= |ULTIMATE.start_main_~s~0#1| 1785) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1359#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2040))} is VALID [2022-02-20 17:10:08,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {1359#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2040))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1360#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2295))} is VALID [2022-02-20 17:10:08,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {1360#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2295))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1361#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2550))} is VALID [2022-02-20 17:10:08,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {1361#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2550))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1362#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2805))} is VALID [2022-02-20 17:10:08,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {1362#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2805))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1363#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 3060))} is VALID [2022-02-20 17:10:08,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {1363#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 3060))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1364#(and (<= |ULTIMATE.start_main_~s~0#1| 3315) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:08,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {1364#(and (<= |ULTIMATE.start_main_~s~0#1| 3315) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1365#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:10:08,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {1365#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {1365#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:10:08,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {1365#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume !(main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296); {1365#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:10:08,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {1365#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume main_~s~0#1 % 4294967296 > 65025; {1350#false} is VALID [2022-02-20 17:10:08,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {1350#false} assume !false; {1350#false} is VALID [2022-02-20 17:10:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:08,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:08,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273059960] [2022-02-20 17:10:08,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273059960] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:10:08,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549750072] [2022-02-20 17:10:08,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:10:08,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:08,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:08,938 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:10:08,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 17:10:09,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-02-20 17:10:09,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:10:09,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 17:10:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:09,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:10:11,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {1349#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1349#true} is VALID [2022-02-20 17:10:11,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {1349#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1349#true} is VALID [2022-02-20 17:10:11,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {1349#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {1351#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:10:11,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {1351#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1352#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} is VALID [2022-02-20 17:10:11,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {1352#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1353#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} is VALID [2022-02-20 17:10:11,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {1353#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1354#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} is VALID [2022-02-20 17:10:11,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {1354#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1355#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} is VALID [2022-02-20 17:10:11,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {1355#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1356#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} is VALID [2022-02-20 17:10:11,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {1356#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1357#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:11,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {1357#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1358#(and (<= |ULTIMATE.start_main_~s~0#1| 1785) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:11,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {1358#(and (<= |ULTIMATE.start_main_~s~0#1| 1785) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1359#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2040))} is VALID [2022-02-20 17:10:11,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {1359#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2040))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1360#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2295))} is VALID [2022-02-20 17:10:11,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {1360#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2295))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1361#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2550))} is VALID [2022-02-20 17:10:11,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {1361#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2550))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1362#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2805))} is VALID [2022-02-20 17:10:11,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {1362#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2805))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1363#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 3060))} is VALID [2022-02-20 17:10:11,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {1363#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 3060))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1364#(and (<= |ULTIMATE.start_main_~s~0#1| 3315) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:11,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {1364#(and (<= |ULTIMATE.start_main_~s~0#1| 3315) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1365#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:10:11,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {1365#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {1365#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:10:11,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {1365#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume !(main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296); {1365#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} is VALID [2022-02-20 17:10:11,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {1365#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (not (<= (+ (div |ULTIMATE.start_main_~s~0#1| 4294967296) 1) 0)))} assume main_~s~0#1 % 4294967296 > 65025; {1350#false} is VALID [2022-02-20 17:10:11,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {1350#false} assume !false; {1350#false} is VALID [2022-02-20 17:10:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:11,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:10:34,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {1350#false} assume !false; {1350#false} is VALID [2022-02-20 17:10:34,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {1432#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} assume main_~s~0#1 % 4294967296 > 65025; {1350#false} is VALID [2022-02-20 17:10:34,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {1432#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} assume !(main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296); {1432#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} is VALID [2022-02-20 17:10:34,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {1432#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {1432#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} is VALID [2022-02-20 17:10:34,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {1442#(<= (div (+ 64770 (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 4294967296)) 4294967296) 1))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1432#(not (< 65025 (mod |ULTIMATE.start_main_~s~0#1| 4294967296)))} is VALID [2022-02-20 17:10:34,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {1446#(<= (div (+ (- 4294902781) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 3 (div (+ (- 8589934592) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1442#(<= (div (+ 64770 (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 4294967296)) 4294967296) 1))} is VALID [2022-02-20 17:10:34,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {1450#(<= (div (+ (- 8589870332) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 12884901888)) 4294967296) 5))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1446#(<= (div (+ (- 4294902781) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 3 (div (+ (- 8589934592) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} is VALID [2022-02-20 17:10:34,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {1454#(<= (div (+ (- 12884837883) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1450#(<= (div (+ (- 8589870332) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 12884901888)) 4294967296) 5))} is VALID [2022-02-20 17:10:34,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {1458#(<= (div (+ (- 17179805434) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 21474836480)) 4294967296) 9))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1454#(<= (div (+ (- 12884837883) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 7 (div (+ (- 17179869184) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} is VALID [2022-02-20 17:10:34,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {1462#(<= (div (+ (- 21474772985) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 25769803776)) 4294967296) 11))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1458#(<= (div (+ (- 17179805434) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 21474836480)) 4294967296) 9))} is VALID [2022-02-20 17:10:34,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {1466#(<= (div (+ (- 25769740536) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 30064771072)) 4294967296) 13))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1462#(<= (div (+ (- 21474772985) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 25769803776)) 4294967296) 11))} is VALID [2022-02-20 17:10:34,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {1470#(<= (div (+ (- 30064708087) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 15 (div (+ |ULTIMATE.start_main_~s~0#1| (- 34359738368)) 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1466#(<= (div (+ (- 25769740536) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 30064771072)) 4294967296) 13))} is VALID [2022-02-20 17:10:34,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {1474#(<= (div (+ (- 34359675638) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 38654705664)) 4294967296) 17))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1470#(<= (div (+ (- 30064708087) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 15 (div (+ |ULTIMATE.start_main_~s~0#1| (- 34359738368)) 4294967296)))} is VALID [2022-02-20 17:10:34,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {1478#(<= (div (+ (- 38654643189) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1474#(<= (div (+ (- 34359675638) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 38654705664)) 4294967296) 17))} is VALID [2022-02-20 17:10:34,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {1482#(<= (div (+ (- 42949610740) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 21 (div (+ |ULTIMATE.start_main_~s~0#1| (- 47244640256)) 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1478#(<= (div (+ (- 38654643189) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 19 (div (+ (- 42949672960) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} is VALID [2022-02-20 17:10:34,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {1486#(<= (div (+ (* (- 1) |ULTIMATE.start_main_~s~0#1|) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1482#(<= (div (+ (- 42949610740) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ 21 (div (+ |ULTIMATE.start_main_~s~0#1| (- 47244640256)) 4294967296)))} is VALID [2022-02-20 17:10:34,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {1490#(<= (div (+ (- 51539545842) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ (- 55834574848) |ULTIMATE.start_main_~s~0#1|) 4294967296) 25))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1486#(<= (div (+ (* (- 1) |ULTIMATE.start_main_~s~0#1|) (- 47244578291)) (- 4294967296)) (+ 23 (div (+ (- 51539607552) |ULTIMATE.start_main_~s~0#1|) 4294967296)))} is VALID [2022-02-20 17:10:34,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {1494#(<= (div (+ (- 55834513393) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 60129542144)) 4294967296) 27))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1490#(<= (div (+ (- 51539545842) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ (- 55834574848) |ULTIMATE.start_main_~s~0#1|) 4294967296) 25))} is VALID [2022-02-20 17:10:34,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {1349#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {1494#(<= (div (+ (- 55834513393) (* (- 1) |ULTIMATE.start_main_~s~0#1|)) (- 4294967296)) (+ (div (+ |ULTIMATE.start_main_~s~0#1| (- 60129542144)) 4294967296) 27))} is VALID [2022-02-20 17:10:34,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {1349#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1349#true} is VALID [2022-02-20 17:10:34,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {1349#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1349#true} is VALID [2022-02-20 17:10:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:34,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549750072] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:10:34,409 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:10:34,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2022-02-20 17:10:34,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137794549] [2022-02-20 17:10:34,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:10:34,409 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 17:10:34,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:10:34,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:34,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:34,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-02-20 17:10:34,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:10:34,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-20 17:10:34,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2022-02-20 17:10:34,588 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 32 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:35,484 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-02-20 17:10:35,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-20 17:10:35,484 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 17:10:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:10:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 97 transitions. [2022-02-20 17:10:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 97 transitions. [2022-02-20 17:10:35,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 97 transitions. [2022-02-20 17:10:35,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:10:35,628 INFO L225 Difference]: With dead ends: 74 [2022-02-20 17:10:35,628 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:10:35,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 15 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2022-02-20 17:10:35,630 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 75 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:10:35,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 41 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 17:10:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:10:35,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-02-20 17:10:35,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:10:35,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 41 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:35,698 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 41 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:35,698 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 41 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:35,699 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-02-20 17:10:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2022-02-20 17:10:35,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:35,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:35,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 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 48 states. [2022-02-20 17:10:35,700 INFO L87 Difference]: Start difference. First operand has 41 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 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 48 states. [2022-02-20 17:10:35,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:10:35,702 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-02-20 17:10:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2022-02-20 17:10:35,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:10:35,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:10:35,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:10:35,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:10:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-02-20 17:10:35,704 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 21 [2022-02-20 17:10:35,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:10:35,704 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-02-20 17:10:35,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:10:35,705 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-02-20 17:10:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:10:35,705 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:10:35,705 INFO L514 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1] [2022-02-20 17:10:35,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 17:10:35,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:35,911 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:10:35,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:10:35,911 INFO L85 PathProgramCache]: Analyzing trace with hash 559361323, now seen corresponding path program 4 times [2022-02-20 17:10:35,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:10:35,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240436116] [2022-02-20 17:10:35,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:10:35,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:10:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:36,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {1776#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1776#true} is VALID [2022-02-20 17:10:36,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {1776#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1776#true} is VALID [2022-02-20 17:10:36,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {1776#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {1778#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:10:36,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {1778#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1779#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} is VALID [2022-02-20 17:10:36,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {1779#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1780#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} is VALID [2022-02-20 17:10:36,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {1780#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1781#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} is VALID [2022-02-20 17:10:36,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {1781#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1782#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} is VALID [2022-02-20 17:10:36,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {1782#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1783#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} is VALID [2022-02-20 17:10:36,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {1783#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1784#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:36,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {1784#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1785#(and (<= |ULTIMATE.start_main_~s~0#1| 1785) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:36,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {1785#(and (<= |ULTIMATE.start_main_~s~0#1| 1785) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1786#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2040))} is VALID [2022-02-20 17:10:36,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {1786#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2040))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1787#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2295))} is VALID [2022-02-20 17:10:36,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {1787#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2295))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1788#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2550))} is VALID [2022-02-20 17:10:36,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {1788#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2550))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1789#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2805))} is VALID [2022-02-20 17:10:36,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {1789#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2805))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1790#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 3060))} is VALID [2022-02-20 17:10:36,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {1790#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 3060))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1791#(and (<= |ULTIMATE.start_main_~s~0#1| 3315) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:36,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {1791#(and (<= |ULTIMATE.start_main_~s~0#1| 3315) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1792#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:36,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {1792#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1793#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 3825))} is VALID [2022-02-20 17:10:36,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {1793#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 3825))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1794#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 4080))} is VALID [2022-02-20 17:10:36,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {1794#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 4080))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1795#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 4335))} is VALID [2022-02-20 17:10:36,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {1795#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 4335))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1796#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 4590))} is VALID [2022-02-20 17:10:36,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {1796#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 4590))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1797#(and (<= |ULTIMATE.start_main_~s~0#1| 4845) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:36,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {1797#(and (<= |ULTIMATE.start_main_~s~0#1| 4845) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1798#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 5100))} is VALID [2022-02-20 17:10:36,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {1798#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 5100))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1799#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 5355))} is VALID [2022-02-20 17:10:36,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {1799#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 5355))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1800#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} is VALID [2022-02-20 17:10:36,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {1800#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {1800#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} is VALID [2022-02-20 17:10:36,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {1800#(and (<= |ULTIMATE.start_main_~v~0#1| (+ (* (div |ULTIMATE.start_main_~v~0#1| 256) 256) |ULTIMATE.start_main_~s~0#1|)) (<= (div |ULTIMATE.start_main_~s~0#1| 4294967296) 0))} assume main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296; {1777#false} is VALID [2022-02-20 17:10:36,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {1777#false} assume !false; {1777#false} is VALID [2022-02-20 17:10:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:36,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:10:36,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240436116] [2022-02-20 17:10:36,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240436116] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:10:36,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395353640] [2022-02-20 17:10:36,407 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:10:36,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:10:36,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:10:36,408 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:10:36,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 17:10:36,518 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:10:36,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:10:36,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 47 conjunts are in the unsatisfiable core [2022-02-20 17:10:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:10:36,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:10:40,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {1776#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3); {1776#true} is VALID [2022-02-20 17:10:40,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {1776#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~pre6#1, main_~n~0#1, main_~v~0#1, main_~s~0#1, main_~i~0#1;main_~n~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1776#true} is VALID [2022-02-20 17:10:40,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {1776#true} assume !(0 == main_~n~0#1 % 256);main_~v~0#1 := 0;main_~s~0#1 := 0;main_~i~0#1 := 0; {1778#(= |ULTIMATE.start_main_~s~0#1| 0)} is VALID [2022-02-20 17:10:40,323 INFO L290 TraceCheckUtils]: 3: Hoare triple {1778#(= |ULTIMATE.start_main_~s~0#1| 0)} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1779#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} is VALID [2022-02-20 17:10:40,323 INFO L290 TraceCheckUtils]: 4: Hoare triple {1779#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 255))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1780#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} is VALID [2022-02-20 17:10:40,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {1780#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 510))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1781#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} is VALID [2022-02-20 17:10:40,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {1781#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 765))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1782#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} is VALID [2022-02-20 17:10:40,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {1782#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1020))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1783#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} is VALID [2022-02-20 17:10:40,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {1783#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 1275))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1784#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:40,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {1784#(and (<= |ULTIMATE.start_main_~s~0#1| 1530) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1785#(and (<= |ULTIMATE.start_main_~s~0#1| 1785) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:40,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {1785#(and (<= |ULTIMATE.start_main_~s~0#1| 1785) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1786#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2040))} is VALID [2022-02-20 17:10:40,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {1786#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2040))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1787#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2295))} is VALID [2022-02-20 17:10:40,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {1787#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2295))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1788#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2550))} is VALID [2022-02-20 17:10:40,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {1788#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2550))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1789#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2805))} is VALID [2022-02-20 17:10:40,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {1789#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 2805))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1790#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 3060))} is VALID [2022-02-20 17:10:40,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {1790#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 3060))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1791#(and (<= |ULTIMATE.start_main_~s~0#1| 3315) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:40,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {1791#(and (<= |ULTIMATE.start_main_~s~0#1| 3315) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1792#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:40,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {1792#(and (<= |ULTIMATE.start_main_~s~0#1| 3570) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1793#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 3825))} is VALID [2022-02-20 17:10:40,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {1793#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 3825))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1794#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 4080))} is VALID [2022-02-20 17:10:40,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {1794#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 4080))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1795#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 4335))} is VALID [2022-02-20 17:10:40,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {1795#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 4335))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1796#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 4590))} is VALID [2022-02-20 17:10:40,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {1796#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 4590))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1797#(and (<= |ULTIMATE.start_main_~s~0#1| 4845) (<= 0 |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:40,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {1797#(and (<= |ULTIMATE.start_main_~s~0#1| 4845) (<= 0 |ULTIMATE.start_main_~s~0#1|))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1798#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 5100))} is VALID [2022-02-20 17:10:40,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {1798#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 5100))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1799#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 5355))} is VALID [2022-02-20 17:10:40,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {1799#(and (<= 0 |ULTIMATE.start_main_~s~0#1|) (<= |ULTIMATE.start_main_~s~0#1| 5355))} assume !!(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296);main_~v~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~s~0#1 := main_~s~0#1 + main_~v~0#1 % 256;main_#t~pre6#1 := 1 + main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;havoc main_#t~pre6#1; {1876#(and (<= |ULTIMATE.start_main_~s~0#1| (+ 5355 (mod |ULTIMATE.start_main_~v~0#1| 256))) (<= (mod |ULTIMATE.start_main_~v~0#1| 256) |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:40,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {1876#(and (<= |ULTIMATE.start_main_~s~0#1| (+ 5355 (mod |ULTIMATE.start_main_~v~0#1| 256))) (<= (mod |ULTIMATE.start_main_~v~0#1| 256) |ULTIMATE.start_main_~s~0#1|))} assume !(main_~i~0#1 % 4294967296 < main_~n~0#1 % 256 % 4294967296); {1876#(and (<= |ULTIMATE.start_main_~s~0#1| (+ 5355 (mod |ULTIMATE.start_main_~v~0#1| 256))) (<= (mod |ULTIMATE.start_main_~v~0#1| 256) |ULTIMATE.start_main_~s~0#1|))} is VALID [2022-02-20 17:10:40,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {1876#(and (<= |ULTIMATE.start_main_~s~0#1| (+ 5355 (mod |ULTIMATE.start_main_~v~0#1| 256))) (<= (mod |ULTIMATE.start_main_~v~0#1| 256) |ULTIMATE.start_main_~s~0#1|))} assume main_~s~0#1 % 4294967296 < main_~v~0#1 % 256 % 4294967296; {1777#false} is VALID [2022-02-20 17:10:40,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {1777#false} assume !false; {1777#false} is VALID [2022-02-20 17:10:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:10:40,342 INFO L328 TraceCheckSpWp]: Computing backward predicates...