./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.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 17200794a032bba2db2aeb0a7bad82e54f6bbef5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:12:49,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:12:49,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:12:49,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:12:49,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:12:49,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:12:49,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:12:49,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:12:49,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:12:49,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:12:49,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:12:49,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:12:49,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:12:49,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:12:49,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:12:49,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:12:49,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:12:49,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:12:49,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:12:49,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:12:49,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:12:49,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:12:49,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:12:49,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:12:49,950 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:12:49,950 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:12:49,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:12:49,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:12:49,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:12:49,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:12:49,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:12:49,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:12:49,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:12:49,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:12:49,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:12:49,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:12:49,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:12:49,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:12:49,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:12:49,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:12:49,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:12:49,973 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 14:12:49,999 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:12:49,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:12:50,000 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:12:50,000 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:12:50,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:12:50,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:12:50,002 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:12:50,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:12:50,002 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:12:50,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:12:50,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:12:50,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:12:50,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:12:50,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:12:50,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:12:50,004 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:12:50,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:12:50,004 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:12:50,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:12:50,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:12:50,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:12:50,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:12:50,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:12:50,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:12:50,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:12:50,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:12:50,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:12:50,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:12:50,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:12:50,005 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:12:50,005 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 -> 17200794a032bba2db2aeb0a7bad82e54f6bbef5 [2021-09-13 14:12:50,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:12:50,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:12:50,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:12:50,311 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:12:50,311 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:12:50,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c [2021-09-13 14:12:50,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee2690f0f/0b96cf4f0bae4cd292e85d2016671b97/FLAG70e6439b5 [2021-09-13 14:12:50,803 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:12:50,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c [2021-09-13 14:12:50,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee2690f0f/0b96cf4f0bae4cd292e85d2016671b97/FLAG70e6439b5 [2021-09-13 14:12:50,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee2690f0f/0b96cf4f0bae4cd292e85d2016671b97 [2021-09-13 14:12:50,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:12:50,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:12:50,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:12:50,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:12:50,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:12:50,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:12:50" (1/1) ... [2021-09-13 14:12:50,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428da7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:50, skipping insertion in model container [2021-09-13 14:12:50,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:12:50" (1/1) ... [2021-09-13 14:12:50,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:12:50,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:12:50,956 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c[319,332] [2021-09-13 14:12:50,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:12:50,971 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:12:51,018 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c[319,332] [2021-09-13 14:12:51,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:12:51,036 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:12:51,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:51 WrapperNode [2021-09-13 14:12:51,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:12:51,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:12:51,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:12:51,038 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:12:51,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:51" (1/1) ... [2021-09-13 14:12:51,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:51" (1/1) ... [2021-09-13 14:12:51,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:12:51,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:12:51,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:12:51,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:12:51,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:51" (1/1) ... [2021-09-13 14:12:51,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:51" (1/1) ... [2021-09-13 14:12:51,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:51" (1/1) ... [2021-09-13 14:12:51,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:51" (1/1) ... [2021-09-13 14:12:51,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:51" (1/1) ... [2021-09-13 14:12:51,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:51" (1/1) ... [2021-09-13 14:12:51,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:51" (1/1) ... [2021-09-13 14:12:51,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:12:51,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:12:51,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:12:51,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:12:51,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:51" (1/1) ... [2021-09-13 14:12:51,086 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:12:51,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:51,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-13 14:12:51,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-13 14:12:51,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:12:51,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:12:51,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:12:51,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:12:51,370 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:12:51,371 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-09-13 14:12:51,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:12:51 BoogieIcfgContainer [2021-09-13 14:12:51,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:12:51,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:12:51,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:12:51,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:12:51,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:12:50" (1/3) ... [2021-09-13 14:12:51,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a0ec48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:12:51, skipping insertion in model container [2021-09-13 14:12:51,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:12:51" (2/3) ... [2021-09-13 14:12:51,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a0ec48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:12:51, skipping insertion in model container [2021-09-13 14:12:51,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:12:51" (3/3) ... [2021-09-13 14:12:51,385 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.c [2021-09-13 14:12:51,390 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:12:51,390 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-09-13 14:12:51,439 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:12:51,447 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-09-13 14:12:51,448 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-09-13 14:12:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-09-13 14:12:51,479 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:51,479 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-09-13 14:12:51,480 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:51,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:51,485 INFO L82 PathProgramCache]: Analyzing trace with hash 889937703, now seen corresponding path program 1 times [2021-09-13 14:12:51,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:51,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954165397] [2021-09-13 14:12:51,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:51,495 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:51,678 INFO L281 TraceCheckUtils]: 0: Hoare triple {15#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {15#true} is VALID [2021-09-13 14:12:51,679 INFO L281 TraceCheckUtils]: 1: Hoare triple {15#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {15#true} is VALID [2021-09-13 14:12:51,680 INFO L281 TraceCheckUtils]: 2: Hoare triple {15#true} assume !true; {16#false} is VALID [2021-09-13 14:12:51,680 INFO L281 TraceCheckUtils]: 3: Hoare triple {16#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16#false} is VALID [2021-09-13 14:12:51,680 INFO L281 TraceCheckUtils]: 4: Hoare triple {16#false} assume 0 == __VERIFIER_assert_~cond; {16#false} is VALID [2021-09-13 14:12:51,680 INFO L281 TraceCheckUtils]: 5: Hoare triple {16#false} assume !false; {16#false} is VALID [2021-09-13 14:12:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:51,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:51,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954165397] [2021-09-13 14:12:51,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954165397] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:12:51,683 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:12:51,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:12:51,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392571698] [2021-09-13 14:12:51,689 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 [2021-09-13 14:12:51,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:51,692 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) [2021-09-13 14:12:51,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:51,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:12:51,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:51,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:12:51,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:12:51,720 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 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) [2021-09-13 14:12:51,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:51,761 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2021-09-13 14:12:51,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:12:51,762 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 [2021-09-13 14:12:51,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:51,763 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) [2021-09-13 14:12:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2021-09-13 14:12:51,767 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) [2021-09-13 14:12:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2021-09-13 14:12:51,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 23 transitions. [2021-09-13 14:12:51,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:51,819 INFO L225 Difference]: With dead ends: 20 [2021-09-13 14:12:51,819 INFO L226 Difference]: Without dead ends: 8 [2021-09-13 14:12:51,825 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.05ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:12:51,833 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.32ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.52ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:51,835 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 13 Unknown, 0 Unchecked, 0.32ms Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 13.52ms Time] [2021-09-13 14:12:51,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-09-13 14:12:51,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-09-13 14:12:51,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:51,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:51,867 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:51,868 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:51,871 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2021-09-13 14:12:51,871 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-09-13 14:12:51,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:51,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:51,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states. [2021-09-13 14:12:51,872 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states. [2021-09-13 14:12:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:51,876 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2021-09-13 14:12:51,876 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-09-13 14:12:51,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:51,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:51,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:51,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-09-13 14:12:51,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2021-09-13 14:12:51,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:51,884 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-09-13 14:12:51,885 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) [2021-09-13 14:12:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-09-13 14:12:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-09-13 14:12:51,886 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:51,886 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-09-13 14:12:51,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:12:51,888 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:51,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:51,890 INFO L82 PathProgramCache]: Analyzing trace with hash 889639793, now seen corresponding path program 1 times [2021-09-13 14:12:51,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:51,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126305950] [2021-09-13 14:12:51,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:51,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:52,002 INFO L281 TraceCheckUtils]: 0: Hoare triple {67#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {67#true} is VALID [2021-09-13 14:12:52,003 INFO L281 TraceCheckUtils]: 1: Hoare triple {67#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {69#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:52,004 INFO L281 TraceCheckUtils]: 2: Hoare triple {69#(= ULTIMATE.start_main_~x~0 0)} assume !(main_~x~0 % 4294967296 < 100000000); {68#false} is VALID [2021-09-13 14:12:52,005 INFO L281 TraceCheckUtils]: 3: Hoare triple {68#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {68#false} is VALID [2021-09-13 14:12:52,005 INFO L281 TraceCheckUtils]: 4: Hoare triple {68#false} assume 0 == __VERIFIER_assert_~cond; {68#false} is VALID [2021-09-13 14:12:52,005 INFO L281 TraceCheckUtils]: 5: Hoare triple {68#false} assume !false; {68#false} is VALID [2021-09-13 14:12:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:52,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:52,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126305950] [2021-09-13 14:12:52,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126305950] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:12:52,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:12:52,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-13 14:12:52,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569220574] [2021-09-13 14:12:52,011 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 [2021-09-13 14:12:52,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:52,012 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) [2021-09-13 14:12:52,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:52,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-13 14:12:52,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:52,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-13 14:12:52,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-13 14:12:52,027 INFO L87 Difference]: Start difference. First operand 8 states and 9 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) [2021-09-13 14:12:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:52,079 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2021-09-13 14:12:52,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-13 14:12:52,080 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 [2021-09-13 14:12:52,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:52,080 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) [2021-09-13 14:12:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2021-09-13 14:12:52,091 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) [2021-09-13 14:12:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2021-09-13 14:12:52,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 20 transitions. [2021-09-13 14:12:52,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:52,120 INFO L225 Difference]: With dead ends: 16 [2021-09-13 14:12:52,121 INFO L226 Difference]: Without dead ends: 10 [2021-09-13 14:12:52,121 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.09ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-13 14:12:52,123 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.42ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.43ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:52,124 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 18 Unknown, 0 Unchecked, 0.42ms Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 25.43ms Time] [2021-09-13 14:12:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2021-09-13 14:12:52,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-09-13 14:12:52,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:52,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:52,134 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:52,135 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:52,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:52,136 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2021-09-13 14:12:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2021-09-13 14:12:52,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:52,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:52,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 10 states. [2021-09-13 14:12:52,144 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 10 states. [2021-09-13 14:12:52,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:52,146 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2021-09-13 14:12:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2021-09-13 14:12:52,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:52,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:52,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:52,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-09-13 14:12:52,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2021-09-13 14:12:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:52,150 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-09-13 14:12:52,151 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) [2021-09-13 14:12:52,152 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2021-09-13 14:12:52,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-09-13 14:12:52,153 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:52,153 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:52,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-13 14:12:52,154 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:52,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:52,154 INFO L82 PathProgramCache]: Analyzing trace with hash 295691924, now seen corresponding path program 1 times [2021-09-13 14:12:52,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:52,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985360314] [2021-09-13 14:12:52,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:52,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:52,275 INFO L281 TraceCheckUtils]: 0: Hoare triple {123#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {123#true} is VALID [2021-09-13 14:12:52,275 INFO L281 TraceCheckUtils]: 1: Hoare triple {123#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {125#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:52,276 INFO L281 TraceCheckUtils]: 2: Hoare triple {125#(= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 % 4294967296 < 100000000); {125#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:52,277 INFO L281 TraceCheckUtils]: 3: Hoare triple {125#(= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {126#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 1))} is VALID [2021-09-13 14:12:52,278 INFO L281 TraceCheckUtils]: 4: Hoare triple {126#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 1))} assume !(main_~x~0 % 4294967296 < 100000000); {124#false} is VALID [2021-09-13 14:12:52,278 INFO L281 TraceCheckUtils]: 5: Hoare triple {124#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {124#false} is VALID [2021-09-13 14:12:52,278 INFO L281 TraceCheckUtils]: 6: Hoare triple {124#false} assume 0 == __VERIFIER_assert_~cond; {124#false} is VALID [2021-09-13 14:12:52,278 INFO L281 TraceCheckUtils]: 7: Hoare triple {124#false} assume !false; {124#false} is VALID [2021-09-13 14:12:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:52,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:52,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985360314] [2021-09-13 14:12:52,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985360314] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:12:52,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332167488] [2021-09-13 14:12:52,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:52,280 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:52,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:52,284 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:12:52,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-09-13 14:12:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:52,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:12:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:52,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:52,419 INFO L281 TraceCheckUtils]: 0: Hoare triple {123#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {123#true} is VALID [2021-09-13 14:12:52,420 INFO L281 TraceCheckUtils]: 1: Hoare triple {123#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {125#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:52,421 INFO L281 TraceCheckUtils]: 2: Hoare triple {125#(= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 % 4294967296 < 100000000); {125#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:52,422 INFO L281 TraceCheckUtils]: 3: Hoare triple {125#(= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {139#(= ULTIMATE.start_main_~x~0 1)} is VALID [2021-09-13 14:12:52,423 INFO L281 TraceCheckUtils]: 4: Hoare triple {139#(= ULTIMATE.start_main_~x~0 1)} assume !(main_~x~0 % 4294967296 < 100000000); {124#false} is VALID [2021-09-13 14:12:52,423 INFO L281 TraceCheckUtils]: 5: Hoare triple {124#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {124#false} is VALID [2021-09-13 14:12:52,424 INFO L281 TraceCheckUtils]: 6: Hoare triple {124#false} assume 0 == __VERIFIER_assert_~cond; {124#false} is VALID [2021-09-13 14:12:52,424 INFO L281 TraceCheckUtils]: 7: Hoare triple {124#false} assume !false; {124#false} is VALID [2021-09-13 14:12:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:52,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:12:52,514 INFO L281 TraceCheckUtils]: 7: Hoare triple {124#false} assume !false; {124#false} is VALID [2021-09-13 14:12:52,515 INFO L281 TraceCheckUtils]: 6: Hoare triple {124#false} assume 0 == __VERIFIER_assert_~cond; {124#false} is VALID [2021-09-13 14:12:52,515 INFO L281 TraceCheckUtils]: 5: Hoare triple {124#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {124#false} is VALID [2021-09-13 14:12:52,516 INFO L281 TraceCheckUtils]: 4: Hoare triple {161#(< (mod ULTIMATE.start_main_~x~0 4294967296) 100000000)} assume !(main_~x~0 % 4294967296 < 100000000); {124#false} is VALID [2021-09-13 14:12:52,517 INFO L281 TraceCheckUtils]: 3: Hoare triple {165#(< (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296) 100000000)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {161#(< (mod ULTIMATE.start_main_~x~0 4294967296) 100000000)} is VALID [2021-09-13 14:12:52,518 INFO L281 TraceCheckUtils]: 2: Hoare triple {165#(< (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296) 100000000)} assume !!(main_~x~0 % 4294967296 < 100000000); {165#(< (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296) 100000000)} is VALID [2021-09-13 14:12:52,518 INFO L281 TraceCheckUtils]: 1: Hoare triple {123#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {165#(< (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296) 100000000)} is VALID [2021-09-13 14:12:52,519 INFO L281 TraceCheckUtils]: 0: Hoare triple {123#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {123#true} is VALID [2021-09-13 14:12:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:52,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332167488] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:12:52,519 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-09-13 14:12:52,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-09-13 14:12:52,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022690632] [2021-09-13 14:12:52,521 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 8 [2021-09-13 14:12:52,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:52,522 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) [2021-09-13 14:12:52,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:52,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 14:12:52,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:52,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 14:12:52,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:12:52,539 INFO L87 Difference]: Start difference. First operand 10 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) [2021-09-13 14:12:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:52,680 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2021-09-13 14:12:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:12:52,680 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 8 [2021-09-13 14:12:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:52,680 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) [2021-09-13 14:12:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2021-09-13 14:12:52,681 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) [2021-09-13 14:12:52,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2021-09-13 14:12:52,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2021-09-13 14:12:52,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:52,749 INFO L225 Difference]: With dead ends: 20 [2021-09-13 14:12:52,749 INFO L226 Difference]: Without dead ends: 14 [2021-09-13 14:12:52,749 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 42.56ms TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:12:52,750 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.56ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.03ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:52,750 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 1.56ms Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 44.03ms Time] [2021-09-13 14:12:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-09-13 14:12:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2021-09-13 14:12:52,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:52,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:52,756 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:52,756 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:52,757 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2021-09-13 14:12:52,757 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-09-13 14:12:52,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:52,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:52,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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) Second operand 14 states. [2021-09-13 14:12:52,758 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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) Second operand 14 states. [2021-09-13 14:12:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:52,759 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2021-09-13 14:12:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-09-13 14:12:52,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:52,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:52,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:52,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-09-13 14:12:52,760 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2021-09-13 14:12:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:52,760 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-09-13 14:12:52,761 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) [2021-09-13 14:12:52,761 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-09-13 14:12:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-13 14:12:52,761 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:52,768 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:52,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-09-13 14:12:52,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:52,970 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:52,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:52,970 INFO L82 PathProgramCache]: Analyzing trace with hash 572634524, now seen corresponding path program 1 times [2021-09-13 14:12:52,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:52,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52637428] [2021-09-13 14:12:52,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:52,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:53,069 INFO L281 TraceCheckUtils]: 0: Hoare triple {246#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {246#true} is VALID [2021-09-13 14:12:53,070 INFO L281 TraceCheckUtils]: 1: Hoare triple {246#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {248#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:53,070 INFO L281 TraceCheckUtils]: 2: Hoare triple {248#(= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 % 4294967296 < 100000000); {248#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:53,071 INFO L281 TraceCheckUtils]: 3: Hoare triple {248#(= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {249#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:53,072 INFO L281 TraceCheckUtils]: 4: Hoare triple {249#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {249#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:53,072 INFO L281 TraceCheckUtils]: 5: Hoare triple {249#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {250#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:12:53,073 INFO L281 TraceCheckUtils]: 6: Hoare triple {250#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 2))} assume !!(main_~x~0 % 4294967296 < 100000000); {250#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:12:53,074 INFO L281 TraceCheckUtils]: 7: Hoare triple {250#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 2))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {247#false} is VALID [2021-09-13 14:12:53,074 INFO L281 TraceCheckUtils]: 8: Hoare triple {247#false} assume !(main_~x~0 % 4294967296 < 100000000); {247#false} is VALID [2021-09-13 14:12:53,074 INFO L281 TraceCheckUtils]: 9: Hoare triple {247#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {247#false} is VALID [2021-09-13 14:12:53,074 INFO L281 TraceCheckUtils]: 10: Hoare triple {247#false} assume 0 == __VERIFIER_assert_~cond; {247#false} is VALID [2021-09-13 14:12:53,075 INFO L281 TraceCheckUtils]: 11: Hoare triple {247#false} assume !false; {247#false} is VALID [2021-09-13 14:12:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:53,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:53,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52637428] [2021-09-13 14:12:53,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52637428] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:12:53,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702832811] [2021-09-13 14:12:53,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:53,076 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:53,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:53,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:12:53,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-09-13 14:12:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:53,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:12:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:53,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:53,435 INFO L281 TraceCheckUtils]: 0: Hoare triple {246#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {246#true} is VALID [2021-09-13 14:12:53,436 INFO L281 TraceCheckUtils]: 1: Hoare triple {246#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {248#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:53,438 INFO L281 TraceCheckUtils]: 2: Hoare triple {248#(= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 % 4294967296 < 100000000); {248#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:53,438 INFO L281 TraceCheckUtils]: 3: Hoare triple {248#(= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {249#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:53,440 INFO L281 TraceCheckUtils]: 4: Hoare triple {249#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {249#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:53,445 INFO L281 TraceCheckUtils]: 5: Hoare triple {249#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {269#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:12:53,446 INFO L281 TraceCheckUtils]: 6: Hoare triple {269#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume !!(main_~x~0 % 4294967296 < 100000000); {269#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:12:53,449 INFO L281 TraceCheckUtils]: 7: Hoare triple {269#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {276#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} is VALID [2021-09-13 14:12:53,450 INFO L281 TraceCheckUtils]: 8: Hoare triple {276#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} assume !(main_~x~0 % 4294967296 < 100000000); {276#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} is VALID [2021-09-13 14:12:53,450 INFO L281 TraceCheckUtils]: 9: Hoare triple {276#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {283#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:12:53,451 INFO L281 TraceCheckUtils]: 10: Hoare triple {283#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {247#false} is VALID [2021-09-13 14:12:53,451 INFO L281 TraceCheckUtils]: 11: Hoare triple {247#false} assume !false; {247#false} is VALID [2021-09-13 14:12:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:53,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:12:53,633 INFO L281 TraceCheckUtils]: 11: Hoare triple {247#false} assume !false; {247#false} is VALID [2021-09-13 14:12:53,634 INFO L281 TraceCheckUtils]: 10: Hoare triple {283#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {247#false} is VALID [2021-09-13 14:12:53,635 INFO L281 TraceCheckUtils]: 9: Hoare triple {296#(= (mod ULTIMATE.start_main_~x~0 2) 0)} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {283#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:12:53,635 INFO L281 TraceCheckUtils]: 8: Hoare triple {296#(= (mod ULTIMATE.start_main_~x~0 2) 0)} assume !(main_~x~0 % 4294967296 < 100000000); {296#(= (mod ULTIMATE.start_main_~x~0 2) 0)} is VALID [2021-09-13 14:12:53,636 INFO L281 TraceCheckUtils]: 7: Hoare triple {296#(= (mod ULTIMATE.start_main_~x~0 2) 0)} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {296#(= (mod ULTIMATE.start_main_~x~0 2) 0)} is VALID [2021-09-13 14:12:53,636 INFO L281 TraceCheckUtils]: 6: Hoare triple {296#(= (mod ULTIMATE.start_main_~x~0 2) 0)} assume !!(main_~x~0 % 4294967296 < 100000000); {296#(= (mod ULTIMATE.start_main_~x~0 2) 0)} is VALID [2021-09-13 14:12:53,637 INFO L281 TraceCheckUtils]: 5: Hoare triple {309#(= (mod (+ ULTIMATE.start_main_~x~0 1) 2) 0)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {296#(= (mod ULTIMATE.start_main_~x~0 2) 0)} is VALID [2021-09-13 14:12:53,638 INFO L281 TraceCheckUtils]: 4: Hoare triple {309#(= (mod (+ ULTIMATE.start_main_~x~0 1) 2) 0)} assume !!(main_~x~0 % 4294967296 < 100000000); {309#(= (mod (+ ULTIMATE.start_main_~x~0 1) 2) 0)} is VALID [2021-09-13 14:12:53,638 INFO L281 TraceCheckUtils]: 3: Hoare triple {296#(= (mod ULTIMATE.start_main_~x~0 2) 0)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {309#(= (mod (+ ULTIMATE.start_main_~x~0 1) 2) 0)} is VALID [2021-09-13 14:12:53,639 INFO L281 TraceCheckUtils]: 2: Hoare triple {296#(= (mod ULTIMATE.start_main_~x~0 2) 0)} assume !!(main_~x~0 % 4294967296 < 100000000); {296#(= (mod ULTIMATE.start_main_~x~0 2) 0)} is VALID [2021-09-13 14:12:53,639 INFO L281 TraceCheckUtils]: 1: Hoare triple {246#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {296#(= (mod ULTIMATE.start_main_~x~0 2) 0)} is VALID [2021-09-13 14:12:53,639 INFO L281 TraceCheckUtils]: 0: Hoare triple {246#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {246#true} is VALID [2021-09-13 14:12:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-09-13 14:12:53,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702832811] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:12:53,643 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-09-13 14:12:53,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 10 [2021-09-13 14:12:53,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282990267] [2021-09-13 14:12:53,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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 12 [2021-09-13 14:12:53,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:53,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:53,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:53,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:12:53,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:53,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:12:53,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:12:53,669 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:53,883 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-09-13 14:12:53,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:12:53,883 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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 12 [2021-09-13 14:12:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2021-09-13 14:12:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2021-09-13 14:12:53,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2021-09-13 14:12:53,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:53,913 INFO L225 Difference]: With dead ends: 27 [2021-09-13 14:12:53,913 INFO L226 Difference]: Without dead ends: 18 [2021-09-13 14:12:53,913 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 71.18ms TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:12:53,914 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 105.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.63ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 108.19ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:53,914 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 98 Unknown, 0 Unchecked, 1.63ms Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 108.19ms Time] [2021-09-13 14:12:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-09-13 14:12:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-09-13 14:12:53,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:53,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 16 states have (on average 1.1875) 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) [2021-09-13 14:12:53,927 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 16 states have (on average 1.1875) 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) [2021-09-13 14:12:53,927 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 16 states have (on average 1.1875) 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) [2021-09-13 14:12:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:53,928 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2021-09-13 14:12:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2021-09-13 14:12:53,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:53,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:53,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.1875) 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. [2021-09-13 14:12:53,929 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.1875) 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. [2021-09-13 14:12:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:53,931 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2021-09-13 14:12:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2021-09-13 14:12:53,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:53,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:53,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:53,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:53,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) 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) [2021-09-13 14:12:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-09-13 14:12:53,933 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2021-09-13 14:12:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:53,933 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-09-13 14:12:53,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:53,933 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-09-13 14:12:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 14:12:53,934 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:53,934 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:53,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-09-13 14:12:54,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-09-13 14:12:54,145 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:54,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:54,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1176853889, now seen corresponding path program 2 times [2021-09-13 14:12:54,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:54,146 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182580338] [2021-09-13 14:12:54,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:54,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:54,228 INFO L281 TraceCheckUtils]: 0: Hoare triple {421#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {421#true} is VALID [2021-09-13 14:12:54,229 INFO L281 TraceCheckUtils]: 1: Hoare triple {421#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {423#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:54,229 INFO L281 TraceCheckUtils]: 2: Hoare triple {423#(= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 % 4294967296 < 100000000); {423#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:54,230 INFO L281 TraceCheckUtils]: 3: Hoare triple {423#(= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {424#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:54,231 INFO L281 TraceCheckUtils]: 4: Hoare triple {424#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {424#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:54,231 INFO L281 TraceCheckUtils]: 5: Hoare triple {424#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {425#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:12:54,232 INFO L281 TraceCheckUtils]: 6: Hoare triple {425#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume !!(main_~x~0 % 4294967296 < 100000000); {425#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:12:54,233 INFO L281 TraceCheckUtils]: 7: Hoare triple {425#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {426#(and (<= ULTIMATE.start_main_~x~0 3) (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)))} is VALID [2021-09-13 14:12:54,233 INFO L281 TraceCheckUtils]: 8: Hoare triple {426#(and (<= ULTIMATE.start_main_~x~0 3) (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)))} assume !!(main_~x~0 % 4294967296 < 100000000); {426#(and (<= ULTIMATE.start_main_~x~0 3) (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)))} is VALID [2021-09-13 14:12:54,234 INFO L281 TraceCheckUtils]: 9: Hoare triple {426#(and (<= ULTIMATE.start_main_~x~0 3) (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {422#false} is VALID [2021-09-13 14:12:54,234 INFO L281 TraceCheckUtils]: 10: Hoare triple {422#false} assume !(main_~x~0 % 4294967296 < 100000000); {422#false} is VALID [2021-09-13 14:12:54,234 INFO L281 TraceCheckUtils]: 11: Hoare triple {422#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {422#false} is VALID [2021-09-13 14:12:54,234 INFO L281 TraceCheckUtils]: 12: Hoare triple {422#false} assume 0 == __VERIFIER_assert_~cond; {422#false} is VALID [2021-09-13 14:12:54,234 INFO L281 TraceCheckUtils]: 13: Hoare triple {422#false} assume !false; {422#false} is VALID [2021-09-13 14:12:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:54,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:54,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182580338] [2021-09-13 14:12:54,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182580338] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:12:54,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798523957] [2021-09-13 14:12:54,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:12:54,236 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:54,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:54,241 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:12:54,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-09-13 14:12:54,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:12:54,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:12:54,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:12:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:54,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:54,560 INFO L281 TraceCheckUtils]: 0: Hoare triple {421#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {421#true} is VALID [2021-09-13 14:12:54,560 INFO L281 TraceCheckUtils]: 1: Hoare triple {421#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {423#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:54,561 INFO L281 TraceCheckUtils]: 2: Hoare triple {423#(= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 % 4294967296 < 100000000); {423#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:54,561 INFO L281 TraceCheckUtils]: 3: Hoare triple {423#(= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {424#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:54,562 INFO L281 TraceCheckUtils]: 4: Hoare triple {424#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {424#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:54,563 INFO L281 TraceCheckUtils]: 5: Hoare triple {424#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {425#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:12:54,563 INFO L281 TraceCheckUtils]: 6: Hoare triple {425#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume !!(main_~x~0 % 4294967296 < 100000000); {425#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:12:54,564 INFO L281 TraceCheckUtils]: 7: Hoare triple {425#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {451#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:54,564 INFO L281 TraceCheckUtils]: 8: Hoare triple {451#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {451#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:54,565 INFO L281 TraceCheckUtils]: 9: Hoare triple {451#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {458#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:54,566 INFO L281 TraceCheckUtils]: 10: Hoare triple {458#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} assume !(main_~x~0 % 4294967296 < 100000000); {422#false} is VALID [2021-09-13 14:12:54,566 INFO L281 TraceCheckUtils]: 11: Hoare triple {422#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {422#false} is VALID [2021-09-13 14:12:54,566 INFO L281 TraceCheckUtils]: 12: Hoare triple {422#false} assume 0 == __VERIFIER_assert_~cond; {422#false} is VALID [2021-09-13 14:12:54,566 INFO L281 TraceCheckUtils]: 13: Hoare triple {422#false} assume !false; {422#false} is VALID [2021-09-13 14:12:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:54,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:12:54,733 INFO L281 TraceCheckUtils]: 13: Hoare triple {422#false} assume !false; {422#false} is VALID [2021-09-13 14:12:54,733 INFO L281 TraceCheckUtils]: 12: Hoare triple {422#false} assume 0 == __VERIFIER_assert_~cond; {422#false} is VALID [2021-09-13 14:12:54,733 INFO L281 TraceCheckUtils]: 11: Hoare triple {422#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {422#false} is VALID [2021-09-13 14:12:54,734 INFO L281 TraceCheckUtils]: 10: Hoare triple {480#(< (mod ULTIMATE.start_main_~x~0 4294967296) 100000000)} assume !(main_~x~0 % 4294967296 < 100000000); {422#false} is VALID [2021-09-13 14:12:54,735 INFO L281 TraceCheckUtils]: 9: Hoare triple {484#(< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 100000000)} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {480#(< (mod ULTIMATE.start_main_~x~0 4294967296) 100000000)} is VALID [2021-09-13 14:12:54,735 INFO L281 TraceCheckUtils]: 8: Hoare triple {484#(< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 100000000)} assume !!(main_~x~0 % 4294967296 < 100000000); {484#(< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 100000000)} is VALID [2021-09-13 14:12:54,736 INFO L281 TraceCheckUtils]: 7: Hoare triple {491#(< (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296) 100000000)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {484#(< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 100000000)} is VALID [2021-09-13 14:12:54,739 INFO L281 TraceCheckUtils]: 6: Hoare triple {491#(< (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296) 100000000)} assume !!(main_~x~0 % 4294967296 < 100000000); {491#(< (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296) 100000000)} is VALID [2021-09-13 14:12:54,740 INFO L281 TraceCheckUtils]: 5: Hoare triple {498#(< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 100000000)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {491#(< (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296) 100000000)} is VALID [2021-09-13 14:12:54,740 INFO L281 TraceCheckUtils]: 4: Hoare triple {498#(< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 100000000)} assume !!(main_~x~0 % 4294967296 < 100000000); {498#(< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 100000000)} is VALID [2021-09-13 14:12:54,745 INFO L281 TraceCheckUtils]: 3: Hoare triple {505#(< (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296) 100000000)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {498#(< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 100000000)} is VALID [2021-09-13 14:12:54,745 INFO L281 TraceCheckUtils]: 2: Hoare triple {505#(< (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296) 100000000)} assume !!(main_~x~0 % 4294967296 < 100000000); {505#(< (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296) 100000000)} is VALID [2021-09-13 14:12:54,746 INFO L281 TraceCheckUtils]: 1: Hoare triple {421#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {505#(< (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296) 100000000)} is VALID [2021-09-13 14:12:54,746 INFO L281 TraceCheckUtils]: 0: Hoare triple {421#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {421#true} is VALID [2021-09-13 14:12:54,746 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:12:54,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798523957] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:12:54,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-09-13 14:12:54,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2021-09-13 14:12:54,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82249091] [2021-09-13 14:12:54,748 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 14:12:54,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:54,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:54,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:54,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-09-13 14:12:54,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:54,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-09-13 14:12:54,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:12:54,774 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:55,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:55,229 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2021-09-13 14:12:55,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:12:55,230 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-13 14:12:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2021-09-13 14:12:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2021-09-13 14:12:55,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2021-09-13 14:12:55,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:55,283 INFO L225 Difference]: With dead ends: 37 [2021-09-13 14:12:55,283 INFO L226 Difference]: Without dead ends: 28 [2021-09-13 14:12:55,284 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 173.28ms TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:12:55,284 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 144.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.03ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 146.01ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:55,285 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 140 Unknown, 0 Unchecked, 2.03ms Time], IncrementalHoareTripleChecker [28 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 146.01ms Time] [2021-09-13 14:12:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-09-13 14:12:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2021-09-13 14:12:55,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:55,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:55,303 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:55,303 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:55,304 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-09-13 14:12:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-09-13 14:12:55,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:55,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:55,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2021-09-13 14:12:55,305 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2021-09-13 14:12:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:55,306 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-09-13 14:12:55,307 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-09-13 14:12:55,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:55,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:55,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:55,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-09-13 14:12:55,308 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2021-09-13 14:12:55,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:55,308 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-09-13 14:12:55,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-09-13 14:12:55,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:12:55,309 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:55,309 INFO L513 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:55,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-09-13 14:12:55,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:55,528 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:55,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:55,529 INFO L82 PathProgramCache]: Analyzing trace with hash -495138033, now seen corresponding path program 3 times [2021-09-13 14:12:55,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:55,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778840139] [2021-09-13 14:12:55,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:55,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:55,670 INFO L281 TraceCheckUtils]: 0: Hoare triple {658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {658#true} is VALID [2021-09-13 14:12:55,671 INFO L281 TraceCheckUtils]: 1: Hoare triple {658#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {660#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:55,671 INFO L281 TraceCheckUtils]: 2: Hoare triple {660#(= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 % 4294967296 < 100000000); {660#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:55,673 INFO L281 TraceCheckUtils]: 3: Hoare triple {660#(= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {661#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:55,674 INFO L281 TraceCheckUtils]: 4: Hoare triple {661#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {661#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:55,687 INFO L281 TraceCheckUtils]: 5: Hoare triple {661#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {662#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:12:55,689 INFO L281 TraceCheckUtils]: 6: Hoare triple {662#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume !!(main_~x~0 % 4294967296 < 100000000); {662#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:12:55,689 INFO L281 TraceCheckUtils]: 7: Hoare triple {662#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {663#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:55,693 INFO L281 TraceCheckUtils]: 8: Hoare triple {663#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {663#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:55,694 INFO L281 TraceCheckUtils]: 9: Hoare triple {663#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {664#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} is VALID [2021-09-13 14:12:55,695 INFO L281 TraceCheckUtils]: 10: Hoare triple {664#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} assume !!(main_~x~0 % 4294967296 < 100000000); {664#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} is VALID [2021-09-13 14:12:55,696 INFO L281 TraceCheckUtils]: 11: Hoare triple {664#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {665#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 5))} is VALID [2021-09-13 14:12:55,696 INFO L281 TraceCheckUtils]: 12: Hoare triple {665#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 5))} assume !!(main_~x~0 % 4294967296 < 100000000); {665#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 5))} is VALID [2021-09-13 14:12:55,697 INFO L281 TraceCheckUtils]: 13: Hoare triple {665#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 5))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {659#false} is VALID [2021-09-13 14:12:55,697 INFO L281 TraceCheckUtils]: 14: Hoare triple {659#false} assume !!(main_~x~0 % 4294967296 < 100000000); {659#false} is VALID [2021-09-13 14:12:55,697 INFO L281 TraceCheckUtils]: 15: Hoare triple {659#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {659#false} is VALID [2021-09-13 14:12:55,697 INFO L281 TraceCheckUtils]: 16: Hoare triple {659#false} assume !!(main_~x~0 % 4294967296 < 100000000); {659#false} is VALID [2021-09-13 14:12:55,698 INFO L281 TraceCheckUtils]: 17: Hoare triple {659#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {659#false} is VALID [2021-09-13 14:12:55,698 INFO L281 TraceCheckUtils]: 18: Hoare triple {659#false} assume !(main_~x~0 % 4294967296 < 100000000); {659#false} is VALID [2021-09-13 14:12:55,698 INFO L281 TraceCheckUtils]: 19: Hoare triple {659#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {659#false} is VALID [2021-09-13 14:12:55,700 INFO L281 TraceCheckUtils]: 20: Hoare triple {659#false} assume 0 == __VERIFIER_assert_~cond; {659#false} is VALID [2021-09-13 14:12:55,700 INFO L281 TraceCheckUtils]: 21: Hoare triple {659#false} assume !false; {659#false} is VALID [2021-09-13 14:12:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-09-13 14:12:55,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:55,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778840139] [2021-09-13 14:12:55,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778840139] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:12:55,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579453932] [2021-09-13 14:12:55,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-09-13 14:12:55,702 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:55,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:55,705 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:12:55,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-09-13 14:12:55,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-09-13 14:12:55,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:12:55,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjunts are in the unsatisfiable core [2021-09-13 14:12:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:55,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:56,396 INFO L281 TraceCheckUtils]: 0: Hoare triple {658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {658#true} is VALID [2021-09-13 14:12:56,396 INFO L281 TraceCheckUtils]: 1: Hoare triple {658#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {658#true} is VALID [2021-09-13 14:12:56,397 INFO L281 TraceCheckUtils]: 2: Hoare triple {658#true} assume !!(main_~x~0 % 4294967296 < 100000000); {658#true} is VALID [2021-09-13 14:12:56,397 INFO L281 TraceCheckUtils]: 3: Hoare triple {658#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {658#true} is VALID [2021-09-13 14:12:56,397 INFO L281 TraceCheckUtils]: 4: Hoare triple {658#true} assume !!(main_~x~0 % 4294967296 < 100000000); {658#true} is VALID [2021-09-13 14:12:56,397 INFO L281 TraceCheckUtils]: 5: Hoare triple {658#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {658#true} is VALID [2021-09-13 14:12:56,397 INFO L281 TraceCheckUtils]: 6: Hoare triple {658#true} assume !!(main_~x~0 % 4294967296 < 100000000); {658#true} is VALID [2021-09-13 14:12:56,397 INFO L281 TraceCheckUtils]: 7: Hoare triple {658#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {658#true} is VALID [2021-09-13 14:12:56,398 INFO L281 TraceCheckUtils]: 8: Hoare triple {658#true} assume !!(main_~x~0 % 4294967296 < 100000000); {658#true} is VALID [2021-09-13 14:12:56,398 INFO L281 TraceCheckUtils]: 9: Hoare triple {658#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {658#true} is VALID [2021-09-13 14:12:56,398 INFO L281 TraceCheckUtils]: 10: Hoare triple {658#true} assume !!(main_~x~0 % 4294967296 < 100000000); {658#true} is VALID [2021-09-13 14:12:56,400 INFO L281 TraceCheckUtils]: 11: Hoare triple {658#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {702#(< (mod (+ ULTIMATE.start_main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2021-09-13 14:12:56,400 INFO L281 TraceCheckUtils]: 12: Hoare triple {702#(< (mod (+ ULTIMATE.start_main_~x~0 4294967295) 4294967296) 10000000)} assume !!(main_~x~0 % 4294967296 < 100000000); {702#(< (mod (+ ULTIMATE.start_main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2021-09-13 14:12:56,402 INFO L281 TraceCheckUtils]: 13: Hoare triple {702#(< (mod (+ ULTIMATE.start_main_~x~0 4294967295) 4294967296) 10000000)} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {709#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967293) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967294) 4294967296)))} is VALID [2021-09-13 14:12:56,402 INFO L281 TraceCheckUtils]: 14: Hoare triple {709#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967293) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967294) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {709#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967293) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967294) 4294967296)))} is VALID [2021-09-13 14:12:56,403 INFO L281 TraceCheckUtils]: 15: Hoare triple {709#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967293) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967294) 4294967296)))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {716#(and (<= 10000000 (mod (+ 4294967292 ULTIMATE.start_main_~x~0) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4294967291) 4294967296) 10000000))} is VALID [2021-09-13 14:12:56,404 INFO L281 TraceCheckUtils]: 16: Hoare triple {716#(and (<= 10000000 (mod (+ 4294967292 ULTIMATE.start_main_~x~0) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4294967291) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {716#(and (<= 10000000 (mod (+ 4294967292 ULTIMATE.start_main_~x~0) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4294967291) 4294967296) 10000000))} is VALID [2021-09-13 14:12:56,405 INFO L281 TraceCheckUtils]: 17: Hoare triple {716#(and (<= 10000000 (mod (+ 4294967292 ULTIMATE.start_main_~x~0) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4294967291) 4294967296) 10000000))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {723#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967289) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967290) 4294967296)))} is VALID [2021-09-13 14:12:56,406 INFO L281 TraceCheckUtils]: 18: Hoare triple {723#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967289) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967290) 4294967296)))} assume !(main_~x~0 % 4294967296 < 100000000); {659#false} is VALID [2021-09-13 14:12:56,406 INFO L281 TraceCheckUtils]: 19: Hoare triple {659#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {659#false} is VALID [2021-09-13 14:12:56,407 INFO L281 TraceCheckUtils]: 20: Hoare triple {659#false} assume 0 == __VERIFIER_assert_~cond; {659#false} is VALID [2021-09-13 14:12:56,407 INFO L281 TraceCheckUtils]: 21: Hoare triple {659#false} assume !false; {659#false} is VALID [2021-09-13 14:12:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-09-13 14:12:56,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:12:57,081 INFO L281 TraceCheckUtils]: 21: Hoare triple {659#false} assume !false; {659#false} is VALID [2021-09-13 14:12:57,081 INFO L281 TraceCheckUtils]: 20: Hoare triple {659#false} assume 0 == __VERIFIER_assert_~cond; {659#false} is VALID [2021-09-13 14:12:57,081 INFO L281 TraceCheckUtils]: 19: Hoare triple {659#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {659#false} is VALID [2021-09-13 14:12:57,082 INFO L281 TraceCheckUtils]: 18: Hoare triple {745#(< (mod ULTIMATE.start_main_~x~0 4294967296) 100000000)} assume !(main_~x~0 % 4294967296 < 100000000); {659#false} is VALID [2021-09-13 14:12:57,083 INFO L281 TraceCheckUtils]: 17: Hoare triple {749#(< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 100000000)} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {745#(< (mod ULTIMATE.start_main_~x~0 4294967296) 100000000)} is VALID [2021-09-13 14:12:57,083 INFO L281 TraceCheckUtils]: 16: Hoare triple {753#(or (< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 100000000) (<= 100000000 (mod ULTIMATE.start_main_~x~0 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {749#(< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 100000000)} is VALID [2021-09-13 14:12:57,084 INFO L281 TraceCheckUtils]: 15: Hoare triple {757#(or (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {753#(or (< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 100000000) (<= 100000000 (mod ULTIMATE.start_main_~x~0 4294967296)))} is VALID [2021-09-13 14:12:57,084 INFO L281 TraceCheckUtils]: 14: Hoare triple {757#(or (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {757#(or (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)))} is VALID [2021-09-13 14:12:57,085 INFO L281 TraceCheckUtils]: 13: Hoare triple {764#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 100000000))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {757#(or (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)))} is VALID [2021-09-13 14:12:57,086 INFO L281 TraceCheckUtils]: 12: Hoare triple {764#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 100000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {764#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 100000000))} is VALID [2021-09-13 14:12:57,094 INFO L281 TraceCheckUtils]: 11: Hoare triple {658#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {764#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 100000000))} is VALID [2021-09-13 14:12:57,094 INFO L281 TraceCheckUtils]: 10: Hoare triple {658#true} assume !!(main_~x~0 % 4294967296 < 100000000); {658#true} is VALID [2021-09-13 14:12:57,094 INFO L281 TraceCheckUtils]: 9: Hoare triple {658#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {658#true} is VALID [2021-09-13 14:12:57,094 INFO L281 TraceCheckUtils]: 8: Hoare triple {658#true} assume !!(main_~x~0 % 4294967296 < 100000000); {658#true} is VALID [2021-09-13 14:12:57,095 INFO L281 TraceCheckUtils]: 7: Hoare triple {658#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {658#true} is VALID [2021-09-13 14:12:57,095 INFO L281 TraceCheckUtils]: 6: Hoare triple {658#true} assume !!(main_~x~0 % 4294967296 < 100000000); {658#true} is VALID [2021-09-13 14:12:57,095 INFO L281 TraceCheckUtils]: 5: Hoare triple {658#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {658#true} is VALID [2021-09-13 14:12:57,095 INFO L281 TraceCheckUtils]: 4: Hoare triple {658#true} assume !!(main_~x~0 % 4294967296 < 100000000); {658#true} is VALID [2021-09-13 14:12:57,095 INFO L281 TraceCheckUtils]: 3: Hoare triple {658#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {658#true} is VALID [2021-09-13 14:12:57,095 INFO L281 TraceCheckUtils]: 2: Hoare triple {658#true} assume !!(main_~x~0 % 4294967296 < 100000000); {658#true} is VALID [2021-09-13 14:12:57,096 INFO L281 TraceCheckUtils]: 1: Hoare triple {658#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {658#true} is VALID [2021-09-13 14:12:57,096 INFO L281 TraceCheckUtils]: 0: Hoare triple {658#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {658#true} is VALID [2021-09-13 14:12:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-09-13 14:12:57,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579453932] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:12:57,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-09-13 14:12:57,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2021-09-13 14:12:57,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952324100] [2021-09-13 14:12:57,098 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 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 22 [2021-09-13 14:12:57,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:12:57,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 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) [2021-09-13 14:12:57,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:57,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-09-13 14:12:57,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:12:57,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-09-13 14:12:57,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-09-13 14:12:57,152 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 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) [2021-09-13 14:12:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:58,954 INFO L93 Difference]: Finished difference Result 65 states and 92 transitions. [2021-09-13 14:12:58,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-09-13 14:12:58,954 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 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 22 [2021-09-13 14:12:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:12:58,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 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) [2021-09-13 14:12:58,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2021-09-13 14:12:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 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) [2021-09-13 14:12:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2021-09-13 14:12:58,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 57 transitions. [2021-09-13 14:12:59,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:12:59,150 INFO L225 Difference]: With dead ends: 65 [2021-09-13 14:12:59,150 INFO L226 Difference]: Without dead ends: 52 [2021-09-13 14:12:59,151 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1117.45ms TimeCoverageRelationStatistics Valid=175, Invalid=287, Unknown=0, NotChecked=0, Total=462 [2021-09-13 14:12:59,152 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 444.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.03ms SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 447.28ms IncrementalHoareTripleChecker+Time [2021-09-13 14:12:59,152 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 240 Unknown, 0 Unchecked, 3.03ms Time], IncrementalHoareTripleChecker [48 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 447.28ms Time] [2021-09-13 14:12:59,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-09-13 14:12:59,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2021-09-13 14:12:59,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:12:59,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:59,196 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:59,197 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:59,199 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2021-09-13 14:12:59,199 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2021-09-13 14:12:59,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:59,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:59,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 states. [2021-09-13 14:12:59,201 INFO L87 Difference]: Start difference. First operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 states. [2021-09-13 14:12:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:12:59,202 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2021-09-13 14:12:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2021-09-13 14:12:59,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:12:59,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:12:59,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:12:59,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:12:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:12:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2021-09-13 14:12:59,205 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 22 [2021-09-13 14:12:59,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:12:59,206 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2021-09-13 14:12:59,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 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) [2021-09-13 14:12:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2021-09-13 14:12:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-09-13 14:12:59,207 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:12:59,207 INFO L513 BasicCegarLoop]: trace histogram [15, 8, 7, 1, 1, 1, 1, 1, 1] [2021-09-13 14:12:59,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-09-13 14:12:59,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:59,413 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:12:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:12:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1202430414, now seen corresponding path program 4 times [2021-09-13 14:12:59,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:12:59,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435580345] [2021-09-13 14:12:59,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:12:59,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:12:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:59,594 INFO L281 TraceCheckUtils]: 0: Hoare triple {1079#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {1079#true} is VALID [2021-09-13 14:12:59,595 INFO L281 TraceCheckUtils]: 1: Hoare triple {1079#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {1081#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:59,595 INFO L281 TraceCheckUtils]: 2: Hoare triple {1081#(= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 % 4294967296 < 100000000); {1081#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:59,596 INFO L281 TraceCheckUtils]: 3: Hoare triple {1081#(= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1082#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:59,596 INFO L281 TraceCheckUtils]: 4: Hoare triple {1082#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1082#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:59,597 INFO L281 TraceCheckUtils]: 5: Hoare triple {1082#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1083#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:12:59,597 INFO L281 TraceCheckUtils]: 6: Hoare triple {1083#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume !!(main_~x~0 % 4294967296 < 100000000); {1083#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:12:59,598 INFO L281 TraceCheckUtils]: 7: Hoare triple {1083#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1084#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:59,598 INFO L281 TraceCheckUtils]: 8: Hoare triple {1084#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1084#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:59,599 INFO L281 TraceCheckUtils]: 9: Hoare triple {1084#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1085#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} is VALID [2021-09-13 14:12:59,600 INFO L281 TraceCheckUtils]: 10: Hoare triple {1085#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} assume !!(main_~x~0 % 4294967296 < 100000000); {1085#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} is VALID [2021-09-13 14:12:59,600 INFO L281 TraceCheckUtils]: 11: Hoare triple {1085#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1086#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:59,601 INFO L281 TraceCheckUtils]: 12: Hoare triple {1086#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1086#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:59,601 INFO L281 TraceCheckUtils]: 13: Hoare triple {1086#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1087#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} is VALID [2021-09-13 14:12:59,602 INFO L281 TraceCheckUtils]: 14: Hoare triple {1087#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} assume !!(main_~x~0 % 4294967296 < 100000000); {1087#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} is VALID [2021-09-13 14:12:59,602 INFO L281 TraceCheckUtils]: 15: Hoare triple {1087#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1088#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 7))} is VALID [2021-09-13 14:12:59,603 INFO L281 TraceCheckUtils]: 16: Hoare triple {1088#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 7))} assume !!(main_~x~0 % 4294967296 < 100000000); {1088#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 7))} is VALID [2021-09-13 14:12:59,603 INFO L281 TraceCheckUtils]: 17: Hoare triple {1088#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 7))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,604 INFO L281 TraceCheckUtils]: 18: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,604 INFO L281 TraceCheckUtils]: 19: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,604 INFO L281 TraceCheckUtils]: 20: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,604 INFO L281 TraceCheckUtils]: 21: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,604 INFO L281 TraceCheckUtils]: 22: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,604 INFO L281 TraceCheckUtils]: 23: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,604 INFO L281 TraceCheckUtils]: 24: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,604 INFO L281 TraceCheckUtils]: 25: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,604 INFO L281 TraceCheckUtils]: 26: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,605 INFO L281 TraceCheckUtils]: 27: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,605 INFO L281 TraceCheckUtils]: 28: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,605 INFO L281 TraceCheckUtils]: 29: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,605 INFO L281 TraceCheckUtils]: 30: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,605 INFO L281 TraceCheckUtils]: 31: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,605 INFO L281 TraceCheckUtils]: 32: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,605 INFO L281 TraceCheckUtils]: 33: Hoare triple {1080#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1080#false} is VALID [2021-09-13 14:12:59,605 INFO L281 TraceCheckUtils]: 34: Hoare triple {1080#false} assume 0 == __VERIFIER_assert_~cond; {1080#false} is VALID [2021-09-13 14:12:59,605 INFO L281 TraceCheckUtils]: 35: Hoare triple {1080#false} assume !false; {1080#false} is VALID [2021-09-13 14:12:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-09-13 14:12:59,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:12:59,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435580345] [2021-09-13 14:12:59,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435580345] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:12:59,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081444671] [2021-09-13 14:12:59,606 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-09-13 14:12:59,606 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:12:59,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:12:59,610 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) [2021-09-13 14:12:59,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-09-13 14:12:59,653 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-09-13 14:12:59,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:12:59,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjunts are in the unsatisfiable core [2021-09-13 14:12:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:12:59,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:12:59,985 INFO L281 TraceCheckUtils]: 0: Hoare triple {1079#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {1079#true} is VALID [2021-09-13 14:12:59,985 INFO L281 TraceCheckUtils]: 1: Hoare triple {1079#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {1081#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:59,985 INFO L281 TraceCheckUtils]: 2: Hoare triple {1081#(= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 % 4294967296 < 100000000); {1081#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:12:59,986 INFO L281 TraceCheckUtils]: 3: Hoare triple {1081#(= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1082#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:59,986 INFO L281 TraceCheckUtils]: 4: Hoare triple {1082#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1082#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:59,987 INFO L281 TraceCheckUtils]: 5: Hoare triple {1082#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1083#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:12:59,987 INFO L281 TraceCheckUtils]: 6: Hoare triple {1083#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume !!(main_~x~0 % 4294967296 < 100000000); {1083#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:12:59,988 INFO L281 TraceCheckUtils]: 7: Hoare triple {1083#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1084#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:59,988 INFO L281 TraceCheckUtils]: 8: Hoare triple {1084#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1084#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:59,989 INFO L281 TraceCheckUtils]: 9: Hoare triple {1084#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1085#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} is VALID [2021-09-13 14:12:59,989 INFO L281 TraceCheckUtils]: 10: Hoare triple {1085#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} assume !!(main_~x~0 % 4294967296 < 100000000); {1085#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} is VALID [2021-09-13 14:12:59,990 INFO L281 TraceCheckUtils]: 11: Hoare triple {1085#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1086#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:59,990 INFO L281 TraceCheckUtils]: 12: Hoare triple {1086#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1086#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:59,991 INFO L281 TraceCheckUtils]: 13: Hoare triple {1086#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1087#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} is VALID [2021-09-13 14:12:59,991 INFO L281 TraceCheckUtils]: 14: Hoare triple {1087#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} assume !!(main_~x~0 % 4294967296 < 100000000); {1087#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} is VALID [2021-09-13 14:12:59,992 INFO L281 TraceCheckUtils]: 15: Hoare triple {1087#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1137#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:59,992 INFO L281 TraceCheckUtils]: 16: Hoare triple {1137#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1137#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:12:59,993 INFO L281 TraceCheckUtils]: 17: Hoare triple {1137#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,993 INFO L281 TraceCheckUtils]: 18: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,993 INFO L281 TraceCheckUtils]: 19: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,993 INFO L281 TraceCheckUtils]: 20: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,993 INFO L281 TraceCheckUtils]: 21: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,993 INFO L281 TraceCheckUtils]: 22: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,993 INFO L281 TraceCheckUtils]: 23: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,993 INFO L281 TraceCheckUtils]: 24: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,994 INFO L281 TraceCheckUtils]: 25: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,994 INFO L281 TraceCheckUtils]: 26: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,994 INFO L281 TraceCheckUtils]: 27: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,994 INFO L281 TraceCheckUtils]: 28: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,994 INFO L281 TraceCheckUtils]: 29: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,994 INFO L281 TraceCheckUtils]: 30: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,994 INFO L281 TraceCheckUtils]: 31: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:12:59,995 INFO L281 TraceCheckUtils]: 32: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:12:59,995 INFO L281 TraceCheckUtils]: 33: Hoare triple {1080#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1080#false} is VALID [2021-09-13 14:12:59,995 INFO L281 TraceCheckUtils]: 34: Hoare triple {1080#false} assume 0 == __VERIFIER_assert_~cond; {1080#false} is VALID [2021-09-13 14:12:59,995 INFO L281 TraceCheckUtils]: 35: Hoare triple {1080#false} assume !false; {1080#false} is VALID [2021-09-13 14:12:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-09-13 14:12:59,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:13:00,477 INFO L281 TraceCheckUtils]: 35: Hoare triple {1080#false} assume !false; {1080#false} is VALID [2021-09-13 14:13:00,477 INFO L281 TraceCheckUtils]: 34: Hoare triple {1080#false} assume 0 == __VERIFIER_assert_~cond; {1080#false} is VALID [2021-09-13 14:13:00,477 INFO L281 TraceCheckUtils]: 33: Hoare triple {1080#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1080#false} is VALID [2021-09-13 14:13:00,477 INFO L281 TraceCheckUtils]: 32: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:13:00,477 INFO L281 TraceCheckUtils]: 31: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:13:00,478 INFO L281 TraceCheckUtils]: 30: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:13:00,478 INFO L281 TraceCheckUtils]: 29: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:13:00,478 INFO L281 TraceCheckUtils]: 28: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:13:00,478 INFO L281 TraceCheckUtils]: 27: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:13:00,478 INFO L281 TraceCheckUtils]: 26: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:13:00,478 INFO L281 TraceCheckUtils]: 25: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:13:00,478 INFO L281 TraceCheckUtils]: 24: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:13:00,478 INFO L281 TraceCheckUtils]: 23: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:13:00,478 INFO L281 TraceCheckUtils]: 22: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:13:00,478 INFO L281 TraceCheckUtils]: 21: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:13:00,479 INFO L281 TraceCheckUtils]: 20: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:13:00,479 INFO L281 TraceCheckUtils]: 19: Hoare triple {1080#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:13:00,479 INFO L281 TraceCheckUtils]: 18: Hoare triple {1080#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1080#false} is VALID [2021-09-13 14:13:00,479 INFO L281 TraceCheckUtils]: 17: Hoare triple {1252#(< (mod ULTIMATE.start_main_~x~0 4294967296) 10000000)} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1080#false} is VALID [2021-09-13 14:13:00,480 INFO L281 TraceCheckUtils]: 16: Hoare triple {1256#(or (< (mod ULTIMATE.start_main_~x~0 4294967296) 10000000) (<= 100000000 (mod ULTIMATE.start_main_~x~0 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {1252#(< (mod ULTIMATE.start_main_~x~0 4294967296) 10000000)} is VALID [2021-09-13 14:13:00,481 INFO L281 TraceCheckUtils]: 15: Hoare triple {1260#(or (< (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296)))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1256#(or (< (mod ULTIMATE.start_main_~x~0 4294967296) 10000000) (<= 100000000 (mod ULTIMATE.start_main_~x~0 4294967296)))} is VALID [2021-09-13 14:13:00,481 INFO L281 TraceCheckUtils]: 14: Hoare triple {1260#(or (< (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {1260#(or (< (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296)))} is VALID [2021-09-13 14:13:00,482 INFO L281 TraceCheckUtils]: 13: Hoare triple {1267#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 10000000))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1260#(or (< (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296)))} is VALID [2021-09-13 14:13:00,482 INFO L281 TraceCheckUtils]: 12: Hoare triple {1267#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {1267#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 10000000))} is VALID [2021-09-13 14:13:00,483 INFO L281 TraceCheckUtils]: 11: Hoare triple {1274#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296) 10000000))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1267#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 10000000))} is VALID [2021-09-13 14:13:00,483 INFO L281 TraceCheckUtils]: 10: Hoare triple {1274#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {1274#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296) 10000000))} is VALID [2021-09-13 14:13:00,484 INFO L281 TraceCheckUtils]: 9: Hoare triple {1281#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 10000000))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1274#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296) 10000000))} is VALID [2021-09-13 14:13:00,485 INFO L281 TraceCheckUtils]: 8: Hoare triple {1281#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {1281#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 10000000))} is VALID [2021-09-13 14:13:00,486 INFO L281 TraceCheckUtils]: 7: Hoare triple {1288#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296) 10000000))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1281#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 10000000))} is VALID [2021-09-13 14:13:00,487 INFO L281 TraceCheckUtils]: 6: Hoare triple {1288#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {1288#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296) 10000000))} is VALID [2021-09-13 14:13:00,487 INFO L281 TraceCheckUtils]: 5: Hoare triple {1295#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 10000000))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1288#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296) 10000000))} is VALID [2021-09-13 14:13:00,488 INFO L281 TraceCheckUtils]: 4: Hoare triple {1295#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {1295#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 10000000))} is VALID [2021-09-13 14:13:00,489 INFO L281 TraceCheckUtils]: 3: Hoare triple {1302#(or (< (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296)))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1295#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 10000000))} is VALID [2021-09-13 14:13:00,490 INFO L281 TraceCheckUtils]: 2: Hoare triple {1302#(or (< (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {1302#(or (< (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296)))} is VALID [2021-09-13 14:13:00,490 INFO L281 TraceCheckUtils]: 1: Hoare triple {1079#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {1302#(or (< (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296)))} is VALID [2021-09-13 14:13:00,490 INFO L281 TraceCheckUtils]: 0: Hoare triple {1079#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {1079#true} is VALID [2021-09-13 14:13:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-09-13 14:13:00,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081444671] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:13:00,491 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-09-13 14:13:00,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 20 [2021-09-13 14:13:00,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645839369] [2021-09-13 14:13:00,492 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 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 36 [2021-09-13 14:13:00,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:13:00,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:13:00,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:13:00,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-09-13 14:13:00,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:13:00,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-09-13 14:13:00,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2021-09-13 14:13:00,539 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:13:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:13:03,256 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2021-09-13 14:13:03,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-09-13 14:13:03,257 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 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 36 [2021-09-13 14:13:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:13:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:13:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions. [2021-09-13 14:13:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:13:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions. [2021-09-13 14:13:03,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 58 transitions. [2021-09-13 14:13:04,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:13:04,626 INFO L225 Difference]: With dead ends: 96 [2021-09-13 14:13:04,627 INFO L226 Difference]: Without dead ends: 65 [2021-09-13 14:13:04,627 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2247.02ms TimeCoverageRelationStatistics Valid=287, Invalid=469, Unknown=0, NotChecked=0, Total=756 [2021-09-13 14:13:04,628 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 187.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.05ms SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 189.32ms IncrementalHoareTripleChecker+Time [2021-09-13 14:13:04,629 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 215 Unknown, 0 Unchecked, 2.05ms Time], IncrementalHoareTripleChecker [29 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 189.32ms Time] [2021-09-13 14:13:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-09-13 14:13:04,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-09-13 14:13:04,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:13:04,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 64 states have (on average 1.125) internal successors, (72), 64 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:13:04,707 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 64 states have (on average 1.125) internal successors, (72), 64 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:13:04,707 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 64 states have (on average 1.125) internal successors, (72), 64 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:13:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:13:04,709 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2021-09-13 14:13:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2021-09-13 14:13:04,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:13:04,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:13:04,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 64 states have (on average 1.125) internal successors, (72), 64 states have internal predecessors, (72), 0 states have call successors, (0), 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 65 states. [2021-09-13 14:13:04,714 INFO L87 Difference]: Start difference. First operand has 65 states, 64 states have (on average 1.125) internal successors, (72), 64 states have internal predecessors, (72), 0 states have call successors, (0), 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 65 states. [2021-09-13 14:13:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:13:04,717 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2021-09-13 14:13:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2021-09-13 14:13:04,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:13:04,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:13:04,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:13:04,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:13:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.125) internal successors, (72), 64 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:13:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2021-09-13 14:13:04,720 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 36 [2021-09-13 14:13:04,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:13:04,721 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2021-09-13 14:13:04,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:13:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2021-09-13 14:13:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-09-13 14:13:04,724 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:13:04,724 INFO L513 BasicCegarLoop]: trace histogram [25, 17, 8, 1, 1, 1, 1, 1, 1] [2021-09-13 14:13:04,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-09-13 14:13:04,943 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 [2021-09-13 14:13:04,943 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:13:04,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:13:04,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1703277844, now seen corresponding path program 5 times [2021-09-13 14:13:04,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:13:04,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437401104] [2021-09-13 14:13:04,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:13:04,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:13:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:13:05,316 INFO L281 TraceCheckUtils]: 0: Hoare triple {1692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {1692#true} is VALID [2021-09-13 14:13:05,317 INFO L281 TraceCheckUtils]: 1: Hoare triple {1692#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {1694#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:13:05,317 INFO L281 TraceCheckUtils]: 2: Hoare triple {1694#(= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 % 4294967296 < 100000000); {1694#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:13:05,317 INFO L281 TraceCheckUtils]: 3: Hoare triple {1694#(= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1695#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,318 INFO L281 TraceCheckUtils]: 4: Hoare triple {1695#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1695#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,318 INFO L281 TraceCheckUtils]: 5: Hoare triple {1695#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1696#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:13:05,319 INFO L281 TraceCheckUtils]: 6: Hoare triple {1696#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume !!(main_~x~0 % 4294967296 < 100000000); {1696#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:13:05,319 INFO L281 TraceCheckUtils]: 7: Hoare triple {1696#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1697#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,320 INFO L281 TraceCheckUtils]: 8: Hoare triple {1697#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1697#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,320 INFO L281 TraceCheckUtils]: 9: Hoare triple {1697#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1698#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} is VALID [2021-09-13 14:13:05,321 INFO L281 TraceCheckUtils]: 10: Hoare triple {1698#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} assume !!(main_~x~0 % 4294967296 < 100000000); {1698#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} is VALID [2021-09-13 14:13:05,321 INFO L281 TraceCheckUtils]: 11: Hoare triple {1698#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1699#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,322 INFO L281 TraceCheckUtils]: 12: Hoare triple {1699#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1699#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,322 INFO L281 TraceCheckUtils]: 13: Hoare triple {1699#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1700#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} is VALID [2021-09-13 14:13:05,323 INFO L281 TraceCheckUtils]: 14: Hoare triple {1700#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} assume !!(main_~x~0 % 4294967296 < 100000000); {1700#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} is VALID [2021-09-13 14:13:05,323 INFO L281 TraceCheckUtils]: 15: Hoare triple {1700#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1701#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,323 INFO L281 TraceCheckUtils]: 16: Hoare triple {1701#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1701#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,324 INFO L281 TraceCheckUtils]: 17: Hoare triple {1701#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1702#(and (<= ULTIMATE.start_main_~x~0 8) (<= 8 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,325 INFO L281 TraceCheckUtils]: 18: Hoare triple {1702#(and (<= ULTIMATE.start_main_~x~0 8) (<= 8 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1702#(and (<= ULTIMATE.start_main_~x~0 8) (<= 8 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,326 INFO L281 TraceCheckUtils]: 19: Hoare triple {1702#(and (<= ULTIMATE.start_main_~x~0 8) (<= 8 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1703#(and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,326 INFO L281 TraceCheckUtils]: 20: Hoare triple {1703#(and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1703#(and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,327 INFO L281 TraceCheckUtils]: 21: Hoare triple {1703#(and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1704#(and (<= 10 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 10))} is VALID [2021-09-13 14:13:05,327 INFO L281 TraceCheckUtils]: 22: Hoare triple {1704#(and (<= 10 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 10))} assume !!(main_~x~0 % 4294967296 < 100000000); {1704#(and (<= 10 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 10))} is VALID [2021-09-13 14:13:05,328 INFO L281 TraceCheckUtils]: 23: Hoare triple {1704#(and (<= 10 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 10))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1705#(and (<= 11 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 11))} is VALID [2021-09-13 14:13:05,328 INFO L281 TraceCheckUtils]: 24: Hoare triple {1705#(and (<= 11 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 11))} assume !!(main_~x~0 % 4294967296 < 100000000); {1705#(and (<= 11 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 11))} is VALID [2021-09-13 14:13:05,329 INFO L281 TraceCheckUtils]: 25: Hoare triple {1705#(and (<= 11 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 11))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1706#(and (<= ULTIMATE.start_main_~x~0 12) (<= 12 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,329 INFO L281 TraceCheckUtils]: 26: Hoare triple {1706#(and (<= ULTIMATE.start_main_~x~0 12) (<= 12 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1706#(and (<= ULTIMATE.start_main_~x~0 12) (<= 12 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,330 INFO L281 TraceCheckUtils]: 27: Hoare triple {1706#(and (<= ULTIMATE.start_main_~x~0 12) (<= 12 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1707#(and (<= ULTIMATE.start_main_~x~0 13) (<= 13 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,330 INFO L281 TraceCheckUtils]: 28: Hoare triple {1707#(and (<= ULTIMATE.start_main_~x~0 13) (<= 13 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1707#(and (<= ULTIMATE.start_main_~x~0 13) (<= 13 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,331 INFO L281 TraceCheckUtils]: 29: Hoare triple {1707#(and (<= ULTIMATE.start_main_~x~0 13) (<= 13 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1708#(and (<= ULTIMATE.start_main_~x~0 14) (<= 14 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,331 INFO L281 TraceCheckUtils]: 30: Hoare triple {1708#(and (<= ULTIMATE.start_main_~x~0 14) (<= 14 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1708#(and (<= ULTIMATE.start_main_~x~0 14) (<= 14 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,332 INFO L281 TraceCheckUtils]: 31: Hoare triple {1708#(and (<= ULTIMATE.start_main_~x~0 14) (<= 14 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1709#(and (<= ULTIMATE.start_main_~x~0 15) (<= 15 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,332 INFO L281 TraceCheckUtils]: 32: Hoare triple {1709#(and (<= ULTIMATE.start_main_~x~0 15) (<= 15 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1709#(and (<= ULTIMATE.start_main_~x~0 15) (<= 15 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:05,333 INFO L281 TraceCheckUtils]: 33: Hoare triple {1709#(and (<= ULTIMATE.start_main_~x~0 15) (<= 15 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1710#(and (<= 16 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 16))} is VALID [2021-09-13 14:13:05,333 INFO L281 TraceCheckUtils]: 34: Hoare triple {1710#(and (<= 16 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 16))} assume !!(main_~x~0 % 4294967296 < 100000000); {1710#(and (<= 16 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 16))} is VALID [2021-09-13 14:13:05,334 INFO L281 TraceCheckUtils]: 35: Hoare triple {1710#(and (<= 16 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 16))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1711#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 17))} is VALID [2021-09-13 14:13:05,334 INFO L281 TraceCheckUtils]: 36: Hoare triple {1711#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 17))} assume !!(main_~x~0 % 4294967296 < 100000000); {1711#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 17))} is VALID [2021-09-13 14:13:05,335 INFO L281 TraceCheckUtils]: 37: Hoare triple {1711#(and (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)) (<= ULTIMATE.start_main_~x~0 17))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:05,335 INFO L281 TraceCheckUtils]: 38: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:05,335 INFO L281 TraceCheckUtils]: 39: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:05,335 INFO L281 TraceCheckUtils]: 40: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:05,335 INFO L281 TraceCheckUtils]: 41: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:05,335 INFO L281 TraceCheckUtils]: 42: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:05,335 INFO L281 TraceCheckUtils]: 43: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:05,335 INFO L281 TraceCheckUtils]: 44: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:05,335 INFO L281 TraceCheckUtils]: 45: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:05,335 INFO L281 TraceCheckUtils]: 46: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:05,335 INFO L281 TraceCheckUtils]: 47: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:05,335 INFO L281 TraceCheckUtils]: 48: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:05,335 INFO L281 TraceCheckUtils]: 49: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:05,335 INFO L281 TraceCheckUtils]: 50: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:05,336 INFO L281 TraceCheckUtils]: 51: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:05,336 INFO L281 TraceCheckUtils]: 52: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:05,336 INFO L281 TraceCheckUtils]: 53: Hoare triple {1693#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1693#false} is VALID [2021-09-13 14:13:05,336 INFO L281 TraceCheckUtils]: 54: Hoare triple {1693#false} assume 0 == __VERIFIER_assert_~cond; {1693#false} is VALID [2021-09-13 14:13:05,336 INFO L281 TraceCheckUtils]: 55: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2021-09-13 14:13:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 270 proven. 306 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-09-13 14:13:05,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:13:05,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437401104] [2021-09-13 14:13:05,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437401104] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:13:05,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960876142] [2021-09-13 14:13:05,337 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-09-13 14:13:05,337 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:13:05,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:13:05,341 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) [2021-09-13 14:13:05,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-09-13 14:13:05,846 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2021-09-13 14:13:05,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:13:05,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 38 conjunts are in the unsatisfiable core [2021-09-13 14:13:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:13:05,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:13:06,507 INFO L281 TraceCheckUtils]: 0: Hoare triple {1692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {1692#true} is VALID [2021-09-13 14:13:06,508 INFO L281 TraceCheckUtils]: 1: Hoare triple {1692#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {1694#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:13:06,508 INFO L281 TraceCheckUtils]: 2: Hoare triple {1694#(= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 % 4294967296 < 100000000); {1694#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:13:06,509 INFO L281 TraceCheckUtils]: 3: Hoare triple {1694#(= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1695#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,509 INFO L281 TraceCheckUtils]: 4: Hoare triple {1695#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1695#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,510 INFO L281 TraceCheckUtils]: 5: Hoare triple {1695#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1696#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:13:06,510 INFO L281 TraceCheckUtils]: 6: Hoare triple {1696#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume !!(main_~x~0 % 4294967296 < 100000000); {1696#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:13:06,510 INFO L281 TraceCheckUtils]: 7: Hoare triple {1696#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1697#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,511 INFO L281 TraceCheckUtils]: 8: Hoare triple {1697#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1697#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,511 INFO L281 TraceCheckUtils]: 9: Hoare triple {1697#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1698#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} is VALID [2021-09-13 14:13:06,512 INFO L281 TraceCheckUtils]: 10: Hoare triple {1698#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} assume !!(main_~x~0 % 4294967296 < 100000000); {1698#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} is VALID [2021-09-13 14:13:06,512 INFO L281 TraceCheckUtils]: 11: Hoare triple {1698#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1699#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,513 INFO L281 TraceCheckUtils]: 12: Hoare triple {1699#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1699#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,513 INFO L281 TraceCheckUtils]: 13: Hoare triple {1699#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1700#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} is VALID [2021-09-13 14:13:06,513 INFO L281 TraceCheckUtils]: 14: Hoare triple {1700#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} assume !!(main_~x~0 % 4294967296 < 100000000); {1700#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} is VALID [2021-09-13 14:13:06,514 INFO L281 TraceCheckUtils]: 15: Hoare triple {1700#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1701#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,514 INFO L281 TraceCheckUtils]: 16: Hoare triple {1701#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1701#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,515 INFO L281 TraceCheckUtils]: 17: Hoare triple {1701#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1702#(and (<= ULTIMATE.start_main_~x~0 8) (<= 8 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,515 INFO L281 TraceCheckUtils]: 18: Hoare triple {1702#(and (<= ULTIMATE.start_main_~x~0 8) (<= 8 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1702#(and (<= ULTIMATE.start_main_~x~0 8) (<= 8 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,516 INFO L281 TraceCheckUtils]: 19: Hoare triple {1702#(and (<= ULTIMATE.start_main_~x~0 8) (<= 8 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1703#(and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,516 INFO L281 TraceCheckUtils]: 20: Hoare triple {1703#(and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1703#(and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,516 INFO L281 TraceCheckUtils]: 21: Hoare triple {1703#(and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1704#(and (<= 10 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 10))} is VALID [2021-09-13 14:13:06,517 INFO L281 TraceCheckUtils]: 22: Hoare triple {1704#(and (<= 10 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 10))} assume !!(main_~x~0 % 4294967296 < 100000000); {1704#(and (<= 10 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 10))} is VALID [2021-09-13 14:13:06,517 INFO L281 TraceCheckUtils]: 23: Hoare triple {1704#(and (<= 10 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 10))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1705#(and (<= 11 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 11))} is VALID [2021-09-13 14:13:06,518 INFO L281 TraceCheckUtils]: 24: Hoare triple {1705#(and (<= 11 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 11))} assume !!(main_~x~0 % 4294967296 < 100000000); {1705#(and (<= 11 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 11))} is VALID [2021-09-13 14:13:06,518 INFO L281 TraceCheckUtils]: 25: Hoare triple {1705#(and (<= 11 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 11))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1706#(and (<= ULTIMATE.start_main_~x~0 12) (<= 12 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,518 INFO L281 TraceCheckUtils]: 26: Hoare triple {1706#(and (<= ULTIMATE.start_main_~x~0 12) (<= 12 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1706#(and (<= ULTIMATE.start_main_~x~0 12) (<= 12 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,519 INFO L281 TraceCheckUtils]: 27: Hoare triple {1706#(and (<= ULTIMATE.start_main_~x~0 12) (<= 12 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1707#(and (<= ULTIMATE.start_main_~x~0 13) (<= 13 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,520 INFO L281 TraceCheckUtils]: 28: Hoare triple {1707#(and (<= ULTIMATE.start_main_~x~0 13) (<= 13 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1707#(and (<= ULTIMATE.start_main_~x~0 13) (<= 13 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,520 INFO L281 TraceCheckUtils]: 29: Hoare triple {1707#(and (<= ULTIMATE.start_main_~x~0 13) (<= 13 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1708#(and (<= ULTIMATE.start_main_~x~0 14) (<= 14 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,521 INFO L281 TraceCheckUtils]: 30: Hoare triple {1708#(and (<= ULTIMATE.start_main_~x~0 14) (<= 14 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1708#(and (<= ULTIMATE.start_main_~x~0 14) (<= 14 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,527 INFO L281 TraceCheckUtils]: 31: Hoare triple {1708#(and (<= ULTIMATE.start_main_~x~0 14) (<= 14 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1709#(and (<= ULTIMATE.start_main_~x~0 15) (<= 15 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,528 INFO L281 TraceCheckUtils]: 32: Hoare triple {1709#(and (<= ULTIMATE.start_main_~x~0 15) (<= 15 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {1709#(and (<= ULTIMATE.start_main_~x~0 15) (<= 15 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:13:06,529 INFO L281 TraceCheckUtils]: 33: Hoare triple {1709#(and (<= ULTIMATE.start_main_~x~0 15) (<= 15 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1710#(and (<= 16 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 16))} is VALID [2021-09-13 14:13:06,529 INFO L281 TraceCheckUtils]: 34: Hoare triple {1710#(and (<= 16 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 16))} assume !!(main_~x~0 % 4294967296 < 100000000); {1710#(and (<= 16 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 16))} is VALID [2021-09-13 14:13:06,530 INFO L281 TraceCheckUtils]: 35: Hoare triple {1710#(and (<= 16 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 16))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1820#(and (<= 17 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 17))} is VALID [2021-09-13 14:13:06,530 INFO L281 TraceCheckUtils]: 36: Hoare triple {1820#(and (<= 17 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 17))} assume !!(main_~x~0 % 4294967296 < 100000000); {1820#(and (<= 17 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 17))} is VALID [2021-09-13 14:13:06,531 INFO L281 TraceCheckUtils]: 37: Hoare triple {1820#(and (<= 17 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 17))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:06,531 INFO L281 TraceCheckUtils]: 38: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:06,531 INFO L281 TraceCheckUtils]: 39: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:06,531 INFO L281 TraceCheckUtils]: 40: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:06,531 INFO L281 TraceCheckUtils]: 41: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:06,531 INFO L281 TraceCheckUtils]: 42: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:06,531 INFO L281 TraceCheckUtils]: 43: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:06,532 INFO L281 TraceCheckUtils]: 44: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:06,532 INFO L281 TraceCheckUtils]: 45: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:06,532 INFO L281 TraceCheckUtils]: 46: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:06,532 INFO L281 TraceCheckUtils]: 47: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:06,532 INFO L281 TraceCheckUtils]: 48: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:06,532 INFO L281 TraceCheckUtils]: 49: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:06,532 INFO L281 TraceCheckUtils]: 50: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:06,532 INFO L281 TraceCheckUtils]: 51: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:06,533 INFO L281 TraceCheckUtils]: 52: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:06,533 INFO L281 TraceCheckUtils]: 53: Hoare triple {1693#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1693#false} is VALID [2021-09-13 14:13:06,533 INFO L281 TraceCheckUtils]: 54: Hoare triple {1693#false} assume 0 == __VERIFIER_assert_~cond; {1693#false} is VALID [2021-09-13 14:13:06,533 INFO L281 TraceCheckUtils]: 55: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2021-09-13 14:13:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 270 proven. 306 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-09-13 14:13:06,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:13:07,741 INFO L281 TraceCheckUtils]: 55: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2021-09-13 14:13:07,741 INFO L281 TraceCheckUtils]: 54: Hoare triple {1693#false} assume 0 == __VERIFIER_assert_~cond; {1693#false} is VALID [2021-09-13 14:13:07,741 INFO L281 TraceCheckUtils]: 53: Hoare triple {1693#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1693#false} is VALID [2021-09-13 14:13:07,741 INFO L281 TraceCheckUtils]: 52: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:07,741 INFO L281 TraceCheckUtils]: 51: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:07,741 INFO L281 TraceCheckUtils]: 50: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:07,742 INFO L281 TraceCheckUtils]: 49: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:07,742 INFO L281 TraceCheckUtils]: 48: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:07,742 INFO L281 TraceCheckUtils]: 47: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:07,742 INFO L281 TraceCheckUtils]: 46: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:07,742 INFO L281 TraceCheckUtils]: 45: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:07,742 INFO L281 TraceCheckUtils]: 44: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:07,742 INFO L281 TraceCheckUtils]: 43: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:07,742 INFO L281 TraceCheckUtils]: 42: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:07,742 INFO L281 TraceCheckUtils]: 41: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:07,742 INFO L281 TraceCheckUtils]: 40: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:07,742 INFO L281 TraceCheckUtils]: 39: Hoare triple {1693#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:07,742 INFO L281 TraceCheckUtils]: 38: Hoare triple {1693#false} assume !!(main_~x~0 % 4294967296 < 100000000); {1693#false} is VALID [2021-09-13 14:13:07,743 INFO L281 TraceCheckUtils]: 37: Hoare triple {1935#(< (mod ULTIMATE.start_main_~x~0 4294967296) 10000000)} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {1693#false} is VALID [2021-09-13 14:13:07,743 INFO L281 TraceCheckUtils]: 36: Hoare triple {1939#(or (< (mod ULTIMATE.start_main_~x~0 4294967296) 10000000) (<= 100000000 (mod ULTIMATE.start_main_~x~0 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {1935#(< (mod ULTIMATE.start_main_~x~0 4294967296) 10000000)} is VALID [2021-09-13 14:13:07,744 INFO L281 TraceCheckUtils]: 35: Hoare triple {1943#(or (< (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296)))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1939#(or (< (mod ULTIMATE.start_main_~x~0 4294967296) 10000000) (<= 100000000 (mod ULTIMATE.start_main_~x~0 4294967296)))} is VALID [2021-09-13 14:13:07,744 INFO L281 TraceCheckUtils]: 34: Hoare triple {1943#(or (< (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {1943#(or (< (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296)))} is VALID [2021-09-13 14:13:07,745 INFO L281 TraceCheckUtils]: 33: Hoare triple {1950#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 10000000))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1943#(or (< (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 1) 4294967296)))} is VALID [2021-09-13 14:13:07,745 INFO L281 TraceCheckUtils]: 32: Hoare triple {1950#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {1950#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,746 INFO L281 TraceCheckUtils]: 31: Hoare triple {1957#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296) 10000000))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1950#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,746 INFO L281 TraceCheckUtils]: 30: Hoare triple {1957#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {1957#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,747 INFO L281 TraceCheckUtils]: 29: Hoare triple {1964#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 10000000))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1957#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 3) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,747 INFO L281 TraceCheckUtils]: 28: Hoare triple {1964#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {1964#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,748 INFO L281 TraceCheckUtils]: 27: Hoare triple {1971#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296) 10000000))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1964#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,748 INFO L281 TraceCheckUtils]: 26: Hoare triple {1971#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {1971#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,752 INFO L281 TraceCheckUtils]: 25: Hoare triple {1978#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 10000000))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1971#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 5) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,752 INFO L281 TraceCheckUtils]: 24: Hoare triple {1978#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {1978#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,753 INFO L281 TraceCheckUtils]: 23: Hoare triple {1985#(or (< (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296)))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1978#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,753 INFO L281 TraceCheckUtils]: 22: Hoare triple {1985#(or (< (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {1985#(or (< (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296)))} is VALID [2021-09-13 14:13:07,754 INFO L281 TraceCheckUtils]: 21: Hoare triple {1992#(or (< (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296)))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1985#(or (< (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 7) 4294967296)))} is VALID [2021-09-13 14:13:07,754 INFO L281 TraceCheckUtils]: 20: Hoare triple {1992#(or (< (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {1992#(or (< (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296)))} is VALID [2021-09-13 14:13:07,755 INFO L281 TraceCheckUtils]: 19: Hoare triple {1999#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 9) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 9) 4294967296) 10000000))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1992#(or (< (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296)))} is VALID [2021-09-13 14:13:07,755 INFO L281 TraceCheckUtils]: 18: Hoare triple {1999#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 9) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 9) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {1999#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 9) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 9) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,756 INFO L281 TraceCheckUtils]: 17: Hoare triple {2006#(or (< (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296)))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {1999#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 9) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 9) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,756 INFO L281 TraceCheckUtils]: 16: Hoare triple {2006#(or (< (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {2006#(or (< (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296)))} is VALID [2021-09-13 14:13:07,757 INFO L281 TraceCheckUtils]: 15: Hoare triple {2013#(or (< (mod (+ ULTIMATE.start_main_~x~0 11) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 11) 4294967296)))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2006#(or (< (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296)))} is VALID [2021-09-13 14:13:07,758 INFO L281 TraceCheckUtils]: 14: Hoare triple {2013#(or (< (mod (+ ULTIMATE.start_main_~x~0 11) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 11) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {2013#(or (< (mod (+ ULTIMATE.start_main_~x~0 11) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 11) 4294967296)))} is VALID [2021-09-13 14:13:07,759 INFO L281 TraceCheckUtils]: 13: Hoare triple {2020#(or (< (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296)))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2013#(or (< (mod (+ ULTIMATE.start_main_~x~0 11) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 11) 4294967296)))} is VALID [2021-09-13 14:13:07,759 INFO L281 TraceCheckUtils]: 12: Hoare triple {2020#(or (< (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {2020#(or (< (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296)))} is VALID [2021-09-13 14:13:07,760 INFO L281 TraceCheckUtils]: 11: Hoare triple {2027#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 13) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 13) 4294967296) 10000000))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2020#(or (< (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296)))} is VALID [2021-09-13 14:13:07,765 INFO L281 TraceCheckUtils]: 10: Hoare triple {2027#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 13) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 13) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {2027#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 13) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 13) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,766 INFO L281 TraceCheckUtils]: 9: Hoare triple {2034#(or (< (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296)))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2027#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 13) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 13) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,766 INFO L281 TraceCheckUtils]: 8: Hoare triple {2034#(or (< (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {2034#(or (< (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296)))} is VALID [2021-09-13 14:13:07,767 INFO L281 TraceCheckUtils]: 7: Hoare triple {2041#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 15) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 15) 4294967296) 10000000))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2034#(or (< (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296)))} is VALID [2021-09-13 14:13:07,767 INFO L281 TraceCheckUtils]: 6: Hoare triple {2041#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 15) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 15) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {2041#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 15) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 15) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,768 INFO L281 TraceCheckUtils]: 5: Hoare triple {2048#(or (< (mod (+ ULTIMATE.start_main_~x~0 16) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 16) 4294967296)))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2041#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 15) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 15) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,768 INFO L281 TraceCheckUtils]: 4: Hoare triple {2048#(or (< (mod (+ ULTIMATE.start_main_~x~0 16) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 16) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {2048#(or (< (mod (+ ULTIMATE.start_main_~x~0 16) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 16) 4294967296)))} is VALID [2021-09-13 14:13:07,769 INFO L281 TraceCheckUtils]: 3: Hoare triple {2055#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 17) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 17) 4294967296) 10000000))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2048#(or (< (mod (+ ULTIMATE.start_main_~x~0 16) 4294967296) 10000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 16) 4294967296)))} is VALID [2021-09-13 14:13:07,769 INFO L281 TraceCheckUtils]: 2: Hoare triple {2055#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 17) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 17) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {2055#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 17) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 17) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,770 INFO L281 TraceCheckUtils]: 1: Hoare triple {1692#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {2055#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 17) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 17) 4294967296) 10000000))} is VALID [2021-09-13 14:13:07,770 INFO L281 TraceCheckUtils]: 0: Hoare triple {1692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {1692#true} is VALID [2021-09-13 14:13:07,770 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 270 proven. 306 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-09-13 14:13:07,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960876142] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:13:07,771 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-09-13 14:13:07,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 40 [2021-09-13 14:13:07,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268455585] [2021-09-13 14:13:07,772 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 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 56 [2021-09-13 14:13:07,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:13:07,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:13:07,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:13:07,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-09-13 14:13:07,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:13:07,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-09-13 14:13:07,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1103, Unknown=0, NotChecked=0, Total=1560 [2021-09-13 14:13:07,860 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:10,354 WARN L210 SmtUtils]: Spent 9.07s on a formula simplification. DAG size of input: 111 DAG size of output: 15 [2021-09-13 14:14:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:10,925 INFO L93 Difference]: Finished difference Result 136 states and 170 transitions. [2021-09-13 14:14:10,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-09-13 14:14:10,925 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 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 56 [2021-09-13 14:14:10,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 108 transitions. [2021-09-13 14:14:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 108 transitions. [2021-09-13 14:14:10,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 108 transitions. [2021-09-13 14:14:11,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:11,113 INFO L225 Difference]: With dead ends: 136 [2021-09-13 14:14:11,113 INFO L226 Difference]: Without dead ends: 105 [2021-09-13 14:14:11,114 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 61882.53ms TimeCoverageRelationStatistics Valid=1176, Invalid=2129, Unknown=1, NotChecked=0, Total=3306 [2021-09-13 14:14:11,115 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 786.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.43ms SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 794.15ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:11,115 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 925 Unknown, 0 Unchecked, 6.43ms Time], IncrementalHoareTripleChecker [105 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 794.15ms Time] [2021-09-13 14:14:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-09-13 14:14:11,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-09-13 14:14:11,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:11,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 105 states, 104 states have (on average 1.0769230769230769) internal successors, (112), 104 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:11,250 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 105 states, 104 states have (on average 1.0769230769230769) internal successors, (112), 104 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:11,250 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 105 states, 104 states have (on average 1.0769230769230769) internal successors, (112), 104 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:11,252 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2021-09-13 14:14:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2021-09-13 14:14:11,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:11,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:11,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 104 states have (on average 1.0769230769230769) internal successors, (112), 104 states have internal predecessors, (112), 0 states have call successors, (0), 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 105 states. [2021-09-13 14:14:11,253 INFO L87 Difference]: Start difference. First operand has 105 states, 104 states have (on average 1.0769230769230769) internal successors, (112), 104 states have internal predecessors, (112), 0 states have call successors, (0), 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 105 states. [2021-09-13 14:14:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:11,256 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2021-09-13 14:14:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2021-09-13 14:14:11,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:11,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:11,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:11,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.0769230769230769) internal successors, (112), 104 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2021-09-13 14:14:11,259 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 56 [2021-09-13 14:14:11,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:11,260 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2021-09-13 14:14:11,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2021-09-13 14:14:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-09-13 14:14:11,261 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:14:11,261 INFO L513 BasicCegarLoop]: trace histogram [45, 37, 8, 1, 1, 1, 1, 1, 1] [2021-09-13 14:14:11,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-09-13 14:14:11,466 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 [2021-09-13 14:14:11,467 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-09-13 14:14:11,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:14:11,468 INFO L82 PathProgramCache]: Analyzing trace with hash -904057816, now seen corresponding path program 6 times [2021-09-13 14:14:11,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:14:11,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728495568] [2021-09-13 14:14:11,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:14:11,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:14:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:12,532 INFO L281 TraceCheckUtils]: 0: Hoare triple {2665#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {2665#true} is VALID [2021-09-13 14:14:12,532 INFO L281 TraceCheckUtils]: 1: Hoare triple {2665#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {2667#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:14:12,533 INFO L281 TraceCheckUtils]: 2: Hoare triple {2667#(= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 % 4294967296 < 100000000); {2667#(= ULTIMATE.start_main_~x~0 0)} is VALID [2021-09-13 14:14:12,533 INFO L281 TraceCheckUtils]: 3: Hoare triple {2667#(= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2668#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,534 INFO L281 TraceCheckUtils]: 4: Hoare triple {2668#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {2668#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,534 INFO L281 TraceCheckUtils]: 5: Hoare triple {2668#(and (<= ULTIMATE.start_main_~x~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2669#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:14:12,535 INFO L281 TraceCheckUtils]: 6: Hoare triple {2669#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume !!(main_~x~0 % 4294967296 < 100000000); {2669#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} is VALID [2021-09-13 14:14:12,536 INFO L281 TraceCheckUtils]: 7: Hoare triple {2669#(and (<= 2 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 2))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2670#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,536 INFO L281 TraceCheckUtils]: 8: Hoare triple {2670#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {2670#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,537 INFO L281 TraceCheckUtils]: 9: Hoare triple {2670#(and (<= ULTIMATE.start_main_~x~0 3) (<= 3 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2671#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} is VALID [2021-09-13 14:14:12,537 INFO L281 TraceCheckUtils]: 10: Hoare triple {2671#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} assume !!(main_~x~0 % 4294967296 < 100000000); {2671#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} is VALID [2021-09-13 14:14:12,538 INFO L281 TraceCheckUtils]: 11: Hoare triple {2671#(and (<= 4 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 4))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2672#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,539 INFO L281 TraceCheckUtils]: 12: Hoare triple {2672#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {2672#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,539 INFO L281 TraceCheckUtils]: 13: Hoare triple {2672#(and (<= ULTIMATE.start_main_~x~0 5) (<= 5 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2673#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} is VALID [2021-09-13 14:14:12,540 INFO L281 TraceCheckUtils]: 14: Hoare triple {2673#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} assume !!(main_~x~0 % 4294967296 < 100000000); {2673#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} is VALID [2021-09-13 14:14:12,540 INFO L281 TraceCheckUtils]: 15: Hoare triple {2673#(and (<= 6 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 6))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2674#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,541 INFO L281 TraceCheckUtils]: 16: Hoare triple {2674#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {2674#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,541 INFO L281 TraceCheckUtils]: 17: Hoare triple {2674#(and (<= ULTIMATE.start_main_~x~0 7) (<= 7 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2675#(and (<= ULTIMATE.start_main_~x~0 8) (<= 8 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,542 INFO L281 TraceCheckUtils]: 18: Hoare triple {2675#(and (<= ULTIMATE.start_main_~x~0 8) (<= 8 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {2675#(and (<= ULTIMATE.start_main_~x~0 8) (<= 8 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,542 INFO L281 TraceCheckUtils]: 19: Hoare triple {2675#(and (<= ULTIMATE.start_main_~x~0 8) (<= 8 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2676#(and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,543 INFO L281 TraceCheckUtils]: 20: Hoare triple {2676#(and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {2676#(and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,544 INFO L281 TraceCheckUtils]: 21: Hoare triple {2676#(and (<= ULTIMATE.start_main_~x~0 9) (<= 9 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2677#(and (<= 10 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 10))} is VALID [2021-09-13 14:14:12,544 INFO L281 TraceCheckUtils]: 22: Hoare triple {2677#(and (<= 10 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 10))} assume !!(main_~x~0 % 4294967296 < 100000000); {2677#(and (<= 10 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 10))} is VALID [2021-09-13 14:14:12,545 INFO L281 TraceCheckUtils]: 23: Hoare triple {2677#(and (<= 10 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 10))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2678#(and (<= 11 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 11))} is VALID [2021-09-13 14:14:12,545 INFO L281 TraceCheckUtils]: 24: Hoare triple {2678#(and (<= 11 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 11))} assume !!(main_~x~0 % 4294967296 < 100000000); {2678#(and (<= 11 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 11))} is VALID [2021-09-13 14:14:12,546 INFO L281 TraceCheckUtils]: 25: Hoare triple {2678#(and (<= 11 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 11))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2679#(and (<= ULTIMATE.start_main_~x~0 12) (<= 12 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,546 INFO L281 TraceCheckUtils]: 26: Hoare triple {2679#(and (<= ULTIMATE.start_main_~x~0 12) (<= 12 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {2679#(and (<= ULTIMATE.start_main_~x~0 12) (<= 12 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,547 INFO L281 TraceCheckUtils]: 27: Hoare triple {2679#(and (<= ULTIMATE.start_main_~x~0 12) (<= 12 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2680#(and (<= ULTIMATE.start_main_~x~0 13) (<= 13 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,548 INFO L281 TraceCheckUtils]: 28: Hoare triple {2680#(and (<= ULTIMATE.start_main_~x~0 13) (<= 13 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {2680#(and (<= ULTIMATE.start_main_~x~0 13) (<= 13 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,549 INFO L281 TraceCheckUtils]: 29: Hoare triple {2680#(and (<= ULTIMATE.start_main_~x~0 13) (<= 13 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2681#(and (<= ULTIMATE.start_main_~x~0 14) (<= 14 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,549 INFO L281 TraceCheckUtils]: 30: Hoare triple {2681#(and (<= ULTIMATE.start_main_~x~0 14) (<= 14 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {2681#(and (<= ULTIMATE.start_main_~x~0 14) (<= 14 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,550 INFO L281 TraceCheckUtils]: 31: Hoare triple {2681#(and (<= ULTIMATE.start_main_~x~0 14) (<= 14 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2682#(and (<= ULTIMATE.start_main_~x~0 15) (<= 15 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,550 INFO L281 TraceCheckUtils]: 32: Hoare triple {2682#(and (<= ULTIMATE.start_main_~x~0 15) (<= 15 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {2682#(and (<= ULTIMATE.start_main_~x~0 15) (<= 15 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,551 INFO L281 TraceCheckUtils]: 33: Hoare triple {2682#(and (<= ULTIMATE.start_main_~x~0 15) (<= 15 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2683#(and (<= 16 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 16))} is VALID [2021-09-13 14:14:12,551 INFO L281 TraceCheckUtils]: 34: Hoare triple {2683#(and (<= 16 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 16))} assume !!(main_~x~0 % 4294967296 < 100000000); {2683#(and (<= 16 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 16))} is VALID [2021-09-13 14:14:12,552 INFO L281 TraceCheckUtils]: 35: Hoare triple {2683#(and (<= 16 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 16))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2684#(and (<= 17 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 17))} is VALID [2021-09-13 14:14:12,552 INFO L281 TraceCheckUtils]: 36: Hoare triple {2684#(and (<= 17 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 17))} assume !!(main_~x~0 % 4294967296 < 100000000); {2684#(and (<= 17 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 17))} is VALID [2021-09-13 14:14:12,553 INFO L281 TraceCheckUtils]: 37: Hoare triple {2684#(and (<= 17 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 17))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2685#(and (<= ULTIMATE.start_main_~x~0 18) (<= 18 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,554 INFO L281 TraceCheckUtils]: 38: Hoare triple {2685#(and (<= ULTIMATE.start_main_~x~0 18) (<= 18 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {2685#(and (<= ULTIMATE.start_main_~x~0 18) (<= 18 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,554 INFO L281 TraceCheckUtils]: 39: Hoare triple {2685#(and (<= ULTIMATE.start_main_~x~0 18) (<= 18 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2686#(and (<= 19 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 19))} is VALID [2021-09-13 14:14:12,555 INFO L281 TraceCheckUtils]: 40: Hoare triple {2686#(and (<= 19 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 19))} assume !!(main_~x~0 % 4294967296 < 100000000); {2686#(and (<= 19 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 19))} is VALID [2021-09-13 14:14:12,555 INFO L281 TraceCheckUtils]: 41: Hoare triple {2686#(and (<= 19 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 19))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2687#(and (<= 20 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 20))} is VALID [2021-09-13 14:14:12,556 INFO L281 TraceCheckUtils]: 42: Hoare triple {2687#(and (<= 20 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 20))} assume !!(main_~x~0 % 4294967296 < 100000000); {2687#(and (<= 20 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 20))} is VALID [2021-09-13 14:14:12,556 INFO L281 TraceCheckUtils]: 43: Hoare triple {2687#(and (<= 20 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 20))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2688#(and (<= ULTIMATE.start_main_~x~0 21) (<= 21 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,557 INFO L281 TraceCheckUtils]: 44: Hoare triple {2688#(and (<= ULTIMATE.start_main_~x~0 21) (<= 21 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {2688#(and (<= ULTIMATE.start_main_~x~0 21) (<= 21 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,557 INFO L281 TraceCheckUtils]: 45: Hoare triple {2688#(and (<= ULTIMATE.start_main_~x~0 21) (<= 21 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2689#(and (<= 22 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 22))} is VALID [2021-09-13 14:14:12,558 INFO L281 TraceCheckUtils]: 46: Hoare triple {2689#(and (<= 22 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 22))} assume !!(main_~x~0 % 4294967296 < 100000000); {2689#(and (<= 22 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 22))} is VALID [2021-09-13 14:14:12,560 INFO L281 TraceCheckUtils]: 47: Hoare triple {2689#(and (<= 22 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 22))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2690#(and (<= 23 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 23))} is VALID [2021-09-13 14:14:12,561 INFO L281 TraceCheckUtils]: 48: Hoare triple {2690#(and (<= 23 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 23))} assume !!(main_~x~0 % 4294967296 < 100000000); {2690#(and (<= 23 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 23))} is VALID [2021-09-13 14:14:12,562 INFO L281 TraceCheckUtils]: 49: Hoare triple {2690#(and (<= 23 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 23))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2691#(and (<= 24 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 24))} is VALID [2021-09-13 14:14:12,562 INFO L281 TraceCheckUtils]: 50: Hoare triple {2691#(and (<= 24 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 24))} assume !!(main_~x~0 % 4294967296 < 100000000); {2691#(and (<= 24 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 24))} is VALID [2021-09-13 14:14:12,563 INFO L281 TraceCheckUtils]: 51: Hoare triple {2691#(and (<= 24 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 24))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2692#(and (<= 25 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 25))} is VALID [2021-09-13 14:14:12,563 INFO L281 TraceCheckUtils]: 52: Hoare triple {2692#(and (<= 25 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 25))} assume !!(main_~x~0 % 4294967296 < 100000000); {2692#(and (<= 25 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 25))} is VALID [2021-09-13 14:14:12,564 INFO L281 TraceCheckUtils]: 53: Hoare triple {2692#(and (<= 25 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 25))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2693#(and (<= ULTIMATE.start_main_~x~0 26) (<= 26 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,565 INFO L281 TraceCheckUtils]: 54: Hoare triple {2693#(and (<= ULTIMATE.start_main_~x~0 26) (<= 26 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {2693#(and (<= ULTIMATE.start_main_~x~0 26) (<= 26 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,565 INFO L281 TraceCheckUtils]: 55: Hoare triple {2693#(and (<= ULTIMATE.start_main_~x~0 26) (<= 26 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2694#(and (<= 27 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 27))} is VALID [2021-09-13 14:14:12,566 INFO L281 TraceCheckUtils]: 56: Hoare triple {2694#(and (<= 27 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 27))} assume !!(main_~x~0 % 4294967296 < 100000000); {2694#(and (<= 27 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 27))} is VALID [2021-09-13 14:14:12,566 INFO L281 TraceCheckUtils]: 57: Hoare triple {2694#(and (<= 27 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 27))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2695#(and (<= 28 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 28))} is VALID [2021-09-13 14:14:12,567 INFO L281 TraceCheckUtils]: 58: Hoare triple {2695#(and (<= 28 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 28))} assume !!(main_~x~0 % 4294967296 < 100000000); {2695#(and (<= 28 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 28))} is VALID [2021-09-13 14:14:12,567 INFO L281 TraceCheckUtils]: 59: Hoare triple {2695#(and (<= 28 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 28))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2696#(and (<= 29 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 29))} is VALID [2021-09-13 14:14:12,568 INFO L281 TraceCheckUtils]: 60: Hoare triple {2696#(and (<= 29 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 29))} assume !!(main_~x~0 % 4294967296 < 100000000); {2696#(and (<= 29 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 29))} is VALID [2021-09-13 14:14:12,569 INFO L281 TraceCheckUtils]: 61: Hoare triple {2696#(and (<= 29 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 29))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2697#(and (<= 30 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 30))} is VALID [2021-09-13 14:14:12,569 INFO L281 TraceCheckUtils]: 62: Hoare triple {2697#(and (<= 30 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 30))} assume !!(main_~x~0 % 4294967296 < 100000000); {2697#(and (<= 30 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 30))} is VALID [2021-09-13 14:14:12,570 INFO L281 TraceCheckUtils]: 63: Hoare triple {2697#(and (<= 30 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 30))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2698#(and (<= 31 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 31))} is VALID [2021-09-13 14:14:12,570 INFO L281 TraceCheckUtils]: 64: Hoare triple {2698#(and (<= 31 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 31))} assume !!(main_~x~0 % 4294967296 < 100000000); {2698#(and (<= 31 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 31))} is VALID [2021-09-13 14:14:12,571 INFO L281 TraceCheckUtils]: 65: Hoare triple {2698#(and (<= 31 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 31))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2699#(and (<= 32 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 32))} is VALID [2021-09-13 14:14:12,571 INFO L281 TraceCheckUtils]: 66: Hoare triple {2699#(and (<= 32 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 32))} assume !!(main_~x~0 % 4294967296 < 100000000); {2699#(and (<= 32 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 32))} is VALID [2021-09-13 14:14:12,572 INFO L281 TraceCheckUtils]: 67: Hoare triple {2699#(and (<= 32 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 32))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2700#(and (<= 33 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 33))} is VALID [2021-09-13 14:14:12,572 INFO L281 TraceCheckUtils]: 68: Hoare triple {2700#(and (<= 33 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 33))} assume !!(main_~x~0 % 4294967296 < 100000000); {2700#(and (<= 33 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 33))} is VALID [2021-09-13 14:14:12,573 INFO L281 TraceCheckUtils]: 69: Hoare triple {2700#(and (<= 33 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 33))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2701#(and (<= 34 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 34))} is VALID [2021-09-13 14:14:12,574 INFO L281 TraceCheckUtils]: 70: Hoare triple {2701#(and (<= 34 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 34))} assume !!(main_~x~0 % 4294967296 < 100000000); {2701#(and (<= 34 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 34))} is VALID [2021-09-13 14:14:12,574 INFO L281 TraceCheckUtils]: 71: Hoare triple {2701#(and (<= 34 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 34))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2702#(and (<= 35 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 35))} is VALID [2021-09-13 14:14:12,575 INFO L281 TraceCheckUtils]: 72: Hoare triple {2702#(and (<= 35 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 35))} assume !!(main_~x~0 % 4294967296 < 100000000); {2702#(and (<= 35 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 35))} is VALID [2021-09-13 14:14:12,575 INFO L281 TraceCheckUtils]: 73: Hoare triple {2702#(and (<= 35 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 35))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2703#(and (<= ULTIMATE.start_main_~x~0 36) (<= 36 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,576 INFO L281 TraceCheckUtils]: 74: Hoare triple {2703#(and (<= ULTIMATE.start_main_~x~0 36) (<= 36 ULTIMATE.start_main_~x~0))} assume !!(main_~x~0 % 4294967296 < 100000000); {2703#(and (<= ULTIMATE.start_main_~x~0 36) (<= 36 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:14:12,577 INFO L281 TraceCheckUtils]: 75: Hoare triple {2703#(and (<= ULTIMATE.start_main_~x~0 36) (<= 36 ULTIMATE.start_main_~x~0))} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2704#(and (<= ULTIMATE.start_main_~x~0 37) (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)))} is VALID [2021-09-13 14:14:12,577 INFO L281 TraceCheckUtils]: 76: Hoare triple {2704#(and (<= ULTIMATE.start_main_~x~0 37) (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)))} assume !!(main_~x~0 % 4294967296 < 100000000); {2704#(and (<= ULTIMATE.start_main_~x~0 37) (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)))} is VALID [2021-09-13 14:14:12,578 INFO L281 TraceCheckUtils]: 77: Hoare triple {2704#(and (<= ULTIMATE.start_main_~x~0 37) (< 0 (+ (div ULTIMATE.start_main_~x~0 4294967296) 1)))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2666#false} is VALID [2021-09-13 14:14:12,578 INFO L281 TraceCheckUtils]: 78: Hoare triple {2666#false} assume !!(main_~x~0 % 4294967296 < 100000000); {2666#false} is VALID [2021-09-13 14:14:12,578 INFO L281 TraceCheckUtils]: 79: Hoare triple {2666#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2666#false} is VALID [2021-09-13 14:14:12,578 INFO L281 TraceCheckUtils]: 80: Hoare triple {2666#false} assume !!(main_~x~0 % 4294967296 < 100000000); {2666#false} is VALID [2021-09-13 14:14:12,578 INFO L281 TraceCheckUtils]: 81: Hoare triple {2666#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2666#false} is VALID [2021-09-13 14:14:12,578 INFO L281 TraceCheckUtils]: 82: Hoare triple {2666#false} assume !!(main_~x~0 % 4294967296 < 100000000); {2666#false} is VALID [2021-09-13 14:14:12,579 INFO L281 TraceCheckUtils]: 83: Hoare triple {2666#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2666#false} is VALID [2021-09-13 14:14:12,579 INFO L281 TraceCheckUtils]: 84: Hoare triple {2666#false} assume !!(main_~x~0 % 4294967296 < 100000000); {2666#false} is VALID [2021-09-13 14:14:12,579 INFO L281 TraceCheckUtils]: 85: Hoare triple {2666#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2666#false} is VALID [2021-09-13 14:14:12,579 INFO L281 TraceCheckUtils]: 86: Hoare triple {2666#false} assume !!(main_~x~0 % 4294967296 < 100000000); {2666#false} is VALID [2021-09-13 14:14:12,579 INFO L281 TraceCheckUtils]: 87: Hoare triple {2666#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2666#false} is VALID [2021-09-13 14:14:12,579 INFO L281 TraceCheckUtils]: 88: Hoare triple {2666#false} assume !!(main_~x~0 % 4294967296 < 100000000); {2666#false} is VALID [2021-09-13 14:14:12,579 INFO L281 TraceCheckUtils]: 89: Hoare triple {2666#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2666#false} is VALID [2021-09-13 14:14:12,580 INFO L281 TraceCheckUtils]: 90: Hoare triple {2666#false} assume !!(main_~x~0 % 4294967296 < 100000000); {2666#false} is VALID [2021-09-13 14:14:12,580 INFO L281 TraceCheckUtils]: 91: Hoare triple {2666#false} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2666#false} is VALID [2021-09-13 14:14:12,580 INFO L281 TraceCheckUtils]: 92: Hoare triple {2666#false} assume !(main_~x~0 % 4294967296 < 100000000); {2666#false} is VALID [2021-09-13 14:14:12,580 INFO L281 TraceCheckUtils]: 93: Hoare triple {2666#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2666#false} is VALID [2021-09-13 14:14:12,580 INFO L281 TraceCheckUtils]: 94: Hoare triple {2666#false} assume 0 == __VERIFIER_assert_~cond; {2666#false} is VALID [2021-09-13 14:14:12,580 INFO L281 TraceCheckUtils]: 95: Hoare triple {2666#false} assume !false; {2666#false} is VALID [2021-09-13 14:14:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 570 proven. 1406 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-09-13 14:14:12,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:14:12,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728495568] [2021-09-13 14:14:12,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728495568] provided 0 perfect and 1 imperfect interpolant sequences [2021-09-13 14:14:12,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554121002] [2021-09-13 14:14:12,582 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-09-13 14:14:12,583 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:14:12,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:14:12,590 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) [2021-09-13 14:14:12,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-09-13 14:14:15,611 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2021-09-13 14:14:15,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:14:15,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 28 conjunts are in the unsatisfiable core [2021-09-13 14:14:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:14:15,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:14:16,951 INFO L281 TraceCheckUtils]: 0: Hoare triple {2665#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {2665#true} is VALID [2021-09-13 14:14:16,952 INFO L281 TraceCheckUtils]: 1: Hoare triple {2665#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {2665#true} is VALID [2021-09-13 14:14:16,952 INFO L281 TraceCheckUtils]: 2: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,952 INFO L281 TraceCheckUtils]: 3: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,952 INFO L281 TraceCheckUtils]: 4: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,952 INFO L281 TraceCheckUtils]: 5: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,952 INFO L281 TraceCheckUtils]: 6: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,952 INFO L281 TraceCheckUtils]: 7: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,952 INFO L281 TraceCheckUtils]: 8: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,952 INFO L281 TraceCheckUtils]: 9: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,952 INFO L281 TraceCheckUtils]: 10: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,952 INFO L281 TraceCheckUtils]: 11: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,952 INFO L281 TraceCheckUtils]: 12: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,952 INFO L281 TraceCheckUtils]: 13: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,953 INFO L281 TraceCheckUtils]: 14: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,953 INFO L281 TraceCheckUtils]: 15: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,953 INFO L281 TraceCheckUtils]: 16: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,953 INFO L281 TraceCheckUtils]: 17: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,953 INFO L281 TraceCheckUtils]: 18: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,953 INFO L281 TraceCheckUtils]: 19: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,953 INFO L281 TraceCheckUtils]: 20: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,953 INFO L281 TraceCheckUtils]: 21: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,953 INFO L281 TraceCheckUtils]: 22: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,953 INFO L281 TraceCheckUtils]: 23: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,953 INFO L281 TraceCheckUtils]: 24: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,953 INFO L281 TraceCheckUtils]: 25: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,953 INFO L281 TraceCheckUtils]: 26: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,954 INFO L281 TraceCheckUtils]: 27: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,954 INFO L281 TraceCheckUtils]: 28: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,954 INFO L281 TraceCheckUtils]: 29: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,954 INFO L281 TraceCheckUtils]: 30: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,954 INFO L281 TraceCheckUtils]: 31: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,954 INFO L281 TraceCheckUtils]: 32: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,954 INFO L281 TraceCheckUtils]: 33: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,954 INFO L281 TraceCheckUtils]: 34: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,954 INFO L281 TraceCheckUtils]: 35: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,954 INFO L281 TraceCheckUtils]: 36: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,954 INFO L281 TraceCheckUtils]: 37: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,954 INFO L281 TraceCheckUtils]: 38: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,955 INFO L281 TraceCheckUtils]: 39: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,955 INFO L281 TraceCheckUtils]: 40: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,955 INFO L281 TraceCheckUtils]: 41: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,955 INFO L281 TraceCheckUtils]: 42: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,955 INFO L281 TraceCheckUtils]: 43: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,955 INFO L281 TraceCheckUtils]: 44: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,955 INFO L281 TraceCheckUtils]: 45: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,955 INFO L281 TraceCheckUtils]: 46: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,955 INFO L281 TraceCheckUtils]: 47: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,955 INFO L281 TraceCheckUtils]: 48: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,955 INFO L281 TraceCheckUtils]: 49: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,955 INFO L281 TraceCheckUtils]: 50: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,955 INFO L281 TraceCheckUtils]: 51: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,956 INFO L281 TraceCheckUtils]: 52: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,956 INFO L281 TraceCheckUtils]: 53: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,956 INFO L281 TraceCheckUtils]: 54: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,956 INFO L281 TraceCheckUtils]: 55: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,956 INFO L281 TraceCheckUtils]: 56: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,956 INFO L281 TraceCheckUtils]: 57: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,956 INFO L281 TraceCheckUtils]: 58: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,956 INFO L281 TraceCheckUtils]: 59: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,956 INFO L281 TraceCheckUtils]: 60: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,956 INFO L281 TraceCheckUtils]: 61: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,956 INFO L281 TraceCheckUtils]: 62: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,956 INFO L281 TraceCheckUtils]: 63: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,956 INFO L281 TraceCheckUtils]: 64: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,957 INFO L281 TraceCheckUtils]: 65: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,962 INFO L281 TraceCheckUtils]: 66: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,962 INFO L281 TraceCheckUtils]: 67: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,962 INFO L281 TraceCheckUtils]: 68: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,962 INFO L281 TraceCheckUtils]: 69: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,963 INFO L281 TraceCheckUtils]: 70: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,963 INFO L281 TraceCheckUtils]: 71: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,963 INFO L281 TraceCheckUtils]: 72: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,963 INFO L281 TraceCheckUtils]: 73: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:16,963 INFO L281 TraceCheckUtils]: 74: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:16,965 INFO L281 TraceCheckUtils]: 75: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2933#(< (mod (+ ULTIMATE.start_main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2021-09-13 14:14:16,965 INFO L281 TraceCheckUtils]: 76: Hoare triple {2933#(< (mod (+ ULTIMATE.start_main_~x~0 4294967295) 4294967296) 10000000)} assume !!(main_~x~0 % 4294967296 < 100000000); {2933#(< (mod (+ ULTIMATE.start_main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2021-09-13 14:14:16,967 INFO L281 TraceCheckUtils]: 77: Hoare triple {2933#(< (mod (+ ULTIMATE.start_main_~x~0 4294967295) 4294967296) 10000000)} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2940#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967293) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967294) 4294967296)))} is VALID [2021-09-13 14:14:16,967 INFO L281 TraceCheckUtils]: 78: Hoare triple {2940#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967293) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967294) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {2940#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967293) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967294) 4294967296)))} is VALID [2021-09-13 14:14:16,968 INFO L281 TraceCheckUtils]: 79: Hoare triple {2940#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967293) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967294) 4294967296)))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2947#(and (<= 10000000 (mod (+ 4294967292 ULTIMATE.start_main_~x~0) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4294967291) 4294967296) 10000000))} is VALID [2021-09-13 14:14:16,969 INFO L281 TraceCheckUtils]: 80: Hoare triple {2947#(and (<= 10000000 (mod (+ 4294967292 ULTIMATE.start_main_~x~0) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4294967291) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {2947#(and (<= 10000000 (mod (+ 4294967292 ULTIMATE.start_main_~x~0) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4294967291) 4294967296) 10000000))} is VALID [2021-09-13 14:14:16,970 INFO L281 TraceCheckUtils]: 81: Hoare triple {2947#(and (<= 10000000 (mod (+ 4294967292 ULTIMATE.start_main_~x~0) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4294967291) 4294967296) 10000000))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2954#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967289) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967290) 4294967296)))} is VALID [2021-09-13 14:14:16,970 INFO L281 TraceCheckUtils]: 82: Hoare triple {2954#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967289) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967290) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {2954#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967289) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967290) 4294967296)))} is VALID [2021-09-13 14:14:16,971 INFO L281 TraceCheckUtils]: 83: Hoare triple {2954#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967289) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967290) 4294967296)))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2961#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967287) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967288) 4294967296)))} is VALID [2021-09-13 14:14:16,971 INFO L281 TraceCheckUtils]: 84: Hoare triple {2961#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967287) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967288) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {2961#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967287) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967288) 4294967296)))} is VALID [2021-09-13 14:14:16,972 INFO L281 TraceCheckUtils]: 85: Hoare triple {2961#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967287) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967288) 4294967296)))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2968#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967285) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967286) 4294967296)))} is VALID [2021-09-13 14:14:16,973 INFO L281 TraceCheckUtils]: 86: Hoare triple {2968#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967285) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967286) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {2968#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967285) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967286) 4294967296)))} is VALID [2021-09-13 14:14:16,974 INFO L281 TraceCheckUtils]: 87: Hoare triple {2968#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967285) 4294967296) 10000000) (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967286) 4294967296)))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2975#(and (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967284) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4294967283) 4294967296) 10000000))} is VALID [2021-09-13 14:14:16,974 INFO L281 TraceCheckUtils]: 88: Hoare triple {2975#(and (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967284) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4294967283) 4294967296) 10000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {2975#(and (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967284) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4294967283) 4294967296) 10000000))} is VALID [2021-09-13 14:14:16,975 INFO L281 TraceCheckUtils]: 89: Hoare triple {2975#(and (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967284) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4294967283) 4294967296) 10000000))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2982#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967281) 4294967296) 10000000) (<= 10000000 (mod (+ 4294967282 ULTIMATE.start_main_~x~0) 4294967296)))} is VALID [2021-09-13 14:14:16,976 INFO L281 TraceCheckUtils]: 90: Hoare triple {2982#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967281) 4294967296) 10000000) (<= 10000000 (mod (+ 4294967282 ULTIMATE.start_main_~x~0) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {2982#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967281) 4294967296) 10000000) (<= 10000000 (mod (+ 4294967282 ULTIMATE.start_main_~x~0) 4294967296)))} is VALID [2021-09-13 14:14:16,977 INFO L281 TraceCheckUtils]: 91: Hoare triple {2982#(and (< (mod (+ ULTIMATE.start_main_~x~0 4294967281) 4294967296) 10000000) (<= 10000000 (mod (+ 4294967282 ULTIMATE.start_main_~x~0) 4294967296)))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {2989#(and (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967280) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4294967279) 4294967296) 10000000))} is VALID [2021-09-13 14:14:16,979 INFO L281 TraceCheckUtils]: 92: Hoare triple {2989#(and (<= 10000000 (mod (+ ULTIMATE.start_main_~x~0 4294967280) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 4294967279) 4294967296) 10000000))} assume !(main_~x~0 % 4294967296 < 100000000); {2666#false} is VALID [2021-09-13 14:14:16,980 INFO L281 TraceCheckUtils]: 93: Hoare triple {2666#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2666#false} is VALID [2021-09-13 14:14:16,980 INFO L281 TraceCheckUtils]: 94: Hoare triple {2666#false} assume 0 == __VERIFIER_assert_~cond; {2666#false} is VALID [2021-09-13 14:14:16,980 INFO L281 TraceCheckUtils]: 95: Hoare triple {2666#false} assume !false; {2666#false} is VALID [2021-09-13 14:14:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 629 proven. 64 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2021-09-13 14:14:16,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:14:20,407 INFO L281 TraceCheckUtils]: 95: Hoare triple {2666#false} assume !false; {2666#false} is VALID [2021-09-13 14:14:20,408 INFO L281 TraceCheckUtils]: 94: Hoare triple {3005#(< 0 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2666#false} is VALID [2021-09-13 14:14:20,408 INFO L281 TraceCheckUtils]: 93: Hoare triple {3009#(= (mod ULTIMATE.start_main_~x~0 2) 0)} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3005#(< 0 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:14:20,409 INFO L281 TraceCheckUtils]: 92: Hoare triple {3013#(or (< (mod ULTIMATE.start_main_~x~0 4294967296) 100000000) (= (mod ULTIMATE.start_main_~x~0 2) 0))} assume !(main_~x~0 % 4294967296 < 100000000); {3009#(= (mod ULTIMATE.start_main_~x~0 2) 0)} is VALID [2021-09-13 14:14:20,410 INFO L281 TraceCheckUtils]: 91: Hoare triple {3017#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 100000000))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {3013#(or (< (mod ULTIMATE.start_main_~x~0 4294967296) 100000000) (= (mod ULTIMATE.start_main_~x~0 2) 0))} is VALID [2021-09-13 14:14:20,410 INFO L281 TraceCheckUtils]: 90: Hoare triple {3021#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 100000000) (<= 100000000 (mod ULTIMATE.start_main_~x~0 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {3017#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 100000000))} is VALID [2021-09-13 14:14:20,412 INFO L281 TraceCheckUtils]: 89: Hoare triple {3025#(or (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)) (= (mod ULTIMATE.start_main_~x~0 2) 0))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {3021#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296) 100000000) (<= 100000000 (mod ULTIMATE.start_main_~x~0 4294967296)))} is VALID [2021-09-13 14:14:20,412 INFO L281 TraceCheckUtils]: 88: Hoare triple {3025#(or (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)) (= (mod ULTIMATE.start_main_~x~0 2) 0))} assume !!(main_~x~0 % 4294967296 < 100000000); {3025#(or (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)) (= (mod ULTIMATE.start_main_~x~0 2) 0))} is VALID [2021-09-13 14:14:20,414 INFO L281 TraceCheckUtils]: 87: Hoare triple {3032#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 100000000))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {3025#(or (< (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 2) 4294967296)) (= (mod ULTIMATE.start_main_~x~0 2) 0))} is VALID [2021-09-13 14:14:20,414 INFO L281 TraceCheckUtils]: 86: Hoare triple {3032#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 100000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {3032#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 100000000))} is VALID [2021-09-13 14:14:20,415 INFO L281 TraceCheckUtils]: 85: Hoare triple {3039#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296) 100000000))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {3032#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 4) 4294967296)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296) 100000000))} is VALID [2021-09-13 14:14:20,416 INFO L281 TraceCheckUtils]: 84: Hoare triple {3039#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296) 100000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {3039#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296) 100000000))} is VALID [2021-09-13 14:14:20,417 INFO L281 TraceCheckUtils]: 83: Hoare triple {3046#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296)))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {3039#(or (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 6) 4294967296)) (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296) 100000000))} is VALID [2021-09-13 14:14:20,418 INFO L281 TraceCheckUtils]: 82: Hoare triple {3046#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {3046#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296)))} is VALID [2021-09-13 14:14:20,419 INFO L281 TraceCheckUtils]: 81: Hoare triple {3053#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296)))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {3046#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 8) 4294967296)))} is VALID [2021-09-13 14:14:20,420 INFO L281 TraceCheckUtils]: 80: Hoare triple {3053#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {3053#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296)))} is VALID [2021-09-13 14:14:20,421 INFO L281 TraceCheckUtils]: 79: Hoare triple {3060#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296)))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {3053#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 10) 4294967296)))} is VALID [2021-09-13 14:14:20,421 INFO L281 TraceCheckUtils]: 78: Hoare triple {3060#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296)))} assume !!(main_~x~0 % 4294967296 < 100000000); {3060#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296)))} is VALID [2021-09-13 14:14:20,423 INFO L281 TraceCheckUtils]: 77: Hoare triple {3067#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 16) 4294967296) 100000000))} assume !(main_~x~0 % 4294967296 < 10000000);main_~x~0 := 2 + main_~x~0; {3060#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (< (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296) 100000000) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 12) 4294967296)))} is VALID [2021-09-13 14:14:20,424 INFO L281 TraceCheckUtils]: 76: Hoare triple {3067#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 16) 4294967296) 100000000))} assume !!(main_~x~0 % 4294967296 < 100000000); {3067#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 16) 4294967296) 100000000))} is VALID [2021-09-13 14:14:20,429 INFO L281 TraceCheckUtils]: 75: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {3067#(or (= (mod ULTIMATE.start_main_~x~0 2) 0) (<= 100000000 (mod (+ ULTIMATE.start_main_~x~0 14) 4294967296)) (< (mod (+ ULTIMATE.start_main_~x~0 16) 4294967296) 100000000))} is VALID [2021-09-13 14:14:20,429 INFO L281 TraceCheckUtils]: 74: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,430 INFO L281 TraceCheckUtils]: 73: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,430 INFO L281 TraceCheckUtils]: 72: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,430 INFO L281 TraceCheckUtils]: 71: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,430 INFO L281 TraceCheckUtils]: 70: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,430 INFO L281 TraceCheckUtils]: 69: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,430 INFO L281 TraceCheckUtils]: 68: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,431 INFO L281 TraceCheckUtils]: 67: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,431 INFO L281 TraceCheckUtils]: 66: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,431 INFO L281 TraceCheckUtils]: 65: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,431 INFO L281 TraceCheckUtils]: 64: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,431 INFO L281 TraceCheckUtils]: 63: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,431 INFO L281 TraceCheckUtils]: 62: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,431 INFO L281 TraceCheckUtils]: 61: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,432 INFO L281 TraceCheckUtils]: 60: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,432 INFO L281 TraceCheckUtils]: 59: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,432 INFO L281 TraceCheckUtils]: 58: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,432 INFO L281 TraceCheckUtils]: 57: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,432 INFO L281 TraceCheckUtils]: 56: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,432 INFO L281 TraceCheckUtils]: 55: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,433 INFO L281 TraceCheckUtils]: 54: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,433 INFO L281 TraceCheckUtils]: 53: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,433 INFO L281 TraceCheckUtils]: 52: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,433 INFO L281 TraceCheckUtils]: 51: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,433 INFO L281 TraceCheckUtils]: 50: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,433 INFO L281 TraceCheckUtils]: 49: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,433 INFO L281 TraceCheckUtils]: 48: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,434 INFO L281 TraceCheckUtils]: 47: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,434 INFO L281 TraceCheckUtils]: 46: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,434 INFO L281 TraceCheckUtils]: 45: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,434 INFO L281 TraceCheckUtils]: 44: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,434 INFO L281 TraceCheckUtils]: 43: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,434 INFO L281 TraceCheckUtils]: 42: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,435 INFO L281 TraceCheckUtils]: 41: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,435 INFO L281 TraceCheckUtils]: 40: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,435 INFO L281 TraceCheckUtils]: 39: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,435 INFO L281 TraceCheckUtils]: 38: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,435 INFO L281 TraceCheckUtils]: 37: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,435 INFO L281 TraceCheckUtils]: 36: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,435 INFO L281 TraceCheckUtils]: 35: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,436 INFO L281 TraceCheckUtils]: 34: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,436 INFO L281 TraceCheckUtils]: 33: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,436 INFO L281 TraceCheckUtils]: 32: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,436 INFO L281 TraceCheckUtils]: 31: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,436 INFO L281 TraceCheckUtils]: 30: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,436 INFO L281 TraceCheckUtils]: 29: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,436 INFO L281 TraceCheckUtils]: 28: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,437 INFO L281 TraceCheckUtils]: 27: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,437 INFO L281 TraceCheckUtils]: 26: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,437 INFO L281 TraceCheckUtils]: 25: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,437 INFO L281 TraceCheckUtils]: 24: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,437 INFO L281 TraceCheckUtils]: 23: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,437 INFO L281 TraceCheckUtils]: 22: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,438 INFO L281 TraceCheckUtils]: 21: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,438 INFO L281 TraceCheckUtils]: 20: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,438 INFO L281 TraceCheckUtils]: 19: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,438 INFO L281 TraceCheckUtils]: 18: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,438 INFO L281 TraceCheckUtils]: 17: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,438 INFO L281 TraceCheckUtils]: 16: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,438 INFO L281 TraceCheckUtils]: 15: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,439 INFO L281 TraceCheckUtils]: 14: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,439 INFO L281 TraceCheckUtils]: 13: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,439 INFO L281 TraceCheckUtils]: 12: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,439 INFO L281 TraceCheckUtils]: 11: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,439 INFO L281 TraceCheckUtils]: 10: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,439 INFO L281 TraceCheckUtils]: 9: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,440 INFO L281 TraceCheckUtils]: 8: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,440 INFO L281 TraceCheckUtils]: 7: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,440 INFO L281 TraceCheckUtils]: 6: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,440 INFO L281 TraceCheckUtils]: 5: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,440 INFO L281 TraceCheckUtils]: 4: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,440 INFO L281 TraceCheckUtils]: 3: Hoare triple {2665#true} assume main_~x~0 % 4294967296 < 10000000;main_#t~post7 := main_~x~0;main_~x~0 := 1 + main_#t~post7;havoc main_#t~post7; {2665#true} is VALID [2021-09-13 14:14:20,440 INFO L281 TraceCheckUtils]: 2: Hoare triple {2665#true} assume !!(main_~x~0 % 4294967296 < 100000000); {2665#true} is VALID [2021-09-13 14:14:20,441 INFO L281 TraceCheckUtils]: 1: Hoare triple {2665#true} havoc main_#res;havoc main_#t~post7, main_~x~0;main_~x~0 := 0; {2665#true} is VALID [2021-09-13 14:14:20,441 INFO L281 TraceCheckUtils]: 0: Hoare triple {2665#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); {2665#true} is VALID [2021-09-13 14:14:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 629 proven. 64 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2021-09-13 14:14:20,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554121002] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:14:20,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-09-13 14:14:20,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 11, 14] total 61 [2021-09-13 14:14:20,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910204262] [2021-09-13 14:14:20,451 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.0491803278688523) internal successors, (125), 61 states have internal predecessors, (125), 0 states have call successors, (0), 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 96 [2021-09-13 14:14:20,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:14:20,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 2.0491803278688523) internal successors, (125), 61 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:20,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:20,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-09-13 14:14:20,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:14:20,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-09-13 14:14:20,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=700, Invalid=2960, Unknown=0, NotChecked=0, Total=3660 [2021-09-13 14:14:20,679 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand has 61 states, 61 states have (on average 2.0491803278688523) internal successors, (125), 61 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:27,990 INFO L93 Difference]: Finished difference Result 151 states and 176 transitions. [2021-09-13 14:14:27,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-09-13 14:14:27,990 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.0491803278688523) internal successors, (125), 61 states have internal predecessors, (125), 0 states have call successors, (0), 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 96 [2021-09-13 14:14:27,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:14:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.0491803278688523) internal successors, (125), 61 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 118 transitions. [2021-09-13 14:14:27,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.0491803278688523) internal successors, (125), 61 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 118 transitions. [2021-09-13 14:14:27,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 118 transitions. [2021-09-13 14:14:28,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:14:28,139 INFO L225 Difference]: With dead ends: 151 [2021-09-13 14:14:28,139 INFO L226 Difference]: Without dead ends: 0 [2021-09-13 14:14:28,141 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3506.06ms TimeCoverageRelationStatistics Valid=764, Invalid=3142, Unknown=0, NotChecked=0, Total=3906 [2021-09-13 14:14:28,141 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3286 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3605.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.79ms SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 3286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3623.42ms IncrementalHoareTripleChecker+Time [2021-09-13 14:14:28,141 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 3598 Unknown, 0 Unchecked, 11.79ms Time], IncrementalHoareTripleChecker [312 Valid, 3286 Invalid, 0 Unknown, 0 Unchecked, 3623.42ms Time] [2021-09-13 14:14:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-09-13 14:14:28,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-09-13 14:14:28,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:14:28,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:28,142 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:28,142 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:28,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:28,142 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:14:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:14:28,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:28,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:28,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2021-09-13 14:14:28,143 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2021-09-13 14:14:28,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:14:28,143 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-09-13 14:14:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:14:28,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:28,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:14:28,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:14:28,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:14:28,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-09-13 14:14:28,144 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2021-09-13 14:14:28,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:14:28,144 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-09-13 14:14:28,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.0491803278688523) internal successors, (125), 61 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-13 14:14:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-09-13 14:14:28,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:14:28,147 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-09-13 14:14:28,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-09-13 14:14:28,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:14:28,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-09-13 14:14:28,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:14:28,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-09-13 14:14:44,079 WARN L210 SmtUtils]: Spent 15.63s on a formula simplification. DAG size of input: 129 DAG size of output: 12 [2021-09-13 14:14:44,082 INFO L858 garLoopResultBuilder]: For program point L4-3(line 4) no Hoare annotation was computed. [2021-09-13 14:14:44,082 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-09-13 14:14:44,083 INFO L861 garLoopResultBuilder]: At program point L17(lines 5 18) the Hoare annotation is: true [2021-09-13 14:14:44,083 INFO L858 garLoopResultBuilder]: For program point L9(lines 9 13) no Hoare annotation was computed. [2021-09-13 14:14:44,083 INFO L854 garLoopResultBuilder]: At program point L9-2(lines 8 14) the Hoare annotation is: (or (< (mod (+ ULTIMATE.start_main_~x~0 4294967295) 4294967296) 10000000) (= (mod ULTIMATE.start_main_~x~0 2) 0)) [2021-09-13 14:14:44,083 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-09-13 14:14:44,083 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-09-13 14:14:44,083 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-09-13 14:14:44,083 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2021-09-13 14:14:44,083 INFO L858 garLoopResultBuilder]: For program point L8-2(lines 8 14) no Hoare annotation was computed. [2021-09-13 14:14:44,084 INFO L858 garLoopResultBuilder]: For program point L4(line 4) no Hoare annotation was computed. [2021-09-13 14:14:44,084 INFO L858 garLoopResultBuilder]: For program point L4-1(line 4) no Hoare annotation was computed. [2021-09-13 14:14:44,086 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:14:44,088 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:14:44,089 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:14:44,089 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2021-09-13 14:14:44,089 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2021-09-13 14:14:44,089 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2021-09-13 14:14:44,089 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2021-09-13 14:14:44,089 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2021-09-13 14:14:44,089 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2021-09-13 14:14:44,089 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2021-09-13 14:14:44,089 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2021-09-13 14:14:44,089 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2021-09-13 14:14:44,089 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2021-09-13 14:14:44,090 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2021-09-13 14:14:44,090 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:14:44,090 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:14:44,090 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 14:14:44,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:14:44 BoogieIcfgContainer [2021-09-13 14:14:44,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:14:44,097 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:14:44,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:14:44,097 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:14:44,097 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:12:51" (3/4) ... [2021-09-13 14:14:44,099 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-09-13 14:14:44,105 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-09-13 14:14:44,106 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-09-13 14:14:44,106 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:14:44,106 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-09-13 14:14:44,125 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-13 14:14:44,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:14:44,126 INFO L158 Benchmark]: Toolchain (without parser) took 113296.74ms. Allocated memory was 69.2MB in the beginning and 107.0MB in the end (delta: 37.7MB). Free memory was 49.9MB in the beginning and 60.3MB in the end (delta: -10.4MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2021-09-13 14:14:44,126 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 69.2MB. Free memory was 50.2MB in the beginning and 50.2MB in the end (delta: 32.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:14:44,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.09ms. Allocated memory is still 69.2MB. Free memory was 49.8MB in the beginning and 52.4MB in the end (delta: -2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:14:44,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.21ms. Allocated memory is still 69.2MB. Free memory was 52.4MB in the beginning and 50.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:14:44,127 INFO L158 Benchmark]: Boogie Preprocessor took 15.25ms. Allocated memory is still 69.2MB. Free memory was 50.9MB in the beginning and 49.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:14:44,127 INFO L158 Benchmark]: RCFGBuilder took 293.77ms. Allocated memory is still 69.2MB. Free memory was 49.8MB in the beginning and 40.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:14:44,128 INFO L158 Benchmark]: TraceAbstraction took 112720.47ms. Allocated memory was 69.2MB in the beginning and 107.0MB in the end (delta: 37.7MB). Free memory was 40.0MB in the beginning and 62.4MB in the end (delta: -22.4MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2021-09-13 14:14:44,128 INFO L158 Benchmark]: Witness Printer took 28.59ms. Allocated memory is still 107.0MB. Free memory was 62.4MB in the beginning and 60.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:14:44,132 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 69.2MB. Free memory was 50.2MB in the beginning and 50.2MB in the end (delta: 32.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.09ms. Allocated memory is still 69.2MB. Free memory was 49.8MB in the beginning and 52.4MB in the end (delta: -2.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.21ms. Allocated memory is still 69.2MB. Free memory was 52.4MB in the beginning and 50.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.25ms. Allocated memory is still 69.2MB. Free memory was 50.9MB in the beginning and 49.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 293.77ms. Allocated memory is still 69.2MB. Free memory was 49.8MB in the beginning and 40.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 112720.47ms. Allocated memory was 69.2MB in the beginning and 107.0MB in the end (delta: 37.7MB). Free memory was 40.0MB in the beginning and 62.4MB in the end (delta: -22.4MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. * Witness Printer took 28.59ms. Allocated memory is still 107.0MB. Free memory was 62.4MB in the beginning and 60.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 112648.80ms, OverallIterations: 9, TraceHistogramMax: 45, EmptinessCheckTime: 27.55ms, AutomataDifference: 78028.09ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 15722.89ms, InitialAbstractionConstructionTime: 10.28ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 324 SdHoareTripleChecker+Valid, 5391.34ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 324 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 5352.64ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 210 mSDsCounter, 535 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4758 IncrementalHoareTripleChecker+Invalid, 5293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 535 mSolverCounterUnsat, 0 mSDtfsCounter, 4758 mSolverCounterSat, 29.26ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 620 GetRequests, 423 SyntacticMatches, 5 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 69045.22ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=8, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 396.44ms AutomataMinimizationTime, 9 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 61 NumberOfFragments, 14 HoareAnnotationTreeSize, 2 FomulaSimplifications, 8122 FormulaSimplificationTreeSizeReduction, 89.19ms HoareSimplificationTime, 2 FomulaSimplificationsInter, 357 FormulaSimplificationTreeSizeReductionInter, 15627.65ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 64.32ms SsaConstructionTime, 3829.99ms SatisfiabilityAnalysisTime, 12184.26ms InterpolantComputationTime, 500 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 721 ConstructedInterpolants, 0 QuantifiedInterpolants, 3550 SizeOfPredicates, 7 NumberOfNonLiveVariables, 643 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 6160/8895 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: (x + 4294967295) % 4294967296 < 10000000 || x % 2 == 0 RESULT: Ultimate proved your program to be correct! [2021-09-13 14:14:44,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...